Abstract

This paper presents a modified version of the two-step least-mean-square (LMS)-type adaptive algorithm motivated by the work of Gazor. We describe the nonstationary adaptation characteristics of this modified two-step LMS (MG-LMS) algorithm for the system identification problem. It ensures stable behavior during convergence as well as improved tracking performance in the smoothly time-varying environments. The estimated weight increment vector is used for the prediction of weight vector for the next iteration. The proposed modification includes the use of a control parameter to scale the estimated weight increment vector in addition to a smoothing parameter used in the two-step LMS (G-LMS) algorithm, which controls the initial oscillatory behavior of the algorithm. The analysis focuses on the effects of these parameters on the lag-misadjustment in the tracking process. The mathematical analysis for a nonstationary case, where the plant coefficients are assumed to follow a first-order Markov process, shows that the MG-LMS algorithm contributes less lag-misadjustment than the conventional LMS and G-LMS algorithms. Further, the stability criterion imposes upper bound on the value of the control parameter. These derived analytical results are verified and demonstrated with simulation examples, which clearly show that the lag-misadjustment reduces with increasing values of the smoothing and control parameters under permissible limits

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.