An inequality by which to adjust the LMS algorithm step-size (Q2726598)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An inequality by which to adjust the LMS algorithm step-size |
scientific article; zbMATH DE number 1621170
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inequality by which to adjust the LMS algorithm step-size |
scientific article; zbMATH DE number 1621170 |
Statements
An inequality by which to adjust the LMS algorithm step-size (English)
0 references
29 January 2002
0 references
least mean square algorithm
0 references
parameter estimation
0 references
step size adjustment
0 references
automatic step size adjustment
0 references
convergence rate
0 references
steady-state parameter estimation errors
0 references
The authors deal with the Least Mean Square algorithm, a standard method to track slowly varying parameters of a signal system. The paper describes an algorithm for automatic step size adjustment to both improve the convergence rate and reduce steady-state parameter estimation errors of this method. Based on the mean square values of the output estimation errors, a set of inequalities are defined, which provides information on the transient or steady-state operation of the Least Mean Square algorithm. A modified Least Mean Square algorithm, which uses these inequalities to control the step size is given in the paper. A simulation example demonstrates the performance of the method, i.e., faster convergence and smaller steady-state mean square errors in comparison with the fixed step size Least Mean Square algorithm.
0 references
0.8067339658737183
0 references
0.8029004335403442
0 references
0.786802351474762
0 references