| WFTA算法的FPGA设计与实现 |
| |
| 引用本文： | 魏鹏,孙磊,王华力.WFTA算法的FPGA设计与实现[J].通信技术,2011,44(4):167-169. |
| |
| 作者姓名： | 魏鹏 孙磊 王华力 |
| |
| 作者单位： | 1. 解放军理工大学通信工程学院研究生4队,江苏南京,210000
2. 解放军理工大学通信工程学院电子信息工程系,江苏南京,210000 |
| |
| 摘 要： | Winograd傅里叶变换算法（WFTA）利用旋转因子W的特性对其进行分解,能够把FFT运算中乘法次数降到最低,是一种高效且资源占用相对较少的FFT实现方法。以256点分解为两维16×16点的小数组WFTA进行运算为例介绍了大数组WFTA算法的FPGA设计与实现方案。仿真测试表明,所设计的256点FFT处理器,乘法器资源消耗仅为基-2FFT的1/2、基-4FFT的2/3,且在100 MHz主时钟频率下完成运算仅需5.8μs,满足FFT处理器的高速实时性要求。
|
| 关 键 词： | 快速傅里叶变换 Winograd傅里叶变换算法 流水线 |
Design and Implementation of WFTA based on FPGA |
| |
| WEI Peng,SUN Lei,WANG Hua-i.Design and Implementation of WFTA based on FPGA[J].Communications Technology,2011,44(4):167-169. |
| |
| Authors: | WEI Peng SUN Lei WANG Hua-i |
| |
| Affiliation: | WEI Penga,SUN Leib,WANG Hua-lic(a.Postgraduate Team 4,b.Postgraduate Team 2,c.Department of Electronic Information Engineering,ICE PLAUST,Nanjing Jiangsu 210007,China) |
| |
| Abstract: | Winograd Fourier Transform algorithm（WFTA）,reducing the multiplications with decomposition of the twiddle factors,is an efficient implementation of FFT processor.With 256 point FFT as an example,this paper gives the FPGA realization of large FFT.Simulation results indicate that the proposed FFT processor requires only half multiplications as compared to the radix-2 FFT and 2/3 multiplications to the radix-4 FFT.The processor could complete the computation of a FFT in 5.8μs with 100MHz work frequency,and satisfy the requirement of high-speed,real-time operation. |
| |
| Keywords: | FFT WFTA pipeline |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
