Index mappings for multidimensional formulation of the DFT and convolution

The mapping of one-dimensional arrays into two- or higher dimensional arrays is the basis of the fast Fourier transform (FFT) algorithms and certain fast convolution schemes. This paper gives the general conditions for these mappings to be unique and cyclic, and then considers the application to discrete Fourier transform (DFT) and convolution evaluation.