Abstract
In this work, the convergence analysis of the variable weight mixed-norm LMS-LMF adaptive algorithm is derived. The proposed algorithm minimizes an objective function defined as a weighted sum of the LMS and LMF cost functions where the weighting factor is time varying and adapts itself so as to allow the algorithm to keep track of the variations in the environment. Sufficient and necessary conditions for the convergence of the algorithm are derived. Furthermore, bounds on the step size to ensure convergence of the LMF algorithm are also derived.
| Original language | English |
|---|---|
| Pages (from-to) | 279-282 |
| Number of pages | 4 |
| Journal | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
| Volume | 1 |
| DOIs | |
| State | Published - 2000 |
ASJC Scopus subject areas
- Signal Processing
- Computer Networks and Communications