High-Throughput Implementation of a Million-Point Sparse Fourier Transform Abhinav Agarwal, Haitham Hassanieh, Omid Abari, Ezz Hamed, Dina Katabi - Dina - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-10-06 15:29:06 Numerical analysis Fast Fourier transform Discrete Fourier transform Parallel computing Throughput Finite impulse response Discrete cosine transform Mathematical analysis Digital signal processing Fourier analysis		High-Throughput Implementation of a Million-Point Sparse Fourier Transform Abhinav Agarwal, Haitham Hassanieh, Omid Abari, Ezz Hamed, Dina Katabi & Arvind Computer Science & Artificial Intelligence Laboratory, Massachuse Add to Reading List Source URL: groups.csail.mit.edu Download Document from Source Website File Size: 450,17 KB Share Document on Facebook

	The Journal of Fourier Analysis and Applications Moments of the Rudin-Shapiro Polynomials Christophe Doche, and Laurent Habsieger Communicated by Hans G. Feichtinger DocID: 1vewr - View Document
	IEEE TRANSACTIONS ON INFORMATION D. Slepian, “Prolate spheroidal wave functions, Fourier analysis and uncertainty-IV: Extension to many dimensions; Generalized prolate spheroidal functions,” Bell Syst. Tech. J., vol DocID: 1v1ML - View Document
	FOURIER ANALYSIS AND RELATED TOPICS BANACH CENTER PUBLICATIONS, VOLUME 56 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 2002 DocID: 1uBqy - View Document
	Microsoft Word - Fourier analysis of the P53-MDM2 system - revised.doc DocID: 1ul1Q - View Document
	Uncertainty Principles for Fourier Multipliers Michael Northington, Georgia Institute of Technology Many questions in time-frequency analysis can be reduced to properties of a sequence of complex exponentials in certain DocID: 1u9xH - View Document