On a class of computationally efficient, rapidly converging, generalized NLMS algorithms

Abstract

Over the last decade, a certain computationally efficient, rapidly converging adaptive filtering algorithm has been independently discovered many times. The algorithm can be viewed as a generalization of the normalized LMS (NLMS) algorithm that updates on the basis of multiple input signal vectors. This article compares and discusses the different approaches to and embellishments of the basic algorithm, and contrasts the various interpretations from different perspectives.