By Topic

A High-Speed Algorithm for the Computer Generation of Fourier Transforms

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)

Abstract—An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog2N complex additions (complex additions include complex subtractions) and ½N [log2(N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N2complex additions and multiplications, especially when considering the use of digital machines whose MULTIPLY time is much longer than ADD time.

Published in:

Computers, IEEE Transactions on  (Volume:C-17 ,  Issue: 4 )