By Topic

Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms

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
$33 $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)
P. Duhamel ; CNET, Issy-les-Moulineaux, France

In a previous work (see Electron. Lett., vol.20, no.17, p.690, 1984), the author described an algorithm that computes a length-2n discrete Fourier transform using 22+1-2n2+4n-8 nontrivial (i.e. ≠±j=±√-1) complex multiplications. In the present work, it is first shown that this algorithm actually provides the attainable lower bound on the number of complex multiplications. A slight modification of the last step of this algorithm is also shown to provide the attainable lower bound on the number of real multiplications. A connection with the split-radix FFT algorithm (SRFFT) is then explained, showing that SRFFT is another variation of these optimal algorithms, where the last step is computed recursively from shorter FFTs in a suboptimal manner. Finally, once the connection between the minimal complexity and SRFFT (which is the best known practical algorithm) is understood, it provides useful information on the possibility of further improvements of the SRFFT

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:38 ,  Issue: 9 )