By Topic

Parallel data streams and serial arithmetic for fast Fourier transform processors

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)
Gottlieb, P. ; Australian Aeronautical Research Laboratories, Melbourne, Australia ; De Lorenzo, L.

An algorithm is presented that introduces two degrees of parallelism into the implementation of fast Fourier transform (FFT) processors. That is, both the radix of factorization and the number of arithmetic units may be selected to achieve the required processing speed. A serial vector multiplier that is ideally suited to the implementation of a general radix arithmetic unit is described. It is subsequently shown that a fast Fourier processor having an attractive cost performance ratio can be built by employing serial arithmetic in the implementation of the algorithm developed.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:22 ,  Issue: 2 )