Answers are grounded in this paper and cite their sources.
An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced. The algorithm yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fourier transform, allows 100 percent utilization of the arithmetic unit, and yields properly ordered Fourier coefficients without the need for pre- or postordering of data.
No takes yet. Share an insight, caveat, or question.
M.J. Corinthios (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: