Description: Sparse Fast Fourier Transform (SFFT) is a class of sub-linear time algorithms for computing the discrete Fourier
transform of a time domain signal which is sparse in the frequency domain, i.e. there are very few “large”
coefficients in the frequency domain. The algorithm was presented in [1]. As reported in that paper, experiments
with two C++ implementations of the algorithm (SFFT 1.0 and 2.0) demonstrates practical improvement in
the runtime over Fast Fourier Transform (FFT) for a wide range of signal sparsities.
To Search:
File list (Check if you may need any files):
47651486sFFT-1.0-2.0.tar
Download