Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

An individual variable step LMS adaptive algorithm

Authors: Chen, Junliang; Tang, Yunan;

An individual variable step LMS adaptive algorithm

Abstract

Summary: An individual variable step LMS adaptive algorithm which varies its step size adaptively to the correlation between the input signal and prediction error is proposed. A physical explanation of the step size is presented. The condition of convergence, a matrix difference equation for the second moment of the weight and the misadjustment of the IVLMS algorithm are derived. The noise power of the adaptive weights and the tracking capability of the new algorithm are evidently superior to the conventional LMS algorithm both in stationary and nonstationary inputs. It is shown that the concept of individual variable step size is also available to the normalized LMS and block LMS adaptive algorithms.

Keywords

LMS adaptive algorithm, Adaptive control/observation systems, individual variable step matrix, weight noise power

Powered by OpenAIRE graph
Found an issue? Give us feedback