Implementation of Fast Flourier Transform based on FPGA
Liu Jia
Abstract
Liu Jia
Abstract
On the basis of analyzing the FFT algorithm, in order to increase the speed of FFT processing, this article adopts a method that uses the shift register to save the twiddle factor, and validate on Cyclone II series FPGA of Altera company, compare with the general method with ROM, reduce the storage time, enhance the speed, and meet the need of FFT processing data better.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
On the basis of analyzing the FFT algorithm, in order to increase the speed of FFT processing, this article adopts a method that uses the shift register to save the twiddle factor, and validate on Cyclone II series FPGA of Altera company, compare with the general method with ROM, reduce the storage time, enhance the speed, and meet the need of FFT processing data better.
Key concepts: Computer science, Fast Fourier transform, Field-programmable gate array, Twiddle factor, Factor (programming language), Parallel computing, Computer hardware, Embedded system