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

用FPGA实现FFT的研究
引用本文:刘朝晖 韩月秋. 用FPGA实现FFT的研究[J]. 北京理工大学学报, 1999, 19(2): 234-238
作者姓名:刘朝晖 韩月秋
作者单位:北京理工大学电子工程系,北京,100081
摘    要:目的 针对高速数字信号处理的要求,给出了用现场可编程门阵列(FPGA)实现的快速傅里叶变换(FFT)方案。方法 算法为按时间抽取的基4算法,采用递归结构的块浮点运算方案,蝶算过程只扩展两个符号位以适应雷达信号处理的特点,乘法器由阵列乘法器实现。

关 键 词:离散傅里叶变换  快速傅里叶变换  块浮点运算  可编程门阵列
修稿时间:19980410

Implementation of FFT with FPGA Technology
Liu Zhaohui Han Yueqiu. Implementation of FFT with FPGA Technology[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 1999, 19(2): 234-238
Authors:Liu Zhaohui Han Yueqiu
Abstract:Aim To propose a scheme for implementing FFT with FPGA in accor dance with the requirement for high speed digital signal processing. Methods The structure of FPGA and requirement of system were considered in the experiment, radix 4 algorithm of DIT and recursive structure were adopted. The group float point arithmetic operation was used in the butterfly and the array multiplier was used to realize multiplication. Results The pipeline pattern was used to ensure the system speed, it made fetching data, calculating twiddle factor, complex multiplication and DFT operation coordinate. The balance of calculation, communication and storage was realized and the bottleneck was avoided. Conclusion It demonstrates that it is a feasible method to use FPGA to realize algorithm in the high speed DSP.
Keywords:discrete Fourier transform  fast Fourier transform  block float point arithmetic  programmable gate arrays
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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