高速并行FFT的FPGA实现  

Implementation of Fast Parallel FFT by FPGA

作　　者：吴争[1] 李辉[1] 

机构地区：[1]中国电子科技集团公司第五十四研究所,河北石家庄050081

出　　处：《无线电工程》2013年第10期16-18,共3页Radio Engineering

摘　　要：简要介绍了FFT的分类,对比了其结构特点及实现复杂度,结合项目实现的需求,从中选择了一种适合FPGA高速并行实现的算法。在此基础上,推导了20点FFT的实现方式,并且根据实际需求,可以采用此方法设计多种非基2FFT实现,甚至通过级联可完成大点数FFT的设计实现,具有模块化、灵活可变的特点。结合MATLAB仿真对FPGA实现结果进行了对比分析,并以图形化方式显示了对比结果,说明了方法可行、有效。This paper briefly describes the categories of FFT and compares their structures and complexities. Combining with the project implementation requirements, this paper chooses an algorithm suitable for high-speed parallel FPGA implementation. The 20- point FFT implementation is derived based on this analysis. Non-radix-2 FFTs can be implemented for different requirements with this method. Even large point FFT can be implemented by cascading of two or more DFTs. This method has characteristics of modularization and flexibility. At last,with the MATLAB simulation,the FPGA implementation results are analyzed,and graphical results illustrates the feasibility and effectiveness of this approach.

关 键 词：FFT FPGA MATLAB 

分 类 号：TN911[电子电信—通信与信息系统]