On the stability and convergence of a sliding-window variable-regularization recursive-least-squares algorithm

摘要

A sliding-window variable-regularization recursive-least-squares algorithm is derived, and its convergence properties, computational complexity, and numerical stability are analyzed. The algorithm operates on a finite data window and allows for time-varying regularization in the weighting and the difference between estimates. Numerical examples are provided to compare the performance of this technique with the least mean squares and affine projection algorithms. Copyright (c) 2015 John Wiley & Sons, Ltd.