快速傅里叶变换的FPGA实现

Implementation of fast fourier transform on FPGA

基于快速傅里叶变换(FFT)运算特点,提出了采用现场可编程门阵列(FPGA)实现高速实时FFT运算的设计方案.该方案技术上采用基4算法以及乒乓RAM的设计思路,较好地解决了溢出处理、双地址生成、整序和总体时序控制的问题,最终实现了在200μs时间内完成1024点的FFT运算,达到了高速实时运算的要求.

The characteristics of FFT calculation are analyzed and applied to the design of high-speed immediate FFT calculation with FPGA adopted. The problems of overflow, double address and control over sequencing are well solved by Radix-4 algorithm and Ping-pong RAM. 1 024-point FFT calculation is finally implemented in 200 μs, and the requirement of high-speed and real-time is fulfiled.