Nearly optimal sparse fourier transform

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 563-577

  Hassanieh, Haitham ^a   Indyk, Piotr ^a   Katabi, Dina ^a   Price, Eric ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

compressive sensing; fourier sampling; sparse recovery

Indexed keywords

ADAPTIVE SAMPLING; COMPRESSIVE SENSING; FOURIER SAMPLING; INPUT SIGNAL; NON-ZERO FOURIER COEFFICIENTS; RANDOMIZED ALGORITHMS; SIGNAL SAMPLES; SPARSE RECOVERY;

COMPUTATION THEORY; DISCRETE FOURIER TRANSFORMS; OPTIMIZATION;

ALGORITHMS;

EID: 84862603779     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214029     Document Type: Conference Paper

References (26)

1. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. Int. Conf. on Foundations of Data Organization and Algorithms, pages 69-84, 1993.
2. A. Akavia, S. Goldwasser, and S. Safra. Proving hard-core predicates using list decoding. Annual Symposium on Foundations of Computer Science, 44:146-159, 2003.
3. A. Akavia. Deterministic sparse Fourier approximation via fooling arithmetic progressions. COLT, pages 381-393, 2010.
4. A. Chandrakasan, V. Gutnik, and T. Xanthopoulos. Data driven signal processing: An approach for energy efficient computing. International Symposium on Low Power Electronics and Design, 1996.
5. E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52:489-509, 2006. (Pubitemid 43174093)
6. Thomas Cover and Joy Thomas. Elements of Information Theory. Wiley Interscience, 1991.
7. D. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
8. I. Daubechies, O. Runborg, and J. Zou. A sparse spectral method for homogenization multiscale problems. Multiscale Model. Sim., 6(3):711-740, 2007.
9. A. Gilbert, S. Guha, P. Indyk, M. Muthukrishnan, and M. Strauss. Near-optimal sparse Fourier representations via sampling. STOC, 2002.
10. O. Goldreich and L. Levin. A hard-corepredicate for allone-way functions. STOC, pages 25-32, 1989.
11. Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss. Approximate sparse recovery: optimizing time and measurements. In STOC, pages 475-484, 2010.
12. A. Gilbert, M. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal space Fourier representations. SPIE Conference, Wavelets, 2005.
13. A.C. Gilbert, M.J. Strauss, and J. A. Tropp. A tutorial on fast Fourier sampling. Signal Processing Magazine, 2008.
14. H. Hassanieh, P. Indyk, D. Katabi, and E. Price. sFFT: Sparse Fast Fourier Transform. http://groups.csail.mit.edu/netmit/sFFT/, 2012.
15. H. Hassanieh, P. Indyk, D. Katabi, and E. Price. Simple and practical algorithm for sparse Fourier transform. SODA, 2012.
16. Juha Heiskala and John Terry, Ph.D. OFDM Wireless LANs: A Theoretical and Practical Guide. Sams, Indianapolis, IN, USA, 2001.
17. P. Indyk, E. Price, and D. P. Woodruff. On the power of adaptivity in sparse recovery. FOCS, 2011.
18. M. A. Iwen. Combinatorial sublinear-time Fourier algorithms. Foundations of Computational Mathematics, 10:303-338, 2010.
19. J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. FOCS, 1988.
20. E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. STOC, 1991.
21. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the ACM (JACM), 1993.
22. Mengda Lin, A. P. Vinod, and Chong Meng Samson See. A new flexible filter bank for low complexity spectrum sensing in cognitive radios. Journal of Signal Processing Systems, 62(2):205-215, 2011.
23. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. ICALP, 1992.
24. G. Marsaglia. Evaluating the normal distribution. Journal of Statistical Software, 11(4):1-7, 2004.
25. A. Mueen, S. Nath, and J. Liu. Fast approximate correlation for massive time-series data. In Proceedings of the 2010 international conference on Management of data, pages 171-182. ACM, 2010.
26. R. O'Donnell. Some topics in analysis of boolean functions (tutorial). STOC, 2008. [PW11] E. Price and D. P. Woodruff. (1 + ε)-approximate sparse recovery. FOCS, 2011.