Title :
A comment on the computational complexity of sliding FFT
Author :
Farhang-Boroujeny, B. ; Lim, Y.C.
Author_Institution :
Dept. of Electr. Eng., Nat. Univ. of Singapore, Singapore
fDate :
12/1/1992 12:00:00 AM
Abstract :
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) log2 N complex multiplication per sample reported in a book by L.R. Rabiner and B. Gold (1975)
Keywords :
computational complexity; fast Fourier transforms; computational complexity; fast Fourier transform; sliding FFT; Circuits; Computational complexity; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Finite impulse response filter; Frequency; Poles and zeros; Sampling methods; State feedback;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
