DocumentCode
1506671
Title
A new bit reversal algorithm
Author
Walker, James S.
Author_Institution
Dept. of Math., Wisconsin Univ., Eau Claire, WI, USA
Volume
38
Issue
8
fYear
1990
fDate
8/1/1990 12:00:00 AM
Firstpage
1472
Lastpage
1473
Abstract
A new bit reversal permutation algorithm is described. Such algorithms are needed for radix 2 (or radix B ) fast Fourier transforms (FFTs) or fast Hartley transforms (FHTs). This algorithm is an alternative to one described by Evans (1987). A BASIC version of this algorithm ran slightly faster than the BASIC version of Evans´ algorithm given by Bracewell (1986), with some time savings for odd powers of two. This new algorithm also allows for precomputation of seed tables up to one higher power of two than Evans´ algorithm
Keywords
BASIC listings; binary sequences; fast Fourier transforms; BASIC; FFT; binary sequences; bit reversal permutation algorithm; fast Fourier transforms; fast Hartley transforms; radix 2; Acoustics; Books; Fast Fourier transforms; Genetic mutations; Mathematics; Mirrors; Page description languages; Radio access networks; Reflection; Speech;
fLanguage
English
Journal_Title
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
0096-3518
Type
jour
DOI
10.1109/29.57586
Filename
57586
Link To Document