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
关键词
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 条
  • [31] Odd-factor algorithms for multidimensional discrete W transform
    Bi, Guoan
    Zeng, Yonghong
    Lin, Zhiping
    Circuits, Systems and Signal Processing, 2003, Birkhauser Boston (22) : 377 - 393
  • [32] Odd-factor algorithms for multidimensional discrete W transform
    Bi, GA
    Zeng, YH
    Lin, ZP
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2003, 22 (04) : 377 - 393
  • [33] DISCRETE FOURIER-TRANSFORM ALGORITHMS FOR REAL VALUED SEQUENCES
    MARTENS, JB
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (02): : 390 - 396
  • [34] DISCRETE FAST FOURIER-TRANSFORM ALGORITHMS - A TUTORIAL SURVEY
    AN, M
    GERTNER, I
    ROFHEART, M
    TOLIMIERI, R
    ADVANCES IN ELECTRONICS AND ELECTRON PHYSICS, 1991, 80 : 1 - 67
  • [35] Analysis of algorithms for nonuniform-time discrete Fourier transform
    Bland, DM
    Laakso, TI
    Tarczynski, A
    ISCAS 96: 1996 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - CIRCUITS AND SYSTEMS CONNECTING THE WORLD, VOL 2, 1996, : 453 - 456
  • [36] OFDM Channel Estimation Algorithms based on Discrete Fourier Transform
    Li Wenjuan
    Zhao Ruiyu
    INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING, 2016, 9 (08): : 283 - 292
  • [37] Small-Size Algorithms for Quaternion Discrete Fourier Transform
    Cariow, Aleksandr
    Majorkowska-Mech, Dorota
    Applied Sciences (Switzerland), 2024, 14 (23):
  • [38] METHODS OF INCREASING THE EFFICIENCY OF MULTIMEASURE DISCRETE FOURIER TRANSFORM ALGORITHMS
    VLASENKO, VA
    LAPPA, YM
    RADIOTEKHNIKA I ELEKTRONIKA, 1989, 34 (03): : 535 - 545
  • [39] VECTORIZED MIXED RADIX DISCRETE FOURIER-TRANSFORM ALGORITHMS
    AGARWAL, RC
    COOLEY, JW
    PROCEEDINGS OF THE IEEE, 1987, 75 (09) : 1283 - 1292
  • [40] Design and analysis of discrete Fourier transform coding techniques in the presence of AWGN
    Garg, HK
    Tan, BT
    Li, M
    ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 1138 - 1142