Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A fast recursive bit-reversal algorithm

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

2 Author(s)
Jechang Jeong ; Electr. Eng. & Comput. Sci. Dept., Michigan Univ., Ann Arbor, MI, USA ; Williams, W.J.

A novel fast recursive O(N) algorithm for bit-reversal permutation of a data array is presented. Exploiting regularity in the bit-reversal and eliminating redundant computations, this new method provides a considerable improvement in computational time. This computational efficiency results from the fact that every permutation index is basically computed by a single logical or arithmetic operation between a previous index and a proper offset. Experiments show that it is faster than any other bit-reversal algorithms that seem to be available. The performance of this method is compared to that of other bit-reversal method. Extension of the method to general digit reversal is described. Bit-reversal permutation of two-dimensional arrays is also discussed

Published in:

Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on

Date of Conference:

3-6 Apr 1990