摘要

In this paper, we discuss in details the four cost functions related to the least squares (LS), weighted LS (or forgetting factor LS), finite-data window LS and forgetting factor finite-data window LS algorithms, and further propose a new least squares algorithm with a forgetting factor over a finite-data window, derive its recursive version, and also give its simplified form. We illustrate the advantages of the algorithm with simulation examples.