首页 | 本学科首页   官方微博 | 高级检索  
     

基于FPGA的1024点快速傅里叶处理器设计
引用本文:朱立忠.基于FPGA的1024点快速傅里叶处理器设计[J].沈阳理工大学学报,2010,29(2):61-64.
作者姓名:朱立忠
作者单位:沈阳理工大学信息科学与工程学院,辽宁,沈阳,110159
基金项目:沈阳市科技局攻关项目 
摘    要:在对基-2FFT算法原理进行初步分析的基础上,设计了一种1 024点FFT处理器,在基于Xilinx公司的FPGA芯片的基础上,进行了控制单元、数据存储单元、选择因子生成单元和蝶形运算单元的设计.采用verilog HDL语言编程,在ISE平台上编译,利用modelsim软件进行仿真测试.测试结果表明该1 024点FFT处理器在时钟频率为100MHz情况下,处理时间为51.9μs,对于基-2处理器结构,已达到较高的运算速度.

关 键 词:FPGA  基-2  FFT  DIF

1024 Points Fast Foutier Transform Based on FPGA
ZHU Li-zhong.1024 Points Fast Foutier Transform Based on FPGA[J].Transactions of Shenyang Ligong University,2010,29(2):61-64.
Authors:ZHU Li-zhong
Affiliation:ZHU Li-zhong(Shenyang Ligong University,Shenyang 110159,China)
Abstract:The principle of the radix-2 FFT algorithm was analyzed,and a kind of 1 024 points radix-2 FFT processor was described.Based on the FPGA chips manufactured by Xilinx Company,control unit,data storage unit,select factor generation unit,and butterfly operation unit were designed.The program was written by verilog HDL language,and was compiled under ISE environment.The modelsim simulation software was used to run simulation for the designed system.The results indicated that processing time spent 51.9 μs for 1 024 points radix-2 FFT processor when clock frequency was 100MHz.This is a higher processing speed for radix-2 FFT processor structure.
Keywords:FPGA  FFT  DIF
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号