FFT标准整序算法的优化  

Optimization of Arranging Order Standard Arithmetic for FFT

作　　者：高丽[1] 刘卫新[1] 张学智[1] 

机构地区：[1]西安工业学院电信学院,陕西西安710032

出　　处：《探测与控制学报》2004年第2期62-64,共3页Journal of Detection & Control

摘　　要：离散快速傅立叶变换中序列逆序的标准算法和相应程序,不仅在教科书中相互广泛抄传,在实际应用中也是如此。文中指出了这个算法的缺陷,提出了改进方法,明显地提高了整序效率,使FFT标准整序算法得到优化。The standard arithmetic and program of inverse order for discrete fast Fourier transform (FFT) are not only widely transcribed in textbooks, but also universally used in practice. In this paper, the disadvantages of standard arithmetic are pointed out, and a new method is given to improve inverse order for FFT with high efficiency, the standard arithmetic is also optimized.

关 键 词：FFT 快速傅立叶变换 逆序 倒序 算法优化 

分 类 号：TN911.72[电子电信—通信与信息系统]