期刊文献+

基于FPGA的实时PFFT处理器的高效实现

Efficient Implementation of Real-Time PFFT Processor Based on FPGA
下载PDF
导出
摘要 提出了一种在现场可编程门陈列(FPGA)器件上高效计算实时离散傅里叶变换(DFT)的处理器.该处理器采用实时质因子傅里叶变换(PFFT)算法实现,应用级联流水架构来获得实时处理能力;利用基于查找表(LUT)的分布式算法来获得与FPGA器件基本逻辑单元适配的特性;利用质数点DFT的循环卷积特性来显著降低LUT的规模.根据该方法,设计了一个16位、1 105点的实时PFFT处理器,并在Xilinx Virtex5FPGA平台上进行了实现验证.结果表明,该处理器达到了比现有1 024点快速傅里叶变换(FFT)更少的资源占用和更高的资源利用效率. A novel efficient processor for computing the real-time discrete Fourier transform (DFT) on pro grammable field programmable gates array (FPGA) devices was presented. Prime factor Fourier transform (PFFT) algorithm was implemented in the proposed processor. Pipelined architecture was applied to main tain the real-time performance of the processor. Distributed arithmetic based on Look-up-table (LUT) was exploited to adapt to the basic logic cell of the FPGA. Cyclic convolution feature of the prime length DFT was used to significantly reduce the scale of LUTs. Based on the proposed method, a real-time 1 105-point processor with 16 bits precision was designed and implemented on Xilinx Virtex5 FPGA platform. Com- pared with existing real-time 1 024-point processors, the proposed processor consumes fewer resources while obtaining more efficient utilization of the resources.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2012年第11期1811-1815,共5页 Journal of Shanghai Jiaotong University
基金 国家重点基础研究发展规划(973)项目(2009CB824900)
关键词 质因子傅里叶变换 快速傅里叶变换 现场可编程门陈列 分布式算法 级联流水结构 prime factor Fourier transform (PFFT) ~ fast Fourier transform (FFT) field programmablegates array (FPGA) distributed arithmetic~ pipelined architecture
  • 相关文献

参考文献9

  • 1Blair G M. A review of the discrete Fourier transform. Part 2. Non-radix algorithms, real transforms and noise[J]. Electronics & Communication Engineering Journal, 1995,7(5):187-194.
  • 2Al Ghouwayel A, Louet Y. FPGA implementation of a re-configurable FFT for multi-standard systems in software radio context [J]. IEEE Trans Consumer Electronics, 2009, 55(2): 950-958.
  • 3Sung T Y, Hsin H C, Cheng Y P. Low-power and high-speed CORDIC-based split-radix FFT processor for OFDM systems [J]. Digital Signal Processing, 2010, 20(2): 511-527.
  • 4Leng J N, Xie L, Chen H F, et al. A novel 3 780-point FFT processor scheme for the time domain synchronous OFDM system [J]. Journal of Zhejiang University: Science C, 2010, 12(12): 1021-1030.
  • 5Jiang M, Yang B, Huang R, et al. Multiplierless fast fourier transform architecture [J]. Electronics Letters, 2007, 43(3): 191-192.
  • 6Jiang M. An area-efficient FFT architecture for OFDM digital video broadcasting [J].IEEE Trans Consumer Electronics, 2007, 53(4): 1322-1326.
  • 7Kim D S, Lee S S, Song J Y, et al. Design of a mixed prime factor FFT for portable digital radio mondiale receiver [J]. IEEE Trans Consumer Electronics, 2008, 54(4): 1590-1594.
  • 8Chow P, Vranesic Z G, Yen J L. A pipelined distributed arithmetic PFFT processor [J]. IEEE Trans Computers, 1983, 32(12):1128-1136.
  • 9Xilinx. Fast Fourier transform v6.0 product specifica tion [EB/OL]. E2012-01-11]. http://www, xilinx. com/ support/documentation/ip_ documentation/xfft_ ds260, pdf.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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