Results 1  10
of
290,213
Bit Reversal On Uniprocessors
 SIAM Rev
, 1996
"... Manyversions of the fast Fourier transform require a reordering of either the input or the output data that corresponds to reversing the order of the bits in the array index. There has been a surprisingly large number of papers on this subject in the recent literature. ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Manyversions of the fast Fourier transform require a reordering of either the input or the output data that corresponds to reversing the order of the bits in the array index. There has been a surprisingly large number of papers on this subject in the recent literature.
Optimum Circuits for Bit Reversal
"... ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other wo ..."
Abstract
 Add to MetaCart
©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Perfect Trees and Bitreversal Permutations
, 1999
"... A famous algorithm is the Fast Fourier Transform, or FFT. An efficient iterative version of the FFT algorithm performs as a first step a bitreversal permutation of the input list. The bitreversal permutation swaps elements whose indices have binary representations that are the reverse of each othe ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
A famous algorithm is the Fast Fourier Transform, or FFT. An efficient iterative version of the FFT algorithm performs as a first step a bitreversal permutation of the input list. The bitreversal permutation swaps elements whose indices have binary representations that are the reverse of each
Perfect Trees and BitReversal Permutations
, 1999
"... A famous algorithm is the Fast Fourier Transform, or FFT. An ecient iterative version of the FFT algorithm performs as a rst step a bitreversal permutation of the input list. The bitreversal permutation swaps elements whose indices have binary representations that are the reverse of each other. U ..."
Abstract
 Add to MetaCart
A famous algorithm is the Fast Fourier Transform, or FFT. An ecient iterative version of the FFT algorithm performs as a rst step a bitreversal permutation of the input list. The bitreversal permutation swaps elements whose indices have binary representations that are the reverse of each other
Cacheoptimal methods for bitreversals
 Proceedings of Supercomputing’99
, 1999
"... Bitreversals are representative and important data reordering operations in many scientific computations. Performance degradation is mainly caused by cache conflict misses. Bitreversals are often repeatedly used as fundamental subroutines for many scientific programs. Thus, in order to gain the be ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Bitreversals are representative and important data reordering operations in many scientific computations. Performance degradation is mainly caused by cache conflict misses. Bitreversals are often repeatedly used as fundamental subroutines for many scientific programs. Thus, in order to gain
Notes on bitreversal broadcast scheduling
 CoRR
"... This report contains revision and extension of some results about RBO from [14]. RBO is a simple and efficient broadcast scheduling of n = 2k uniform frames for battery powered radio receivers. Each frame contains a key from some arbitrary linearly ordered universe. The broadcast cycle – a sequence ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of frames sorted by the keys and permuted by kbit reversal – is transmitted in a round robin fashion by the broadcaster. At arbitrary time during the transmission, the receiver may start a simple protocol that reports to him all the frames with the keys that are contained in a specified interval of the key
Memory Hierarchy Considerations for Fast Transpose and BitReversals
 In Proceedings of HPCS 5
, 1999
"... This paper explores the interplay between algorithm design and a computer's memory hierarchy. Matrix transpose and the bitreversal reordering are important scientific subroutines which often exhibit severe performance degradation due to cache and TLB associativity problems. We give lower bound ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This paper explores the interplay between algorithm design and a computer's memory hierarchy. Matrix transpose and the bitreversal reordering are important scientific subroutines which often exhibit severe performance degradation due to cache and TLB associativity problems. We give lower
Towards an Optimal BitReversal Permutation Program
 In Proceeding of IEEE Foundations of Computer Science
, 1998
"... The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hierarchies of modern computers. Array transpose and the bitreversal permutation  trivial operations on a RAM  present ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hierarchies of modern computers. Array transpose and the bitreversal permutation  trivial operations on a RAM  present
Fast BitReversals On Uniprocessors And SharedMemory Multiprocessors
 SIAM J. Sci. Comput
, 2001
"... In this paper, we examine different methods using techniques of blocking, buffering, and padding for efficient implementations of bitreversals. We evaluate the merits and limits of each technique and its application and architecturedependent conditions for developing cacheoptimal methods. Besides ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, we examine different methods using techniques of blocking, buffering, and padding for efficient implementations of bitreversals. We evaluate the merits and limits of each technique and its application and architecturedependent conditions for developing cacheoptimal methods
A Parallel Bit Reversal Algorithm and it's CILK Implementation
"... A wide variety of Fast Fourier Transform (FFT) algorithms employ a bit reversal method for the reordering of input or output data. This article shows one of the most frequently used algorithms for calculating the bit reversal permutation. It also presents a parallel implementation in CILK 5.2 and so ..."
Abstract
 Add to MetaCart
A wide variety of Fast Fourier Transform (FFT) algorithms employ a bit reversal method for the reordering of input or output data. This article shows one of the most frequently used algorithms for calculating the bit reversal permutation. It also presents a parallel implementation in CILK 5
Results 1  10
of
290,213