Answers are grounded in this paper and cite their sources.
One-dimensional and two-dimensional generalized discrete Fourier transforms (GFT) are introduced. If a one-dimensional vector A is fractured into a two-dimensional matrix B, a one-dimensional GFT on A and a two-dimensional GFT on B give the same result and require the same number of operations to be computed. The result holds also for the DFT, as it is a particular case of the GFT.
No takes yet. Share an insight, caveat, or question.
Bongiovanni et al. (1976) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: