Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
C.S. Burrus (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: