By Topic

Rapidly "Bit-reversing" data for the past Fourier transform

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)
Brenner, N. ; IBM T. J. Watson Research Center, Yorktown Heights, N.Y.

In most variations of the Fast Fourier Transforms, the data to be transformed must be permuted in a peculiar way either before or after the trigonometric calculations. On typical computer implementations, this adds from 10% to 25% to the running time. Besides the actual data exchanges, much time is consumed computing which data to exchange. The technique described here permits this permutation to be performed on any computer, without special hardware, with very little time for the determination of the exchange indices, and with very little additional storage. It is most useful when the number of points to be permuted is fixed.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '80.  (Volume:5 )

Date of Conference:

Apr 1980