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

The techniques of the generalized fast Fourier transform algorithm

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)
Stasinski, R. ; Inst. Elektroniki i Telekomunikacji Politech. Poznanskiej, Poznan, Poland

A general method of deriving DFT (discrete Fourier transform) algorithms, generalised fast Fourier transform algorithms, is presented. It is shown that a special case of the method is equivalent to nesting of FFTs. The application of the method to the case where N has mutually prime factors results in a new interpretation of the permutations characteristic of this class of algorithms. It is shown that the equalization of FFTs leads to results which are different from the widely used intuitive ones. The high efficiency of split-radix FFTs is explained. It is shown that the formulae of the method can be easily adapted for deriving algorithms for the cosine/sine DFT. A set of FFTs that has smaller arithmetical and/or memory complexities than any algorithm known is presented. In particular, a method of deriving split-radix-2s FFTs requiring N log2 N-3N+4 real multiplications and 3N log2 N-3N+4 additions for any s>1 is presented

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 5 )

Date of Publication:

May 1991

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.