R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT.

The fast Fourier transform is the most efficiently known way to compute the discrete Fourier transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X⃗ of the signal x⃗ has only k non-zero coefficients (where k <; n), can we do better? We addressed this question and presented a novel fast Fourier aliasing-based sparse transform (FFAST) algorith...