FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time

Sameer Pawar, Kannan RamchandranIEEE Trans. Information Theory 2018 · DOI

BibTeX
@article{pawar2018ffast,
  author = {Sameer Pawar and Kannan Ramchandran},
  title = {{FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time}},
  journal = {IEEE Trans. Information Theory},
  year = {2018},
  doi = {10.1109/tit.2017.2746568},
}

Loading related content...

Figure