Array Permutation by Index-Digit Permutation

An array may be reordered according to a common permutation of the digits of each of its element indices. The digit-reversed reordering which results from common fast Fourier transform (FFT) algorithms is an example. By examination of this class of permutation in detail, very efficient algorithms for transforming very long arrays are developed.

[1]  Alan R. Jones,et al.  Fast Fourier Transform , 1970, SIGP.

[2]  Donald Fraser,et al.  Incrementing a Bit-Reversed Integer , 1969, IEEE Transactions on Computers.

[3]  FraserDonald.  Array Permutation by Index-Digit Permutation , 1976 .

[4]  R. Singleton,et al.  A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage , 1967, IEEE Transactions on Audio and Electroacoustics.

[5]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[6]  Peter D. Welch,et al.  Fast Fourier Transform , 2011, Starting Digital Signal Processing in Telecommunication Engineering.