[IEEE 2013 IEEE International Symposium on Information Theory (ISIT) - Istanbul, Turkey (2013.07.7-2013.07.12)] 2013 IEEE International Symposium on Information Theory - Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity
Pawar, Sameer, Ramchandran, KannanYear:
2013
Language:
english
DOI:
10.1109/isit.2013.6620269
File:
PDF, 576 KB
english, 2013