Projection methods for improved performance in FIR adaptive filters

The normalized LMS algorithms offer low-computational complexity and inexpensive implementations for FIR adaptive filters. However, convergence rate decreases as the eigenvalue ratio (condition number) of the input autocorrelation matrix increases. Recursive least squares methods offer significant convergence rate improvement but at the expense of increased computational complexity. In this paper, we present a class of algorithms, collectively called Projection Methods, which offers flexibility in the tradeoff between computational complexity and convergence rate improvement. These methods are related to traditional normalized data reusing algorithms described by Schnaufer and Jenkins (1993). Utilizing conjugate gradient and Tchebyshev methods, algorithms are developed which accelerate the convergence behavior of traditional normalized data reusing algorithms while maintaining excellent tracking performance