摘要

The performances of adaptive filtering algorithms are critically controlled by specific tunable parameters. The convergence rate of the normalized least mean squares (NLMS) algorithm may be accelerated by adjusting the step size parameter. The tracking speed of the recursive least squares (RLS) algorithm may be improved by using the forgetting factor, which has not yet been appropriately introduced into the NLMS algorithm. This work aims to successfully introduce the forgetting factor into the NLMS algorithm using an tic, theoretical framework developed to create a unified view of adaptive algorithms for recursively identifying the finite impulse response (FIR) filter coefficients. The performances of the forgetting factor NLMS (FFNLMS) algorithm developed here, in the context of several adaptive filtering applications, are evaluated using computer simulations.

  • 出版日期2015-9