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 rearrange data in the increasingly complicated memory hierarchies of modern computers. Array transpose and the bit-reversal permutation

• Type: Conference
• Year: 1998
• Where: FOCS
• Authors: Larry Carter, Kang Su Gatlin
• Keywords: Fast Fourier Transform, FOCS 1998, Memory Hierarchies, Present Non-trivial Problems, Theoretical Computer Science