A comment on the computational complexity of sliding FFT
Behrouz Farhang‐Boroujeny, Yong Ching Lim · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1992
The sliding fast Fourier transform (FFT) is reviewed and is shown to have the computational complexity of N complex multiplications per sample, as opposed to the well-cited assumption of (N/2) log/sub 2/ N complex multiplication per sample reported in a book by L.R. Rabiner and B. Gold (1975).>