FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time | IEEE Journals & Magazine | IEEE Xplore