The gradient adaptive step-size least-mean-square (LMS) algorithms [an impo
rtant family of variable step-size LMS (VSLMS) algorithms] are revisited, W
e propose a simplification to a class of the studied algorithms and show th
at this leads to a new class of VSLMS algorithms,vith reduced complexity bu
t with no observable loss in performance.