Vector coding algorithms for multidimensional discrete Fourier transform

被引：2
|
作者：
Chen, Zhaodou [1 ]
Zhang, Lijing [2 ]
机构：
[1] China Univ Geosci, Sch Informat Engn, Beijing 100083, Peoples R China
[2] Univ Sci & Technol Beijing, Dept Mat & Mech, Beijing 100083, Peoples R China
来源：
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 2008年 / 212卷 / 01期
关键词：
vector coding; multidimensional DFT; Cooley-Tukey FFT; row-column algorithm; butterfly operation;
D O I：
10.1016/j.cam.2006.11.025
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Cooley-Tukey algorithm from I-D to multidimensional form, the structure of the program is as simple as the Cooley-Tukey fast Fourier transform (FFT). The new algorithm significantly reduces the number of multiplications and recursive stages. The VC-FFT therefore comprehensively reduces the complexity of the algorithm as compared with other current multidimensional DFT algorithms. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：63 / 74
页数：12
相关论文
共 50 条
12345