Improved normalized least mean square algorithm using past weight vectors and regularization parameter

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we derive an improved minimization criterion for normalized least mean squares (NLMS) algorithm using past weight vectors and the regularization parameter. The proposed minimization criterion minimizes the mean square deviation (MSD) of currently updated weight vector and past weight vector. The result of the proposed NLMS algorithm approaches the conventional NLMS algorithm as the regularization parameter reduces to zero. The result also shows that as the regularization parameter decreases the convergence rate increases. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Sawale, M. D., & Yadav, R. N. (2011). Improved normalized least mean square algorithm using past weight vectors and regularization parameter. In Communications in Computer and Information Science (Vol. 250 CCIS, pp. 382–387). https://doi.org/10.1007/978-3-642-25734-6_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free