On the performance of the variable-regularized recursive least-squares algorithms

Camelia Elisei-Iliescu; Constantin Paleologu; Răzvan Tamaş

doi:10.1117/12.2323462

31 December 2018 On the performance of the variable-regularized recursive least-squares algorithms

Camelia Elisei-Iliescu, Constantin Paleologu, Răzvan Tamaş

Author Affiliations +

Proceedings Volume 10977, Advanced Topics in Optoelectronics, Microelectronics, and Nanotechnologies IX; 109771W (2018) https://doi.org/10.1117/12.2323462
Event: Advanced Topics in Optoelectronics, Microelectronics and Nanotechnologies IX, 2018, Constanta, Romania

Abstract

The recursive least-squares (RLS) is a very popular adaptive algorithm, which is widely used in many system identification problems. The performance of the algorithm is controlled by two important parameters, i.e., the forgetting factor and the regularization parameter. The forgetting factor controls the “memory” of the algorithm and its value leads to a compromise between low misadjustment and fast convergence. The regularization term is required in most adaptive algorithms and its role becomes very critical in the presence of additive noise. In this paper, we present the regularized RLS algorithm and we develop a method to find its regularization parameter, which is related to the signal-to-noise ratio (SNR). Also, using a proper estimation of the SNR, we present a variable-regularized RLS (VR-RLS) algorithm.

Citation Download Citation

Camelia Elisei-Iliescu, Constantin Paleologu, and Răzvan Tamaş "On the performance of the variable-regularized recursive least-squares algorithms", Proc. SPIE 10977, Advanced Topics in Optoelectronics, Microelectronics, and Nanotechnologies IX, 109771W (31 December 2018); https://doi.org/10.1117/12.2323462

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE