New fast algorithm for two-dimensional discrete Fourier transform DFT(2 n ; 2)
- 5 January 1989
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 25 (1) , 21-22
- https://doi.org/10.1049/el:19890015
Abstract
We present 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
This publication has 0 references indexed in Scilit: