OurBigBook About$ Donate
 Sign in Sign up

Bit-reversal permutation

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Combinatorial algorithms
 0 By others on same topic  0 Discussions Create my own version
Bit-reversal permutation is a mathematical operation typically used in computer science and signal processing, particularly in the context of algorithms such as the Fast Fourier Transform (FFT). The basic idea is to permute the order of bits in binary representations of numbers. ### Definition Given an integer \( n \), the bit-reversal permutation rearranges the integers in the range \( 0 \) to \( n-1 \) by reversing the bits of their binary representations.

 Ancestors (6)

  1. Combinatorial algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook