Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
Steven G. Johnson, Matteo Frigo · IEEE Transactions on Signal Processing · 2006
The paper "Method of Flow Graph Simplification for the 16-Point Discrete Fourier Transform" by Grigoryan and Bhamidipati presents a "paired transform" fast Fourier transform (FFT) algorithm that is claimed to perform the size-8 and size-16 complex-data discrete Fourier transform (DFT) with 44 and 140 arithmetic operations, respectively. If true, this count would be less than the 56 and 168 operations achieved in the best pre-existing (split-radix) methods. Grigoryan and Bhamidipati's count of real additions is erroneous, however, and this comment shows that their algorithm actually has arithmetic complexity identical to that of standard split-radix algorithms.