摘要
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.
出处
《计算数学》
CSCD
北大核心
2004年第2期137-150,共14页
Mathematica Numerica Sinica
关键词
FFT
行列算法
向量基算法
向量编码
FFT, Row-column algorithm, Vector-radix algorithm, Vector coding
