Title :
High-throughput implementation of a million-point sparse Fourier Transform
Author :
Agarwal, Abhishek ; Hassanieh, Haitham ; Abari, Omid ; Hamed, Ezz ; Katabi, Dina ; Arvind
Author_Institution :
Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA
Abstract :
The emergence of data-intensive problems in areas like computational biology, astronomy, medical imaging, etc. has emphasized the need for fast and efficient very large Fourier Transforms. Recent work has shown that we can compute million-point transforms efficiently provided the data is sparse in the frequency domain. Processing input samples at rates approaching 1 GHz would allow real-time processing in several such applications. In this paper, we present a high-throughput FPGA implementation that performs a million-point sparse Fourier Transform on frequency-sparse input data, generating the largest 500 frequency component locations and values every 1.16 milliseconds. This design can process streamed input data at 0.86 Giga samples per second, and does not make any assumptions of the distribution of the frequency components beyond sparsity.
Keywords :
Fourier transforms; field programmable gate arrays; frequency-domain analysis; real-time systems; astronomy; computational biology; data intensive problems; frequency domain; frequency-sparse input data; high-throughput FPGA implementation; high-throughput implementation; medical imaging; million-point sparse Fourier transform; real-time processing; Algorithm design and analysis; Computer architecture; Field programmable gate arrays; Fourier transforms; Indexes; Noise; Vectors;
Conference_Titel :
Field Programmable Logic and Applications (FPL), 2014 24th International Conference on
Conference_Location :
Munich
DOI :
10.1109/FPL.2014.6927450