Heidi Haynal

Learn More
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(More)
  • 1