Title :
Fast bit-reversal algorithms
Author :
Elster, Anne Cathrine
Author_Institution :
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
Abstract :
A novel fast algorithm for computing a sequence of bit-reversed integers is presented. In finding a mapping function from a sequence of integers to a sequence of their bit-reverse, a recursive approach is taken to overcome the logarithmic factor burdening the standard scheme. The associated constant for the timing factor is shown to be very low even at the register level. The method generalizes to radix-r and mixed-radix cases and provides an efficient vectorizable scheme with the same low constant
Keywords :
digital arithmetic; bit-reversed integers; fast bit reversal algorithms; mapping function; recursive approach; timing factor; vectorizable scheme; Fast Fourier transforms; Flexible printed circuits; Genetic mutations; Hardware; Multidimensional systems; Out of order; Registers; Sorting; Testing;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on
Conference_Location :
Glasgow
DOI :
10.1109/ICASSP.1989.266624
