Sameer Pawar, Kannan Ramchandran. Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. pages 464-468, IEEE, 2013. [doi]
@inproceedings{PawarR13-0,
title = {Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity},
author = {Sameer Pawar and Kannan Ramchandran},
year = {2013},
doi = {10.1109/ISIT.2013.6620269},
url = {http://dx.doi.org/10.1109/ISIT.2013.6620269},
researchr = {https://researchr.org/publication/PawarR13-0},
cites = {0},
citedby = {0},
pages = {464-468},
booktitle = {Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013},
publisher = {IEEE},
}