On the Performance of Variable Forgetting Factor Recursive Least-Squares Algorithms

被引:0
|
作者
Elisei-Iliescu, Camelia [1 ]
Paleologu, Constantin [1 ]
Tamas, Razvan [2 ]
机构
[1] Univ Politehn Bucuresti, Bucharest, Romania
[2] Maritime Univ Constanta, Constanta, Romania
关键词
adaptive filters; recursive least-squares (RLS) algorithm; variable forgetting factor; echo cancellation;
D O I
10.1117/12.2242960
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页数:7
相关论文
共 50 条