改进的任意基FFT整序算法

An Improved Digit-Reversal Permutation Algorithm for the Radix-B FFT

本文提出了一种改进的适合于任意基ＦＦＴ变换的整序算法，改进整序算法采用循环嵌套结构，减少了运算量，实验结果表明，改进整序算法的运算时间较其它整序算法少。

An improved digit-reversal permutation algorithm for the radix--B Fast Fourier Transforms (FFT) is presented in this paper, which decreases computation of the 'digit-reversing' because of loop nesting called by itself According to timing experiments, the improved permutation algorithm saves its running the much more than others.