A Fast Address Generation Scheme for FFT Processor
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.
fast Fourier transformbutterfly calculationtwiddle factorvariable size fast Fourier transform
NETL
NSTL
万方数据
维普
