Sparse fast Fourier transform on GPUs and multi-core CPUs

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn , Issue , 2012, Pages 83-91

  Hu, Jiaxi ^a   Wang, Zhaosen ^a   Qiu, Qiyuan ^a   Xiao, Weijun ^b   Lilja, David J ^a  

^a University of Minnesota   (United States)

^b VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

Author keywords

GPUs; Multi core CPUs; performance speedup; Sparse FFT

Indexed keywords

FREQUENCY DOMAINS; GPUS; HUMAN VOICE; MULTI CORE; OPTIMIZATION STRATEGY; PARALLEL IMPLEMENTATIONS; PERFORMANCE SPEEDUP; SINGLE-THREADED;

COMPUTER ARCHITECTURE; FAST FOURIER TRANSFORMS;

PROGRAM PROCESSORS;

EID: 84871653163     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBAC-PAD.2012.34     Document Type: Conference Paper

References (18)

1. Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price: Simple and Practical Algorithm for Sparse Fourier Transform. SODA 1183-1194,2012.
2. Liang Gu, Jakob Siegel and Xiaoming Li: Using GPUs to Compute Large Out-of-card FFTs, ICS, pages 225-264, 2011.
3. Chandrakasan, V. Gutnik, and T. Xanthopoulos. Data driven signal processing: An approach for energy efficient computing. International Symposium on Low Power Electronics and Design, ISLPED, pages 347-352,1996.
4. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. Lecture Notes in Computer Science, 623: 261-272, 1992.
5. M. A. Iwen. Combinatorial sublinear-time fourier algorithms. Foundations of Computational Mathematics, 10:303-338,2010.
6. J. Barhen, C. Kotas, T. S. Humble, P. Mitra, N. Imam, M.A. Buckner and M. R. Moore: High Performance FFT on Multi-core Processors. CROWNCOM, pages: 1-6, 2010.
7. NVIDIA (2007b). CUFFT Library. Technical report, NVIDIA.
8. NVIDIA (2010). Cuda community showcase. Technical report, NVIDIA.
9. E.Porat and M.Strauss: Sublinear time, measure-optimal sparse recovery for all. SODA, pages: 1215-1227, 2012.
10. Matteo Frigo and Steven G.Johnson: FFTW: AN ADAPTIVE SOFTWARE ARCHITECTURE FOR THE FFT. Acoustics, Speech and Signal Processing, 3: 1381-1384, 1998.
11. "MKL FFT performance- comparison of local and distributed-memory implementations", http://software.intel.com/en-us/articles/mkl-fft- performance-using-local-and-distributed-implementation/
12. "2.4 GHz Pentium 4, Intel compilers", http://www.fftw.org/ speed/Pentium4-2.4GHz-icc/
13. "Developer Zone cuFFT", http://developer.nvidia.com/cufft
14. Paul Dourish, Annette Adler, Victoria Bellotti and Austin Henderson: Your place or mine? learning from long-term use of audio-video communication. Computer Supported Cooperative Work, 5(1): 33-62, 1996.
15. Leonardo Dagum and Ramesh Menon: OpenMP: An Industry-Standard API for Shared-Memory Programming. Computational Science & Engineering, IEEE, 5(1):46-55, 1998.
16. Richard H. Carver and Kuo-Chung Tai: Implementing, Testing, And Debugging Multithreaded Java And C++/Pthreads/Win32 Programs, John Wiley & Sons ,2006.
17. Peter S Pacheco :An Introduction to Parallel Programming, Ed 1st, 2011.
18. Haitham Hassanieh, PiotrIndyk, Dina Katabi, and Eric Price: Sparse Fast Fourier Transform Code Documentation (sFFT 1.0-2.0).