【摘要】 研究一种适用于VLSI设计的高速、低功耗快速傅里叶变换(FFT)处理器中操作数与旋转因子的地址快速生成方法.通过引入r进制数(r=2,4,8,…)的概念对离散傅里叶变换(DFT)算法进行重新推导,并利用r进制数的运算规则得出了一种新的基r数的固定点与可变点长Cooley-Tukey FFT算法的地址快速生成方法.该方法还进一步减少了旋转因子的读取次数,并对可变点长FFT处理器中旋转因子的存储容量进行了压缩.更多还原

【Abstract】 A fast address generation scheme of radix r(r=2,4,8,…) Cooley-Tukey fast Fourier transform(FFT) algorithm for fixed point and variable point is proposed.The new scheme is based on the r number system and it’s calculating rule.The advantage of this address generation scheme lies in that it generates fast the operation and twiddle factors address and further reduces the twiddle factors access times and compresses the twiddle factors’ storage volume in variable point FFT processor.更多还原