Combinatorial sublinear-time Fourier algorithms

Foundations of Computational Mathematics

Volumn 10, Issue 3, 2010, Pages 303-338

  Iwen, M A ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Approximation algorithms; Discrete and fast Fourier transforms; Trigonometric approximation and interpolation

Indexed keywords

DISCRETE ALGORITHMS; DISCRETE AND FAST FOURIER TRANSFORMS; FOURIER ALGORITHMS; FOURIER METHODS; FOURIER TRANSFORM ALGORITHMS; PROBABILITY OF FAILURE; SUBLINEAR-TIME ALGORITHMS; TRIGONOMETRIC APPROXIMATION AND INTERPOLATIONS;

APPROXIMATION ALGORITHMS; FAST FOURIER TRANSFORMS;

MONTE CARLO METHODS;

EID: 77953326287     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-009-9057-1     Document Type: Article

References (50)

1. C. Anderson, M. D. Dahleh, Rapid computation of the discrete Fourier transform, SIAM J. Sci. Comput. 17, 913-919 (1996).
2. L. I. Bluestein, A linear filtering approach to the computation of discrete Fourier transform, IEEE Trans. Audio Electroacoust. 18, 451-455 (1970).
3. J. P. Boyd, Chebyshev and Fourier Spectral Methods (Dover, New York, 2001).
4. E. Candes, J. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inf. Theory52, 489-509 (2006).
5. E. Candes, J. Romberg, T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Commun. Pure Appl. Math. 59(8), 1207-1223 (2006).
6. B. Chazelle, The Discrepancy Method: Randomness and Complexity (Brooks/Cole Publishing Company, 1992).
7. A. Cohen, W. Dahmen, R. DeVore, Compressed sensing and best k-term approximation, J. Am. Math. Soc. 22(1), 211-231 (2008).
8. J. Cooley, J. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comput. 19, 297-301 (1965).
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms (MIT Press/McGraw-Hill, Cambridge/New York, 1990).
10. G. Cormode, S. Muthukrishnan, Combinatorial algorithms for compressed sensing. Technical Report DIMACS TR 2005-40 (2005).
11. G. Cormode, S. Muthukrishnan, Combinatorial algorithms for compressed sensing, in Conference on Information Sciences and Systems, March 2006.
12. I. Daubechies, O. Runborg, J. Zou, A sparse spectral method for homogenization multiscale problems, Multiscale Model. Simul. (2007).
13. R. A. DeVore, Deterministic constructions of compressed sensing matrices, J. Complex. 23 (August 2007).
14. D. Donoho, Compressed sensing, IEEE Trans. Inf. Theory52, 1289-1306 (2006).
15. 1 minimization, in 40th Annual Conference on Information Sciences and Systems (CISS), 2006.
16. D. Z. Du, F. K. Hwang, Combinatorial Group Testing and Its Applications (World Scientific, Singapore, 1993).
17. A. Dutt, V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput. 14, 1368-1383 (1993).
18. D. Eppstein, M. T. Goodrich, D. S. Hirschberg, Improved combinatorial group testing algorithms for real-world problem sizes. http://arxiv.org/abs/cs.DS/0505048, May 2005.
19. J. A. Fessler, B. P. Sutton, Nonuniform fast Fourier transforms using min-max interpolation, IEEE Trans. Signal Proc. 51, 560-574 (2003).
20. G. B. Folland, Fourier Analysis and Its Applications (Brooks/Cole Publishing Company, 1992).
21. M. Frigo, S. Johnson, The design and implementation of fftw3, Proc. IEEE93(2), 216-231 (2005).
22. A. Gilbert, M. Strauss, Group testing in statistical signal recovery. Preprint (2006).
23. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss, Near-optimal sparse Fourier estimation via sampling, in ACM STOC, pp. 152-161, 2002.
24. A. Gilbert, S. Muthukrishnan, M. Strauss, Improved time bounds for near-optimal sparse Fourier representations, in Proceedings of SPIE Wavelets XI, 2005.
25. 1 norm for sparse vectors. Preprint (2006).
26. P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in SODA '02: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 697-704, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.
27. P. Indyk, Explicit constructions for compressed sensing of sparse signals, in Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008.
28. M. A. Iwen, A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods, in Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008.
29. M. A. Iwen, C. V. Spencer, Improved bounds for a deterministic sublinear-time sparse Fourier algorithm, in Conference on Information Sciences and Systems (CISS), 2008.
30. M. A. Iwen, A. C. Gilbert, M. J. Strauss, Empirical evaluation of a sub-linear time sparse DFT algorithm, Commun. Math. Sci. 5(4) (2007).
31. L. Y. E. Kaltofen, Improved sparse multivariate polynomial interpolation algorithms, in International Symposium on Symbolic and Algebraic Computation, 1988.
32. D. Kincaid, W. Cheney, Numerical Analysis: Mathematics of Scientific Computing (China Machine Press, 2003).
33. S. Kirolos, J. Laska, M. Wakin, M. Duarte, D. Baron, T. Ragheb, Y. Massoud, R. Baraniuk, Analog-to-information conversion via random demodulation, in Proc. IEEE Dallas Circuits and Systems Conference, 2006.
34. S. Kunis, H. Rauhut, Random sampling of sparse trigonometric polynomials II-orthogonal matching pursuit versus basis pursuit. Found. Comput. Math. 8(6), 737-763 (2008).
35. J. Laska, S. Kirolos, Y. Massoud, R. Baraniuk, A. Gilbert, M. Iwen, M. Strauss, Random sampling for analog-to-information conversion of wideband signals, in Proc. IEEE Dallas Circuits and Systems Conference, 2006.
36. J.-Y. Lee, L. Greengard, The type 3 nonuniform FFT and its applications, J. Comput. Phys. 206, 1-5 (2005).
37. M. Lustig, D. Donoho, J. Pauly, Sparse MRI: The application of compressed sensing for rapid MR imaging, Magn. Reson. Med. 58(6), 1182-1195 (2007).
38. R. Maleh, A. C. Gilbert, M. J. Strauss, Signal recovery from partial information via orthogonal matching pursuit, in IEEE Int. Conf. on Image Processing, 2007.
39. S. Mallet, A Wavelet Tour of Signal Processing (China Machine Press, 2003).
40. Y. Mansour, Learning boolean functions via the Fourier transform, Theor. Adv. Neural Comput. Learn. 391-424 (1994).
41. Y. Mansour, Randomized approximation and interpolation of sparse polynomials, SIAM J. Comput. 24, 2 (1995).
42. R. Motwani, P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, 1995).
43. S. Muthukrishnan, Data streams: algorithms and applications, Found. Trends Theor. Comput. Sci. 1 (2005).
44. S. Muthukrishnan, Some algorithmic problems and results in compressed sensing, in Allerton Conference, 2006.
45. D. Needell, R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Found. Comput. Math. 9, 317-334 (2009).
46. I. Niven, H. S. Zuckerman, H. L. Montgomery, An Introduction to the Theory of Numbers (Wiley, New York, 1991).
47. L. Rabiner, R. Schafer, C. Rader, The chirp z-transform algorithm, IEEE Trans. Audio Electroacoust. AU-17(2), 86-92 (1969).
48. M. Rudelson, R. Vershynin, Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements, in 40th Annual Conference on Information Sciences and Systems (CISS), 2006.
49. The Prime Pages, http://primes.utm.edu/.
50. J. Tropp, A. Gilbert, Signal recovery from partial information via orthogonal matching pursuit, IEEE Trans. Inf. Theory53(12), 4655-4666 (2007).