By Topic

New fast algorithm for two-dimensional discrete Fourier transform DFT (2n; 2)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wiezhen Ma ; South China Univ. of Technol., Guangzhou, China ; Yang Dekun

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.

Published in:

Electronics Letters  (Volume:25 ,  Issue: 1 )