A state space approach for efficient implementation of block LMS adaptive filters

An efficient state space method for implementing the fast Fourier transform over rectangular windows is proposed for the cases when there is a large overlap between the consecutive input signals. This is called the generalized sliding FFT (GSFFT). To minimize the computational complexity of the GSFFT. The intermediate result of the FFT structure which can be used in the next iterations are preserved. The complexity of this method is compared with that of standard FFT. The GSFFT is then used to propose an efficient implementation of the frequency domain block least mean square adaptive (FBLMS) filters, which are known to be efficient when filter length is large.<>