A robust variable step-size LMS-type algorithm: analysis andsimulations

  • Authors:
  • T. Aboulnasr;K. Mayyas

  • Affiliations:
  • Dept. of Electr. Eng., Ottawa Univ., Ont.;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 1997

Quantified Score

Hi-index 35.69

Visualization

Abstract

A number of time-varying step-size algorithms have been proposed to enhance the performance of the conventional LMS algorithm. Experimentation with these algorithms indicates that their performance is highly sensitive to the noise disturbance. This paper presents a robust variable step-size LMS-type algorithm providing fast convergence at early stages of adaptation while ensuring small final misadjustment. The performance of the algorithm is not affected by existing uncorrelated noise disturbances. An approximate analysis of convergence and steady-state performance for zero-mean stationary Gaussian inputs and for nonstationary optimal weight vector is provided. Simulation results comparing the proposed algorithm to current variable step-size algorithms clearly indicate its superior performance for cases of stationary environments. For nonstationary environments, our algorithm performs as well as other variable step-size algorithms in providing performance equivalent to that of the regular LMS algorithm