Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,263,105 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.
2012
2012
A recursive algorithm for pruned bit-reversal permutations
Mohammad M. Mansour
IEEE International Conference on Acoustics…
2012
Corpus ID: 11049818
A fast recursive algorithm for pruned bit-reversal permutations is proposed. The algorithm is based on a computationally…
Expand
2012
2012
Notes on Bit-reversal Broadcast Scheduling
M. Kik
arXiv.org
2012
Corpus ID: 14796760
This report contains revision and extension of some results about RBO from [14]. RBO is a simple and ecient broadcast scheduling…
Expand
2012
2012
Implementation of OFDM using Efficient Mixed-Radix 8-2 FFT Algorithm with bit reversal for the output sequences
M. M. Ismail
,
M. J. S. Rangachar
,
D. V. Paradesi Ch
,
Rao
2012
Corpus ID: 15305315
In recent years, as a result of advancing VLSI technology, OFDM has received a great deal of attention and been adopted in many…
Expand
2011
2011
Construction and Count on Linear Orthomorphic Permutations Based on m Sequence
Jiao Du
,
Qiaoyan Wen
,
Xin Liao
,
J. Zhang
,
Shou-chao Song
International Conference Communication and…
2011
Corpus ID: 17515234
The orthomorphic permutation is a kind of one-to-one mapping from to F2. Orthomorphic permutations can be used in the…
Expand
2004
2004
Address generators for mapping arrays in bit-reversed order
T. R. Harley
,
Giriyapura Panchaksharaiah Maheshwaramurthy
IEEE Transactions on Signal Processing
2004
Corpus ID: 10043478
A new technique enables fast Fourier transform (FFT) software to more efficiently use memory and processing time. The technique…
Expand
2004
2004
A new fast bit-reversal permutation algorithm based on a symmetry
Jacques 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
Performance analysis of wormhole routing in multicomputer interconnection networks
H. Sarbazi-Azad
2001
Corpus ID: 31878163
Perhaps the most critical component in determining the ultimate performance potential of a multicomputer is its interconnection…
Expand
1997
1997
Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery
F. Petrini
,
M. Vanneschi
Proceedings 11th International Parallel…
1997
Corpus ID: 11917776
Deadlock recovery as a viable alternative to deadlock avoidance has recently gained an increasing consideration in the scientific…
Expand
1989
1989
A second improved digit-reversal permutation algorithm for fast transforms
David M. W. Evans
IEEE Transactions on Acoustics Speech and Signal…
1989
Corpus ID: 11027565
Based on three previously published theorems and an algorithm for the digit-reversal permutation required by fast transform…
Expand
1987
1987
Best and Worst Mappings for the Omega Network
Z. Cvetanovic
IBM Journal of Research and Development
1987
Corpus ID: 45994758
This paper presents a study of the best and worst mappings for the omega network proposed by D. H. Lawrie in 1975. We identify…
Expand