Cart (Loading....) | Create Account
Close category search window
 

Algebraic formulation of the fast Fourier transform

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
Tran-Thong ; Tektronix Inc., Beaverton, OR, USA

A new unified formulation of the fast Fourier transform is presented. It is shown that all FFT algorithms can be derived by different methods of multidimensional array unwrapping. The eight principal decimation in time FFT algorithms are derived. Two algorithms with the desirable properties of sequential input, sequential output and identical computational geometry are also derived. The derivation of the decimation in frequency FFT algorithms is then discussed. While most of the results presented here have been derived earlier using matrix Kronecker products, the present formulation is simpler and more intuitive that the equivalent matrix formulation.

Published in:

Circuits & Systems Magazine  (Volume:3 ,  Issue: 2 )

Date of Publication:

June 1981

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.