We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A Fast Fourier Transform for High-Speed Signal Processing

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)

An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced. The algorithm yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fourier transform, allows 100 percent utilization of the arithmetic unit, and yields properly ordered Fourier coefficients without the need for pre- or postordering of data.

Published in:

Computers, IEEE Transactions on  (Volume:C-20 ,  Issue: 8 )