Answers are grounded in this paper and cite their sources.
The Winograd Fourier Transform Algorithm (WFTA) requires about 20% of the multiplications used in an optimized FFT, while the number of additions remains unchanged. This paper describes one "General-N" (i.e. many allowable DFT sizes (N) but certainly not any vector size) complex WFTA programming technique.
No takes yet. Share an insight, caveat, or question.
H.F. Silverman (2005) studied this question.