期刊文献+

一种高速定点FFT处理器的设计与实现 被引量:9

Design and Implementation of High Speed and Fixed-point FFT Processor
下载PDF
导出
摘要 提出了一种高速定点FFT处理器的设计方法,此方法在CORDIC算法的基础上,通过优化操作数地址映射方法和旋转因子生成方法,每周期完成一个基4蝶形运算,具有最大的并行性。同时按照本文提出的因子生成方法,每个周期可生成3个旋转因子,且硬件实现简单,无须额外的ROM资源。整个系统采用Xilinx公司的XCV2P30仿真,系统频率达到了130MHz,对于1k点16位的复数FFT需要9.8μs,16k点需要221μs,优于目前绝大多数已有的FFT处理器。 The paper presents the design method of a high speed and fixed-point FFT processor. By optimizing the memory mapping algorithm and the generation of twiddle factors, the method based on CORDIC algorithm can calculate a radix-4 butterfly in one clock cycle and has the maximal degree of parallelism. This paper also introduces a method of twiddle factor generation, which can simultaneously generate three twiddles of one radix-4 butterfly. The implementation of the twiddle factor generation in hardware is simple and don't need extra ROM resources. The processor has been implemented on a Xilinx chip XCV2P30 and obtains the operating clock frequency at 130 MHz. The processor can compute a complex 1024-point FFT with 9.8 μs and 16384-point FFT with 221 μs. The performance of the FFT processor is better than most available FFT processors.
出处 《计算机工程》 EI CAS CSCD 北大核心 2005年第11期52-55,共4页 Computer Engineering
基金 国家自然科学基金资助项目(60303017) 计算所青年基金资助项目(20026180-13) 科技部国际合作重点项目(2001AA111090)
关键词 快速傅立叶变换 FFT处理器 CORDIC算法 FFT FFT Processor CORDIC algorithm
  • 相关文献

参考文献7

  • 1.[EB/OL].http://www-star.stanford.edu/-bbaas/fftinfo.html.,.
  • 2Johnson L G.Conflict Free Memory Addressing for Dedicated FFT Hardware.IEEE Trans.Circuits and Sys.II,1992,39: 312-316.
  • 3Cheng-han Sung,Lee Kunbin,Jen Cheinwei.Design and Implementation of A Scalable Fast Fourier Transform Core.ASIA-PACIFIC CONFERENCE ON ASICs,2002: 295-298.
  • 4Andrake R J.A Survey of CORDIC Algorithms for FPGA Based Computers.FPGA '98.Proceedings of the 1998 ACM/SIGDA Sixth International Symposium on Field Programmable Gate Arrays,Monterey,CA,1998-02-22:191-200.
  • 5谢应科,付博.数据全并行FFT处理器的设计[J].计算机研究与发展,2004,41(6):1022-1029. 被引量:7
  • 6Xilinx.http://www.xilinx.com/ipcenter/catalog/logicore/docs/vfft 1024v2.pdf.
  • 7Altera.FFT MegaCore Function User Guide (Version 1.02).2001-03.

二级参考文献14

  • 1马余泰.FFT处理器无冲突地址生成方法[J].计算机学报,1995,18(11):875-880. 被引量:10
  • 2E Bidet, D Castelain, C Joanblanq, et al. A fast single-chip implementation of 8192 complex point FFT. IEEE Journal of Solid-State Circuits, 1995, 30(3): 300~305
  • 3Bevan M Baas. A low-power, high-performace, 1024-point FFT processor. IEEE Journal of Solid-State Circuits, 1999, 34 (3):380~ 387
  • 4J W Cooley, J W Tukey. An algorithm for the machine calculation of complex Fourier-series. Math Computer, 1965, 19:297~301
  • 5G L DeMuth. Algorithms for defining mixed radix FFT flow graphs. IEEE Trans on Acoustics, Speech and Signal Processing,1989, 37(9): 1349~1358
  • 6D Cohen. Simplified control of FFT hardware. IEEE Trans on Acoustics, Speech, Signal Processing, 1976, 24(12): 577~579
  • 7Marshall C Pease. Organization of large scale Fourier processors. J ACM, 1969, 16(3): 474~482
  • 8Bhabani P Sinha, Jayasree Dattagupta, Asish Sen. A cost effective FFT processor using memory segmentation. IEEE 1983 ISCAS,Newport Beach, CA, 1983
  • 9Yutai Ma. An effective memory addressing scheme for FFT processors. IEEE Trans on Signal Processing, 1999, 47(3): 907~911
  • 10Xie Yingke, Hou Zifeng, Han Chengde. A parallel conflict-free memory accessing for FFT algorithm. In: Proc of the 3rd Workshop on Advanced Parallel Processing Technologies. Beijing:Publishing House of Electronics Industry, 1999. 137~141

共引文献6

同被引文献64

引证文献9

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部