By Topic

Multiplicative complexity of the 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)
Ma, W. ; South China Inst. of Technol., Guangzhou ; Yang, D.

Shows that the two-dimensional discrete Fourier transform DFT (2 n; 2) can be transformed into a series of distinct second versions of the discrete cosine transform DCT. As a result of the minimal number of real multiplications over the field Q to compute the length 2n second version DCT, the authors derive the minimum number of real multiplications over the field Q necessary to compute a two-dimensional discrete Fourier transform for 2 n×2n real input data

Published in:

Electronics Letters  (Volume:24 ,  Issue: 9 )