A New Fast Bit-Reversal Permutation Algorithm Based on a Symmetry
J. Prado · IEEE Signal Processing Letters · 2004
This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited until now. According to timing experiments, this algorithm outperforms the fastest algorithms known to the author. This is of interest for applications using intensive fast Fourier transforms (or fast Hartley transforms) of constant length, such as transform domain adaptive filtering.