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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

Bit-reversal routine is considered as an essential part in Fast Fourier transforms (FFT) and Fast Hartley Transform (FHT). Image…

2012

The steganography is used to hide information and communicate in secure way to the destination. In this paper we propose Secure…

2009

A multistage interconnection network (MIN) consisting of 2 times 2 nodes constructs a nonblocking switch if the network is…

2004

This paper shows a symmetrical decomposition of the Fast Fourier Transform (FFT) into stages such that butterflies of small…

2004

This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited…

2001

In this correspondence, we present a new bit reversal algorithm that outperforms the existing ones. The bit reversal technique is…

1999

On the Development of Block-Ciphers and Pseudo-Random Function Generators Using the Composition and XOR Operators Steven A. Myers…

1990

A new bit reversal permutation algorithm is described. Such algorithms are needed for radix 2 (or radix B) fast Fourier…

1988

1974

Radix—2 fast Fourier transform programs of the Gentleman-Sande type leave the transformed array in a scrambled order of…