Cooley-Tukey FFT在高维的算法  

THE EXTENSION OF COOLEY-TUKEY FFT ALGORITHMS FOR MULTIDIMENSIONAL DFT

作　　者：陈兆斗[1] 申亚男[2] 张丽静[2] 张东霞[3] 

机构地区：[1]中国地质大学(北京)信息工程学院,北京100083 [2]北京科技大学数学力学系,北京100083 [3]北京农业职业学院基础部,北京102442

出　　处：《计算数学》2004年第2期137-150,共14页Mathematica Numerica Sinica

摘　　要：A new fast algorithm is presented for multidimensional DFT in this paper. This algorithm is derived based on an interesting coding technique for multidimensional integral point, named the technique vector coding. And called the algorithm VCFFT (vector coding fast Fourier transform). Since the VC-FFT is the extension of Cooley-Tukey algorithm from one-dimensional to multidimensional, its structure of program is simple as Cooley-Tukey FFT, and significantly reduces multiplications and recursive stages.A new fast algorithm is presented for multidimensional DFT in this paper. This algorithm is derived based on an interesting coding technique for multidimensional integral point, named the technique vector coding. And called the algorithm VC-FFT (vector coding fast Fourier transform). Since the VC-FFT is the extension of Cooley-Tukey algorithm from one-dimensional to multidimensional, its structure of program is simple as Cooley-Tukey FFT, and significantly reduces multiplications and recursive stages.

关 键 词：FFT 行列算法 向量基算法 向量编码 

分 类 号：O241[理学—计算数学]