Fetching the paper…
Reading the bibliography…
We study the problem of estimating the best B term Fourier representation for a given frequency-sparse signal (i.e., vector) $\textbf{A}$ of length $N \gg B$.
An algorithm for the machine calculation of complex Fourier series
J. Cooley and J. Tukey · 1965
Earlier work this paper cites.
The Chirp z-Transform Algorithm
L. Rabiner, R. Schafer, and C. Rader · 1969
Earlier work this paper cites.
A Linear Filtering Approach to the Computation of Discrete Fourier Transform
L. I. Bluestein · 1970
Earlier work this paper cites.
Fourier Analysis and Its Applications
G. B. Folland · 1992
Earlier work this paper cites.
Fast Fourier transforms for nonequispaced data
A. Dutt and V. Rokhlin · 1993
Earlier work this paper cites.
Applied Numerical Analysis
C. F. Gerald and P. O. Wheatley · 1994
Earlier work this paper cites.
Rapid computation of the discrete Fourier transform
C. Anderson and M. D. Dahleh · 1996
Earlier work this paper cites.
Chebyshev and Fourier Spectral Methods
J. P. Boyd · 2001
Earlier work this paper cites.
Near-optimal sparse Fourier estimation via sampling
A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss · 2002
Earlier work this paper cites.
Explicit constructions of selectors and related combinatorial structures, with applications
P. Indyk · 2002
Cited alongside, same era.
Nonuniform Fast fourier transforms using min-max interpolation
J. A. Fessler and B. P. Sutton · 2003
Cited alongside, same era.
Combinatorial Algorithms for Compressed Sensing
G. Cormode and S. Muthukrishnan · 2005
Cited alongside, same era.
Improved time bounds for near-optimal sparse Fourier representations
A. Gilbert, S. Muthukrishnan, and M. Strauss · 2005
Cited alongside, same era.
The type 3 nonuniform FFT and its applications
J.-Y. Lee and L. Greengard · 2005
Cited alongside, same era.
Data Streams: Algorithms and Applications
S. Muthukrishnan · 2005
Cited alongside, same era.
CR-precis: A deterministic summary structure for update data streams
S. Ganguly and A. Majumder · 2006
Later among the works it cites.
Analog-to-information conversion via random demodulation
S. Kirolos, J. Laska, M. Wakin, M. Duarte, D. Baron, T. Ragheb, Y. Massoud, and R. Baraniuk · 2006
Later among the works it cites.
Random sampling for analog-to-information conversion of wideband signals
J. Laska, S. Kirolos, Y. Massoud, R. Baraniuk, A. Gilbert, M. Iwen, and M. Strauss · 2006
Later among the works it cites.
Some Algorithmic Problems and Results in Compressed Sensing
S. Muthukrishnan · 2006
Later among the works it cites.
A sparse spectral method for homogenization multiscale problems
I. Daubechies, O. Runborg, and J. Zou · 2007
Closest in time.
Deterministic constructions of compressed sensing matrices
R. A. DeVore · 2007
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Signal recovery from partial information via orthogonal matching pursuit
J. Tropp and A. Gilbert · 2005
Cited alongside, same era.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
E. Candes, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Combinatorial Algorithms for Compressed Sensing
G. Cormode and S. Muthukrishnan · 2006
Cited alongside, same era.
Unpublished Results
M. A. Iwen
Cited in the paper.
Closest in time.
Empirical evaluation of a sub-linear time sparse DFT algorithm
M. A. Iwen, A. C. Gilbert, and M. J. Strauss · 2007
Closest in time.
Sparse MRI: The application of compressed sensing for rapid MR imaging
M. Lustig, D. Donoho, and J. Pauly · 2007
Closest in time.
Signal recovery from partial information via orthogonal matching pursuit
R. Maleh, A. C. Gilbert, and M. J. Strauss · 2007
Closest in time.