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 Sep 22 2012, 15:09
Post #2





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



Another sparse attack - QTT–FFT (quantized tensor train):

QUOTE
... Combining the QTT–FFT algorithm with a method that computes QTT representation
from several elements (samples) of a given vector, we compare it with Sparse Fourier
transform algorithms. By numerical examples we show that our approach can be competitive
with the existing methods for the Fourier-sparse signals with randomly distributed
components, especially for higher dimensions. Our approach is especially advantageous
for the signals with limited bandwidth, which are not exactly Fourier-sparse...


Paper link: fft2.pdf


--------------------
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: 18th April 2014 - 14:48