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 条

[1] NEW ALGORITHMS FOR THE MULTIDIMENSIONAL DISCRETE FOURIER-TRANSFORM
AUSLANDER, L
FEIG, E
WINOGRAD, S
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1983, 31 (02): : 388 - 403
[2] FAST ALGORITHMS FOR THE MULTIDIMENSIONAL DISCRETE FOURIER-TRANSFORM
GUESSOUM, A
MERSEREAU, RM
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1986, 34 (04): : 937 - 943
[3] FAST ALGORITHMS TO COMPUTE MULTIDIMENSIONAL DISCRETE FOURIER-TRANSFORM
GERTNER, I
TOLIMIERI, R
REAL-TIME SIGNAL PROCESSING XII, 1989, 1154 : 132 - 146
[4] MATRIX TREATMENT OF FAST MULTIDIMENSIONAL DISCRETE FOURIER-TRANSFORM ALGORITHMS
VLASENKO, VA
LAPPA, YM
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOELEKTRONIKA, 1986, 29 (01): : 86 - 89
[5] Research on the Improved Vector Coding Algorithm for Two Dimensional Discrete Fourier Transform
Zhang, Hao
Chen, Zhaodou
Yang, Jin
ADVANCES IN MATERIALS, MACHINERY, ELECTRONICS I, 2017, 1820
[6] FAST COMPUTATION OF THE MULTIDIMENSIONAL DISCRETE FOURIER TRANSFORM AND DISCRETE BACKWARD FOURIER TRANSFORM ON SPARSE GRIDS
Jiang, Ying
Xu, Yuesheng
MATHEMATICS OF COMPUTATION, 2014, 83 (289) : 2347 - 2384
[7] Vector computation of the discrete Fourier transform
Sundararajan, D
Ahmad, MO
Swamy, MNS
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1998, 45 (04): : 449 - 461
[8] Proof of unitarity of multidimensional discrete Fourier transform
Angeletti, P.
ELECTRONICS LETTERS, 2013, 49 (07) : 501 - 502
[9] Polynomial Transform algorithms for Multidimensional Discrete Hartley Transform
Zeng, YH
Bi, GA
Leyman, AR
ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL V: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 517 - 520
[10] Fast algorithms for a multidimensional hypercomplex discrete Fourier transform with radix-3 decomposition
Aliev M.V.
Chicheva M.A.
Pattern Recogn. Image Anal., 2007, 1 (6-10): : 6 - 10

← 1 2 3 4 5 →