Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms
Matteo Frigo, Steven G. Johnson · IEEE Transactions on Signal Processing · 2007
The paper "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms" (in IEEE Transactions on Signal Processing, vol. 48, no. 1, pp. 172-183, January 2000) presents a novel "paired transform" fast Fourier transform (FFT) algorithm that is claimed to require fewer total real additions and multiplications than previous algorithms. We show this claim to be false: although the algorithm correctly computes the discrete Fourier transform, an accurate count shows that it requires more real-arithmetic operations than pre-existing FFTs