Answers are grounded in this paper and cite their sources.
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT). For 35 years the split-radix algorithm held the record by requiring just 4n log 2 n -6n + 8 arithmetic operations on real numbers for a size-n DFT, and was widely believed to be the best possible. Recent work by Van Buskirk and Lundy demonstrated improvements to the split-radix operation count by using multiplier coefficients or "twiddle factors" that are not n th roots of unity for a size-n DFT.
No takes yet. Share an insight, caveat, or question.
Haynal et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: