2008
DOI: 10.1016/j.cam.2006.11.025
|View full text |Cite
|
Sign up to set email alerts
|

Vector coding algorithms for multidimensional discrete Fourier transform

Abstract: 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 1-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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
references
References 17 publications
0
0
0
Order By: Relevance