摘要
文章对传统FFT算法进行了改进,改进后的算法将N点DFT分解成二维姨N点DFT的组合,在结构上更适合于用流水线方式实现FFT。文章首先对算法进行了推导,然后基于该算法设计了一个64点、32位字长的定点IFFT/FFT模块,用于802.11a中OFDM的调制/解调。与传统的流水线FFT比较,该模块中的复数乘法运算全部采用移位相加操作完成,因而消除了乘法器及旋转因子ROM的使用,降低了功耗。最后,对该模块进行了验证仿真。结果表明,在流水线饱和的情况下,该模块完成一个64点的FFT运算只需要8个时钟周期,在20MHZ时钟频率下,该模块的功耗为0.26W,完全能满足移动通信中对于高速度、低功耗的要求。
This article presented an improved FFT algorithm. The algorithm, which decomposes N-point DFT into -point DFT, was structurally more suitable for the pipeline implementation of FFT. The algorithm was deduced first, then a 64-point?32-bit fixed-point pipeline IFFT/FFT module was designed based on the algorithm. In comparison with traditional pipeline FFT, the complex multiplication was implemented by shifting and addition operations in order to eliminate multiplication unit and coefficient ROM. Finally, the module was verified and simulated. The results showed that in condition that the pipeline was saturating, only 8 clock cycles were needed to finish a 64-point DFT. Under 20 MHz frequency, the power consumption of the module was 0.26W. As a result, the FFT module could satisfy both high speed and low power requirements for mobile applications.
出处
《微电子学与计算机》
CSCD
北大核心
2005年第6期57-60,共4页
Microelectronics & Computer
基金
国家自然科学基金资助(NSFC60203006)
