NORMALIZED DATA NONLINEARITIES FOR LMS ADAPTATION

Properly designed nonlinearly-modified LMS algorithms, in which various quantities in the stochastic gradient estimate are operated upon by memoryless nonlinearities, have been shown to perform better than the LMS algorithm in system identification-type problems. In this paper, we investigate one such algorithm given by W(k+1) = W(k) + mu(d(k) - W(k)(t)X(k))X(k)f(X(k)) in which the function f (X(k)) is a scalar function of the sum of the squares of the N elements of the input data vector X(k). This form of algorithm generalizes the so-called normalized LMS (NLMS) algorithm. We evaluate the expected behavior of this nonlinear algorithm for both independent input vectors and correlated Gaussian input vectors assuming the system identification model. By comparing the nonlinear algorithm's behavior with that of the LMS algorithm, we then provide a method of optimizing the form of the nonlinearity for the given input statistics. In the independent input case, we show that the optimum non-linearity is a single-parameter version of the NLMS algorithm with an additional constant in the denominator and show that this algorithm achieves a lower excess mean-square error (MSE) than the LMS algorithm with an equivalent convergence rate. Additionally, we examine the optimum step size sequence for the optimum nonlinear algorithm and show that the resulting algorithm performs better and is less complex to implement than the optimum step size algorithm derived for another form of the NLMS algorithm [1]. Simulations verify the theory and the predicted performance improvements of the optimum normalized data nonlinearity algorithm.