Skip to search formSkip to main contentSkip to account menu

Bit-reversal permutation

Known as: Bit reversal, Bit-reversed order, Digit-reversal permutation 
In applied mathematics, a bit-reversal permutation is a permutation of a sequence of n items, where n = 2k is a power of two. It is defined by… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Calkin–Wilf treeCooley–Tukey FFT algorithmFast Fourier transformFixed-point arithmetic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
An efficient bit reversal permutation algorithm
Bit-reversal routine is considered as an essential part in Fast Fourier transforms (FFT) and Fast Hartley Transform (FHT). Image… 
2012
2012
Secure steganography using hybrid domain technique
The steganography is used to hide information and communicate in secure way to the destination. In this paper we propose Secure… 
2009
2009
On rearrangeability of tandem connection of banyan-type networks
A multistage interconnection network (MIN) consisting of 2 times 2 nodes constructs a nonblocking switch if the network is… 
2004
2004
Symmetrical factorization of the fast Fourier transform for efficient implementation
  • H. Sim
  • Proceedings 7th International Conference on…
  • 2004
  • Corpus ID: 9212849
This paper shows a symmetrical decomposition of the Fast Fourier Transform (FFT) into stages such that butterflies of small… 
2004
2004
A new fast bit-reversal permutation algorithm based on a symmetry
This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited… 
2001
2001
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… 
1990
1990
A new bit reversal algorithm
A new bit reversal permutation algorithm is described. Such algorithms are needed for radix 2 (or radix B) fast Fourier… 
1990
1990
Costs of Quadtree Representation of Nondense Matrices
1988
1988
Revised Magnetostratigraphies Confirm Low Sedimentation Rates in Arctic Ocean Cores
Review
1988
Review
1988
Unscrambling for fast DFT algorithms
Several methods are reviewed for removing the unscrambler in the prime factor algorithms (PFA) and the types of unscrambler… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)