Simple and practical algorithm for sparse fourier transform

Simple and practical algorithm for sparse fourier transform

We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coe fficients of the Fourier transform of x. The problem is of key interest in several areas, including signal processing, audio/image/video compression, a...

Full description

Bibliographic Details
Main Authors: Hassanieh, Haitham, Indyk, Piotr, Katabi, Dina, Price, Eric C.
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Society for Industrial and Applied Mathematics 2012
Online Access:http://hdl.handle.net/1721.1/73474
https://orcid.org/0000-0002-6689-8189
https://orcid.org/0000-0003-4854-4157
https://orcid.org/0000-0002-7983-9524

Internet

http://hdl.handle.net/1721.1/73474
https://orcid.org/0000-0002-6689-8189
https://orcid.org/0000-0003-4854-4157
https://orcid.org/0000-0002-7983-9524

Similar Items