Abstract
In this work, the convergence analysis of the variable weight mixed-norm least-mean squares (LMS)-least mean-fourth (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 to allow the algorithm to keep track of the variations in the environment. As a by-product of this novel approach, new necessary and sufficient conditions for the LMF algorithm have been derived. Furthermore, a more general expression for the excess steady-state error for the LMF algorithm has been derived.
| Original language | English |
|---|---|
| Pages (from-to) | 547-566 |
| Number of pages | 20 |
| Journal | Circuits, Systems, and Signal Processing |
| Volume | 21 |
| Issue number | 6 |
| DOIs | |
| State | Published - 2002 |
Keywords
- Adaptive algorithms
- LMS and LMF algorithms
- Mixed-norm algorithms
ASJC Scopus subject areas
- Signal Processing
- Applied Mathematics