.png){kind=icon}
.png){kind=icon}
Return
Diversity-based diffusion robust RLS using adaptive forgetting factor
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2020.107950.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, we propose a diffusion robust recursive least squares (D-(RLS)-L-2) algorithm over adaptive networks. Instead of conventional mean square error cost function, the suggested method is derived from the maximum correntropy criterion (MCC) cost function, being more suitable for non-Gaussian noise. Furthermore, to improve tracking ability when encountering sudden changes in unknown systems in nonstationary environments, a diversity-based extension of D-(RLS)-L-2 is developed by adaptive forgetting factor for each node. Also, to conduct performance analysis, we employ a half-quadratic optimization to approximate our model iteratively by a quadratic problem. The mean, mean-square convergence and stability of the D-(RLS)-L-2 are discussed theoretically. The simulation results show that the proposed methods outperform the other robust algorithms and enhance tracking quality in the presence of non-Gaussian noise in the stationary and non-stationary environments. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Diffusion robust recursive least squares
Half-quadratic optimization
Diversity
Adaptive forgetting factor
Performance analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.