Optimum error nonlinearities for LMS adaptation
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 1421-1424
- https://doi.org/10.1109/icassp.1990.115658
Abstract
An examination is made of the effect of a memoryless nonlinearity acting upon the error in LMS (least-mean-square) adaptation. Results for E(e/sup 2K/) minimization are extended to general nonlinear error adaptation, and equations expressing bounds on step size, time constants, and misadjustment are derived. A general performance factor expressing the improvement in misadjustment over standard LMS adaptation for a given convergence rate is presented. Using the calculus of variations, it is shown that the optimum nonlinearity to minimize misadjustment is -p'(x)/p(x), where p(x) is the probability density function of the uncorrelated plant noise. Comparisons of this result with the Cramer-Rao bound indicate that choice of this nonlinearity yields an asymptotically optimal stochastic gradient algorithm. Simulations verify the result that the optimum nonlinearity for minimizing misadjustment for Laplacian plant noise is sgn(x), and a 3-dB improvement is obtained under these conditions.Keywords
This publication has 5 references indexed in Scilit:
- MVSE adaptive filtering subject to a constraint on MSEIEEE Transactions on Circuits and Systems, 1988
- On error-saturation nonlinearities in LMS adaptationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- Improved convergence analysis of stochastic gradient adaptive filters using the sign algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- The least mean fourth (LMF) adaptive algorithm and its familyIEEE Transactions on Information Theory, 1984
- Adaptive filter performance with nonlinearities in the correlation multiplierIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982