A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes.

Sameer Pawar, Kannan Ramchandran

Browse the full ISIT paper archive.