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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
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
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 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
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
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
  • 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
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
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, 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
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?