FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2016
051019742016

Related topics

Related topics

10 relations
Calkin–Wilf treeCooley–Tukey FFT algorithmFast Fourier transformFixed-point arithmetic
(More)

Related mentions per year

Related mentions per year

1952-2018
1960198020002020
Bit-reversal permutation
Fast Fourier transform
Memory hierarchy
Fixed-point arithmetic
Power of two
Random-access machine

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… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2013
2013
Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast Algorithms and Architectures
A mathematical characterization of serially pruned permutations (SPPs) employed in variable-length permuters and their associated… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
A recursive algorithm for pruned bit-reversal permutations
A fast recursive algorithm for pruned bit-reversal permutations is proposed. The algorithm is based on a computationally… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Optimum Circuits for Bit Reversal
This brief presents novel circuits for calculating bit reversal on a series of data. The circuits are simple and consist of… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Optimal bit-reversal using vector permutations
We have developed a bit-reversal algorithm (BRAVO) using vector permute operations, which is optimal in the number of… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
A new fast bit-reversal permutation algorithm based on a symmetry
  • J. Prado
  • IEEE Signal Processing Letters
  • 2004
This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited… (More)
  • table I
Is this relevant?
2000
2000
Perfect trees and bit-reversal permutations
A famous algorithm is the Fast Fourier Transform, or FFT. An eecient iterative version of the FFT algorithm performs as a rst… (More)
Is this relevant?
1998
1998
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and… (More)
  • figure 1
  • figure 3
  • figure 2
  • table 1
  • figure 5
Is this relevant?
1996
1996
Bit Reversal on Uniprocessors
Bit reversal, hierarchical memory, Fast Fourier Transform Many versions of the Fast Fourier Transform require a reordering of… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
1991
1991
A simple algorithm for the bit-reversal permutation
An easy improvement of the Gold bit-reversal permutat ion algorithm is based on some observations concerning the distribution of… (More)
  • figure 1
  • figure 3
Is this relevant?