A better FFT bit-reversal algorithm without tables

The bit-reversal counteralgorithm of B. Gold and C.M. Radar (1969) bit reverses a continuous sequence of N numbers by running a loop N -1 times. The heuristic approach presented repeats a similar loop only N/4 times. >

[1]  Jeffrey J. Rodriguez.  An improved FFT digit-reversal algorithm , 1989, IEEE Trans. Acoust. Speech Signal Process..

[2]  B. K. Bhagavan,et al.  Fast Computational Algorithms for Bit Reversal , 1974, IEEE Transactions on Computers.

[3]  James S. Walker.  A new bit reversal algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..

[4]  David M. W. Evans.  An improved digit-reversal permutation algorithm for the fast Fourier and Hartley transforms , 1987, IEEE Trans. Acoust. Speech Signal Process..