Radix-4 FFT algorithms with ordered input and output data
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
A Fast Recursive Algorithm and Architecture for Pruned Bit-reversal Interleavers
Journal of Signal Processing Systems
| Hi-index | 35.68 |
In this correspondence, we present a new bit reversal algorithm that outperforms the existing ones. The bit reversal technique is involved in the fast fourier transform (FFT) technique, which is widely used in computer-based numerical techniques for solving numerous problems. The new approach for computing the bit reversal is based upon a pseudo semi-group homomorphism property. The surprising thing is that this property is almost trivial to prove, but at the same time, it also leads to a very efficient algorithm, which we believe to be the best with only O(N) operations and optimal constant, i.e. unity