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

FPGA实现高速加窗复数FFT处理器的研究
引用本文:韩颖,王旭,吴嗣亮.FPGA实现高速加窗复数FFT处理器的研究[J].北京理工大学学报,2003,23(3):381-385.
作者姓名:韩颖  王旭  吴嗣亮
作者单位:北京理工大学,信息科学技术学院电子工程系,北京,100081
摘    要:研究采用FPGA设计高速专用FFT处理器的实现方法,使处理器能对复数数据顺序进行加窗、FFT及模平方运算.本设计具有4个特点:设计实现了只用一个运算单元进行以上3种运算的方案,有效地节省了逻辑资源;采用流水方式提高了系统的处理速度,使通信、计算、存储等操作协调一致;采用块浮点算法使系统兼有定点运算速度高与浮点运算精度高的特点;采用TMS存储模式,降低了对外围电路的速度要求.该设计方法可以广泛应用于高速数字信号处理领域.

关 键 词:快速傅里叶变换  蝶形单元  加窗运算  模平方运算
文章编号:1001-0645(2003)03-0381-05
收稿时间:9/9/2002 12:00:00 AM
修稿时间:2002年9月9日

The Study of High-Speed Windowed Complex FFT Processors Based on FPGA
HAN Ying,WANG Xu and WU Si liang.The Study of High-Speed Windowed Complex FFT Processors Based on FPGA[J].Journal of Beijing Institute of Technology(Natural Science Edition),2003,23(3):381-385.
Authors:HAN Ying  WANG Xu and WU Si liang
Institution:Department of Electronic Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Electronic Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Electronic Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China
Abstract:A method of realizing high speed special FFT processor based on FPGA is presented. The processor can put the complex data into three operations in sequence: multiplying the window, performing FFT, and computing module square. Experiments prove that the design posseses four specialties. To save logic and hardware resources, the above three operations are performed by a single operation unit. As a result of adopting pipelined architecture, the processing speed is improved and the three operations including communication, calculation and storage work harmoniously. By using the block floating point algorithm, the system has the merit of high speed and high precision. TMS memory architecture requires less speed to the peripheral equipment. The design method can widely be used in high speed digital signal processing fields.
Keywords:fast Fourier transform  butterfly-unit  multiplying window  computing module-square
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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