返回
Diversity-based diffusion robust RLS using adaptive forgetting factor
DOI:10.1016/j.sigpro.2020.107950.png)
摘要
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.
Keyword:
Diffusion robust recursive least squares
Half-quadratic optimization
Diversity
Adaptive forgetting factor
Performance analysis
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
SIGNAL-PROCESSING WITH FRACTIONAL LOWER ORDER MOMENTS - STABLE PROCESSES AND THEIR APPLICATIONS
PROCEEDINGS OF THE IEEE
IF25.9
Diffusion sign-error LMS algorithm: Formulation and stochastic behavior analysis
SIGNAL PROCESSING
IF3.6

