By Topic

A rearranged DFT algorithm requiring N2/6 multiplications

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)
C. Boncelet ; University of Deleware, Newark, DE, USA

We consider the problem of computing the DFT and present two reductions over the standard formula. In the special case of an N-point sequence with N = 2l, the number of multiplications per output point required by this algorithm is, at most, N/4 - 1 and, on the average, N/6 - 1. Each output point requires no more than N - 1 additions. In applications requiring only some of the output points, a computational savings over the standard (FFT) techniques may be achieved. Furthermore, we argue that in a certain sense these reductions are optimal.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 6 )