By Topic

On indexing the prime factor 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

2 Author(s)
Chan, S.C. ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong ; Ho, K.L.

The Temperton (1985) indexing scheme for the prime factor fast Fourier transform algorithm (PFA-FFT) is generalized to include other prime factor maps. In particular, it is found that the updating scheme for the Ruritanian map can completely avoid the modulo operations required in indexing the data

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:38 ,  Issue: 8 )