Answers are grounded in this paper and cite their sources.
A new method of deriving very fast Fourier transform (FFT) algorithms is described. The resulting algorithms do not employ multiplication and have a form suitable for high performance hardware implementations. The complexity of the algorithms compares favorably to the recent results of Winograd [1].
No takes yet. Share an insight, caveat, or question.
Despain (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: