Nearly optimal sparse fourier transform

Nearly optimal sparse fourier transform

We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero Fourier coefficients, and An O(k log n log(n/k))-time randomized a...

Full description

Bibliographic Details
Main Authors: Hassanieh, Haitham (Contributor), Indyk, Piotr (Contributor), Katabi, Dina (Contributor), Price, Eric C. (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2012-09-17T14:40:46Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items