By Topic

A new efficient computational algorithm for bit reversal mapping

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Drouiche, K. ; CNRS, Neuville Sur Oise, France

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

Published in:

Signal Processing, IEEE Transactions on  (Volume:49 ,  Issue: 1 )