Recent developments in the sparse fourier transform: A compressed fourier transform for big data

IEEE Signal Processing Magazine

Volumn 31, Issue 5, 2014, Pages 91-100

  Gilbert, Anna C ^a   Indyk, Piotr ^b   Iwen, Mark ^a   Schmidt, Ludwig ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FOURIER TRANSFORMS; FAST FOURIER TRANSFORMS; SIGNAL PROCESSING;

BIG DATA APPLICATIONS; COMPRESSIVE SENSING; COMPUTATIONAL TECHNIQUE; DATA PROBLEMS; DATA SETTINGS; EMPIRICAL PERFORMANCE; FUNDAMENTAL COMPONENT; STREAMING ALGORITHM;

BIG DATA;

EID: 85032751695     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2014.2329131     Document Type: Article

References (29)

1. A. Akavia, S. Goldwasser, and S. Safra, "Proving hard-core predicates using list decoding," in Proc. Annu. IEEE Symp. Foundations of Computer Science, vol. 44, pp. 146-159, 2003.
2. O. Abari, E. Hamed, H. Hassanieh, A. Agarwal, D. Katabi, A. P. Chandrakasan, and V. Stojanovic, "A 0.75-million-point Fourier-transform chip for frequencysparse signals," in IEEE Int. Solid-State Circuits Conf. Dig. Technical Papers (ISSCC), 2014.
3. A. Akavia, "Deterministic sparse Fourier approximation via fooling arithmetic progressions," in Proc. 23rd Conf. Learning Theory (COLT), 2010, pp. 381-393.
4. P. Boufounos, V. Cevher, A. C. Gilbert, Y. Li, and M. J. Strauss, "What's the frequency, Kenneth? Sublinear Fourier sampling off the grid," in Proc. RANDOM/APPROX, 2012.
5. A. Gilbert, S. Guha, P. Indyk, M. Muthukrishnan, and M. Strauss, "Near-optimal sparse Fourier representations via sampling," in Proc. 34th Annu. Symp. Theory of Computing (STOC), 2002.
6. B. Ghazi, H. Hassanieh, P. Indyk, D. Katabi, E. Price, and L. Shi, "Sample-optimal average-case sparse Fourier transform in two dimensions," in Proc. Allerton, 2013.
7. O. Goldreich and L. Levin, "A hard-core predicate for all one-way functions," in Proc. 21st Annu. Symp. Theory of Computing (STOC), 1989, pp. 25-32.
8. A. Gilbert, M. Muthukrishnan, and M. Strauss, "Improved time bounds for near-optimal space Fourier representations," in Proc. SPIE Conf. Wavelets, 2005.
9. A. C. Gilbert, M. J. Strauss, and J. A. Tropp, "A tutorial on fast Fourier sampling," IEEE Signal Processing Mag., 2008.
10. H. Hassanieh, F. Adib, D. Katabi, and P. Indyk, "Faster GPS via the sparse Fourier transform," in Proc. 18th Annu. Int. Conf. Mobile Networking and Computing (MOBICOM), 2012.
11. H. Hassanieh, P. Indyk, D. Katabi, and E. Price, "Near-optimal algorithm for sparse Fourier transform," in Proc. 44th Annu. ACM Symp. Theory of Computing (STOC), 2012.
12. H. Hassanieh, P. Indyk, D. Katabi, and E. Price, "Simple and practical algorithm for sparse Fourier transform," in Proc. 23rd Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2012.
13. S. Heider, S. Kunis, D. Potts, and M. Veit, "A sparse Prony FFT," in Proc. 10th Int. Conf. Sampling Theory and Applications (SAMPTA), 2013.
14. H. Hassanieh, L. Shi, O. Abari, E. Hamed, and D. Katabi, "Ghz-wide sensing and decoding using the sparse Fourier transform," in Proc. IEEE Conf. Computer Communications (INFOCOM), 2014.
15. P. Indyk, M. Kapralov, and E. Price, "(Nearly) sample-optimal sparse Fourier transform," in Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2014.
16. P. Indyk, "Sketching via hashing: From heavy hitters to compressed sensing to sparse Fourier transform," in Proc. 32nd Symp. Principles of Database Systems (PODS), 2013, pp. 87-90.
17. M. A. Iwen, "Combinatorial sublinear-time Fourier algorithms," Found. Computat. Math., vol. 10, pp. 303-338, 2010.
18. M. A. Iwen, "Improved approximation guarantees for sublinear-time Fourier algorithms," Appl. Computat. Harm. Anal., vol. 34, pp. 57-82, 2013.
19. E. Kushilevitz and Y. Mansour, "Learning decision trees using the Fourier spectrum," in Proc. 23rd Annu. Symp. Theory of Computing (STOC), 1991.
20. L. A. Levin, "Randomness and non-determinism," J. Symb. Logic, vol. 58, no. 3, pp. 1102-1103, 1993.
21. D. Lawlor, Y. Wang, and A. Christlieb, "Adaptive sub-linear time Fourier algorithms," Adv. Adapt. Data Anal., vol. 5, no. 1, 2013.
22. Y. Mansour, "Randomized interpolation and approximation of sparse polynomials," in Proc. 19th Int. Colloq. Automata, Languages and Programming (ICALP), 1992.
23. S. Pawar and K. Ramchandran, "Computing a k-sparse n-length discrete Fourier transform using at most 4k samples and O(k log k) complexity," in Proc. IEEE Int. Symp. Information Theory (ISIT), 2013.
24. L. Shi, O. Andronesi, H. Hassanieh, B. Ghazi, D. Katabi, and E. Adalsteinsson, "Mrs sparse-fft: Reducing acquisition time and artifacts for in vivo 2D correlation spectroscopy," in Proc. Int. Society for Magnetic Resonance in Medicine Annu. Meeting & Exhibition (ISMRM), 2013.
25. J. Schumacher, "High performance sparse fast Fourier transform," Master's thesis, Computer Science, ETH Zurich, Switzerland, 2013.
26. R. Scheibler, S. Haghighatshoar, and M. Vetterli, "A sparse sub-linear Hadamard transform," in Proc. Allerton, 2013.
27. C. Wang, M. Araya-Polo, S. Chandrasekaran, A. St-Cyr, B. Chapman, and D. Hohl, "Parallel sparse FFT," in Proc. SC Workshop on Irregular Applications: Architectures and Algorithms, 2013.
28. P. Yenduri and A. C. Gilbert, "Compressive, collaborative spectrum sensing for wideband cognitive radios," in Proc. Int. Symp. Wireless Communication Systems (ISWCS), 2012, pp. 531-535.
29. P. K. Yenduri, A. Z. Rocca, A. S. Rao, S. Naraghi, M. P. Flynn, and A. C. Gilbert, "A low-power compressive sampling time-based analog-to-digital converter," IEEE J. Emerg. Select. Topics Circuits Syst., vol. 2, no. 3, pp. 502-515, 2012.