摘要
本文介绍一种新型的素因子FFT算法,这种算法的特点是发展一种新的嵌套结构,并改进Wingrad小N点DFT算法,使其适应新的嵌套结构。新算法的加、乘法总数比PFA(素因子FFT算法)和WFTA(Winograd FFT算法)两者都少,并且,新算法不象WFTA那样需要“扩维”和需要在主存贮器和暂存器之间的数据传输,而且还可实现同址、顺序计算.
This paper describes a new nesting scheme for prime factor FFT algorithm which differs from both the winograd Fourier transform algorithm (WFTA) and prime factor FFT algorithm (PFA). This new algorithm developed a new nesting scheme which will not 'expand' the data in nesting multiplication part. The new algorithm requires the least number of operations among the above three algorithms, and can be implemented in—place and in—order.
出处
《信号处理》
CSCD
北大核心
1990年第4期244-254,共11页
Journal of Signal Processing
