Resumen
A sliding-window variable-regularization recursive-least-squares algorithm is derived, and its convergence properties, computational complexity, and numerical stability are analyzed. The algorithm operates on a finite data window and allows for time-varying regularization in the weighting and the difference between estimates. Numerical examples are provided to compare the performance of this technique with the least mean squares and affine projection algorithms.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 715-735 |
| Número de páginas | 21 |
| Publicación | International Journal of Adaptive Control and Signal Processing |
| Volumen | 30 |
| N.º | 5 |
| DOI | |
| Estado | Published - may 1 2016 |
Nota bibliográfica
Publisher Copyright:© Copyright 2015 John Wiley & Sons, Ltd.
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Electrical and Electronic Engineering
Huella
Profundice en los temas de investigación de 'On the stability and convergence of a sliding-window variable-regularization recursive-least-squares algorithm'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver