IPB

Welcome Guest ( Log In | Register )

Sparse Fast Fourier Transform, The faster-than-fast Fourier transform
16 Hz
post Feb 10 2012, 19:55
Post #1





Group: Members
Posts: 6
Joined: 27-November 09
From: Argentina
Member No.: 75344



Hello.
I don't know if this topic was already mentioned here (I wasn't able to find it).

Somebody here could find it interesting:

MIT news article: The faster-than-fast Fourier transform

sFFT web page: sFFT: Sparse Fast Fourier Transform

Best regards.

Omar
Go to the top of the page
+Quote Post
 
Start new topic
Replies
romor
post Feb 10 2012, 21:15
Post #2





Group: Members
Posts: 670
Joined: 16-January 09
Member No.: 65630



LossyFFT


--------------------
scripts: http://goo.gl/M1qVLQ
Go to the top of the page
+Quote Post
16 Hz
post Feb 10 2012, 21:43
Post #3





Group: Members
Posts: 6
Joined: 27-November 09
From: Argentina
Member No.: 75344



QUOTE (romor @ Feb 10 2012, 17:15) *
LossyFFT

Transforming a signal to frequency domain, isn't always lossy?
Or is it possible to do a time->freq->time conversion in a lossless way?
Go to the top of the page
+Quote Post
alexeysp
post Feb 10 2012, 22:16
Post #4





Group: Members
Posts: 130
Joined: 3-April 09
Member No.: 68627



QUOTE (16 Hz @ Feb 10 2012, 23:43) *
Transforming a signal to frequency domain, isn't always lossy?


DFT is an orthogonal linear transform, and as such is always inversible. In other words, it is lossless (up to the computation roundoff error in practice).
Go to the top of the page
+Quote Post

Posts in this topic


Reply to this topicStart new topic
1 User(s) are reading this topic (1 Guests and 0 Anonymous Users)
0 Members:

 



RSS Lo-Fi Version Time is now: 22nd August 2014 - 00:59