Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Discrete Fourier transform algorithms for real valued sequences

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 $13
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

1 Author(s)
Martens, J.-B. ; University of Ghent, Ghent, Belgium

It is well known that the discrete Fourier transformation (DFT) of a real-valued sequence contains some redundancies. More precisely, approximately half of the DFT coefficients suffice to completely determine the DFT. In this paper, it is shown that the choice of the set of (nonredundant) DFT coefficients to be calculated affects the efficiency of the resulting algorithm. One especially interesting choice is discussed in detail for the case of mixed radix-(2, 3) DFT algorithms. Algorithms for the DFT calculation of both one and more dimensional real-valued arrays are discussed.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:32 ,  Issue: 2 )