Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,766,420 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Calkin–Wilf tree
Cooley–Tukey FFT algorithm
Fast Fourier transform
Fixed-point arithmetic
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
An efficient bit reversal permutation algorithm
R. A. Al Na'mneh
,
Khalid A. Darabkh
International Conference on Robotics, Biomimetics…
2013
Corpus ID: 15423234
Bit-reversal routine is considered as an essential part in Fast Fourier transforms (FFT) and Fast Hartley Transform (FHT). Image…
Expand
2012
2012
Secure steganography using hybrid domain technique
H. Reddy
,
N. Sathisha
,
A. Kumari
,
K. Raja
International Conference on Computing…
2012
Corpus ID: 17523003
The steganography is used to hide information and communicate in secure way to the destination. In this paper we propose Secure…
Expand
2009
2009
On rearrangeability of tandem connection of banyan-type networks
S. Li
,
X. Tan
IEEE Transactions on Communications
2009
Corpus ID: 24849334
A multistage interconnection network (MIN) consisting of 2 times 2 nodes constructs a nonblocking switch if the network is…
Expand
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…
Expand
2004
2004
A new fast bit-reversal permutation algorithm based on a symmetry
J. Prado
IEEE Signal Processing Letters
2004
Corpus ID: 11944724
This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited…
Expand
2001
2001
A new efficient computational algorithm for bit reversal mapping
K. Drouiche
IEEE Transactions on Signal Processing
2001
Corpus ID: 40058924
In this correspondence, we present a new bit reversal algorithm that outperforms the existing ones. The bit reversal technique is…
Expand
1990
1990
A new bit reversal algorithm
James S. Walker
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 33576646
A new bit reversal permutation algorithm is described. Such algorithms are needed for radix 2 (or radix B) fast Fourier…
Expand
1990
1990
Costs of Quadtree Representation of Nondense Matrices
David S. Wise
,
J. Franco
J. Parallel Distributed Comput.
1990
Corpus ID: 21196755
1988
1988
Revised Magnetostratigraphies Confirm Low Sedimentation Rates in Arctic Ocean Cores
W. Witte
,
D. Kent
Quaternary Research
1988
Corpus ID: 55619108
Review
1988
Review
1988
Unscrambling for fast DFT algorithms
C. Burrus
IEEE Transactions on Acoustics Speech and Signal…
1988
Corpus ID: 19827292
Several methods are reviewed for removing the unscrambler in the prime factor algorithms (PFA) and the types of unscrambler…
Expand
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)
ACCEPT & CONTINUE