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: 8
Joined: 27-November 09
From: Argentina
Member No.: 75344

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.

Go to the top of the page
+Quote Post
Start new topic
post Feb 10 2012, 22:12
Post #2

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


Yes, x=ifft(fft(x)) within numerical accuracy, i.e. doing it out-of-box in numpy err is 1e-16

The work you are presenting to us, throws away insignificant frequencies

scripts: http://goo.gl/M1qVLQ
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: 1st December 2015 - 08:18