作者: Alan H. Karp
DOI: 10.1137/1038001
关键词: Reversing 、 Bit (horse) 、 Computer data storage 、 Hierarchical control system 、 Parallel computing 、 Fast Fourier transform 、 Algorithm 、 Computer science 、 Vector processor 、 Array data structure 、 Fortran 、 Theoretical computer science 、 Applied mathematics 、 Computational mathematics
摘要: Many versions of the fast Fourier transform require a reordering either input or output data that corresponds to reversing order bits in array index. There has been surprisingly large number papers on this subject recent literature.This paper collects 30 methods for bit an array. Each method was recoded into uniform style Fortran and its performance measured several different machines, each with memory system. This includes description how memories machines operate motivate two new algorithms perform substantially better than others.