Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity.

Sameer Pawar, Kannan Ramchandran

Browse the full ISIT paper archive.