.png){kind=icon}
返回
Robust Diffusion Affine Projection Algorithm With Variable Step-Size Over Distributed Networks
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2947636.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The estimation performance of the standard diffusion affine projection algorithm may be degraded when the distributed network nodes are disturbed by impulsive noise. To overcome the limitation, a diffusion affine projection M-estimate (DAPM) algorithm is proposed for distributed estimation in the adaptive diffusion networks. This algorithm uses a robust cost function based on M-estimate function to eliminate the adverse effects of impulsive noise on distributed diffusion network nodes. In order to further enhance the performance of the DAPM algorithm, namely fast convergence rate and low steady-state error, a variable step-size diffusion affine projection M-estimate (VSS-DAPM) algorithm is presented. In addition, the convergence range of the step-size is deduced to ensure the convergence of the proposed algorithms. Computer simulations show that the proposed DAPM and VSS-DAPM algorithms have good convergence performance for distributed estimation in the adaptive diffusion networks. More importantly, the proposed VSS-DAPM algorithm improves convergence rate and the network mean square deviation (MSD) as compared to the DAPM algorithm in the distributed estimation.
Keyword:
Estimation
Convergence
Adaptive systems
Cost function
Projection algorithms
Standards
Steady-state
Affine projection algorithm
impulsive noise
M-estimate
variable step-size
distributed estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Diffusion Leaky Zero Attracting Least Mean Square Algorithm and Its Performance Analysis.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏A Dual Role for KRT81: A miR-SNP Associated with Recurrence in Non-Small-Cell Lung Cancer and a Novel Marker of Squamous Cell Lung CarcinomaPLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容