14 December 2016 On the performance of variable forgetting factor recursive least-squares algorithms
Author Affiliations +
Proceedings Volume 10010, Advanced Topics in Optoelectronics, Microelectronics, and Nanotechnologies VIII; 1001023 (2016) https://doi.org/10.1117/12.2242960
Event: Advanced Topics in Optoelectronics, Microelectronics, and Nanotechnologies 2016, 2016, Constanta, Romania
Abstract
The recursive least-squares (RLS) is a very popular adaptive algorithm, which is widely used in many system identification problems. The parameter that crucially influences the performance of the RLS algorithm is the forgetting factor. The value of this parameter leads to a compromise between tracking, misadjustment, and stability. In this paper, we present some insights on the performance of variable forgetting factor RLS (VFF-RLS) algorithms, in the context of system identification. Besides the classical RLS algorithm, we mainly focus on two recently proposed VFF-RLS algorithms. The novelty of the experimental setup is that we use real-world signals provided by Romanian Air Traffic Services Administration, i.e., voice and noise signals corresponding to real communication channels. In this context, the Air Traffic Control (ATC) communication represents a challenging task, usually involving non-stationary environments and stability issues.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Camelia Elisei-Iliescu, Constantin Paleologu, Răzvan Tamaş, "On the performance of variable forgetting factor recursive least-squares algorithms", Proc. SPIE 10010, Advanced Topics in Optoelectronics, Microelectronics, and Nanotechnologies VIII, 1001023 (14 December 2016); doi: 10.1117/12.2242960; https://doi.org/10.1117/12.2242960
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT


Back to Top