Analysis of LMS-Newton adaptive filtering algorithms with variable convergence factor

An analysis of two LMS-Newton adaptive filtering algorithms with variable convergence factor is presented. The relations of these algorithms with the conventional recursive least-squares algorithm are first addressed. Their performance in stationary and nonstationary environments is then studied and closed-form formulas for the excess mean-square error (MSE) are derived. The paper deals, in addition, with the effects of roundoff errors for the case of fixed-point arithmetic. Specifically, closed-form formulas for the excess MSE caused by quantization are obtained. The paper concludes with experimental results that demonstrate the validity of the analysis presented.>