Array Permutation by Index-Digit Permutation
- 1 April 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 23 (2) , 298-309
- https://doi.org/10.1145/321941.321949
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967
- A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storageIEEE Transactions on Audio and Electroacoustics, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965