By Topic

A review of the discrete Fourier transform. 1. Manipulating the powers of two

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

1 Author(s)
Blair, G.M. ; Central Res. Lab., Hitachi Ltd., Tokyo, Japan

Since fast algorithms for the discrete Fourier transform (DFT) were first introduced, they have had a major impact on signal processing and are now a basic part of every electrical engineer's education. However, some of the options and advances are not as widely known as they deserve. Over two papers. The fast algorithms for the DFT are reviewed. The first paper considers why the DFT works and looks at the various fast algorithms for transforms whose orders are a power of two

Published in:

Electronics & Communication Engineering Journal  (Volume:7 ,  Issue: 4 )