DocumentCode :
859265
Title :
New fast algorithm for two-dimensional discrete Fourier transform DFT (2n; 2)
Author :
Ma, Weizhen ; Yang, Dekun
Author_Institution :
South China Univ. of Technol., Guangzhou, China
Volume :
25
Issue :
1
fYear :
1989
Firstpage :
21
Lastpage :
22
Abstract :
Presents a new fast algorithm for computing the two-dimensional discrete Fourier transform DFT(2n; 2) using the fast discrete cosine transform algorithm. The algorithm has a lower number of multiplications and additions compared with other published algorithms for computing the two-dimensional DFT. Because it uses only real multiplications, the algorithm is more suitable for real input data.
Keywords :
fast Fourier transforms; signal processing; subroutines; discrete cosine transform algorithm; fast algorithm; number of additions; number of multiplications; two-dimensional DFT; two-dimensional discrete Fourier transform;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19890015
Filename :
19642
Link To Document :
بازگشت