Title :
A better FFT bit-reversal algorithm without tables
Author_Institution :
Dept. of Electron., Univ. Simon Bolivar, Caracas, Venezuela
fDate :
10/1/1991 12:00:00 AM
Abstract :
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
Keywords :
fast Fourier transforms; heuristic programming; FFT bit-reversal algorithm; counteralgorithm; fast Fourier transform; heuristic approach; Counting circuits; Gold; Prediction algorithms; Signal processing algorithms;
Journal_Title :
Signal Processing, IEEE Transactions on
