A new efficient computational algorithm for bit reversal mapping

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 co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2001-01, Vol.49 (1), p.251-254
Main Author: Drouiche, K.
Format: Article
Language:English
Subjects:
Algorithms
Computation
Fast Fourier transforms
Flexible printed circuits
Fourier transforms
Homomorphisms
Mapping
Optimization
Sampling methods
Signal processing
Signal processing algorithms
Unity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.890370