Improved time bounds for near-optimal sparse Fourier representations

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5914, Issue , 2005, Pages 1-15

  Gilbert, A C ^a   Muthukrishnan, S ^b   Strauss, M ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Fourier analysis; Randomized approximation algorithms; Sampling; Sparse analysis

Indexed keywords

FOURIER ANALYSIS; RANDOMIZED APPROXIMATION ALGORITHM; SPARSE ANALYSIS;

ALGORITHMS; APPROXIMATION THEORY; LINEAR SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; SAMPLING;

FOURIER TRANSFORMS;

EID: 30844452004     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.615931     Document Type: Conference Paper

References (15)

1. Y. Mansour, "Randomized interpolation and approximation of sparse polynomials," SIAM J. Computing 24(2), 1995.
2. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. J. Strauss, "Near optimal sparse fourier representation via sampling," in Proc. ACM STOC, 2002.
3. A. Akavia, S. Goldwasser, and S. Safra, "Proving hard-core predicates by list decoding," in P roc. IEEE FOCS, pp. 146-157, 2003.
4. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information." Submitted, 2004.
5. D. Gottlieb and S. Orszag, Numerical Analysis of Spectral Methods: Theory and Applications, no. 26 in CMBS-NSF Regional Conference Series in Applied Mathematics, SIAM, 1977.
6. G. Box, G. Jenkins, and G. Reinsel, Time Series Analysis: Forecasting and Control, Prentice Hall, 1994.
7. J. Goodman, Introduction to Fourier Optics, McGraw-Hill, 1996.
8. "FFTW." http://www.fftw.org.
9. J. Zou, 2003. Personal communication.
10. J. Zou, A. Gilbert, M. Strauss, and I. Daubechies, "Theoretical and experimental analysis of a randomized algorithm for sparse fourier transform analysis." Submitted, 2004.
11. A. Nieslony and G. Steidl, "Approximate factorizations of Fourier matrices with nonequispaced knots," Linear Algebra and its Applications 366, pp. 337-51, June 2003.
12. H. J. Weaver, Applications of Discrete and Continuous Fourier Analysis, Wiley, 1983.
13. A. Aho, J. Hopcroft, and J. Ullman, Design and analysis of algorithms, Addison-Wesley, 1972.
14. A. Dutt and V. Rokhlin, "Fast Fourier transforms for nonequispaced data," SIAM J. Sci. Comput. 14, pp. 1368-1393, 1993.
15. C. Anderson and M. D. Dahleh, "Rapid compuation of the discrete Fourier transform," SIAM J. Sci. Comput. 17, pp. 913-919, 1996.