快速傅里叶变换的FPGA实现

Implementation of Fast Flourier Transform based on FPGA

在分析快速傅立叶变换(FFT)算法的基础上,为了提高FFT的处理速度,本文采用移位寄存器存储旋转因子的方法,并在Altera公司的CycloneII系列的FPGA(可编程门阵列)芯片上进行了验证,与一般用ROM存储旋转因子方法相比,减少了存储时间,提高了速度,更好的满足了FFT运算的需要。

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.