Abstract
The class of least mean square (LMS) algorithms employing a general error nonlinearity is considered. A linearization approach is used to characterize the convergence and performance of this class of algorithms for an independent and identically distributed (iid) input. The analysis results are entirely consistent with those of the LMS algorithm and several of its variants. The results also encompass those of a recent work that considered the same class of algorithms for arbitrary and Gaussian inputs.
Original language | English (US) |
---|---|
Pages (from-to) | 556-559 |
Number of pages | 4 |
Journal | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
Volume | 1 |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 32nd Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) - Pacific Grove, CA, USA Duration: Nov 1 1998 → Nov 4 1998 |
ASJC Scopus subject areas
- Signal Processing
- Computer Networks and Communications