arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.05144cs.ITeess.SPmath.IT
收藏

带噪声链路网络上的最大总相关熵扩散自适应

Maximum Total Correntropy Diffusion Adaptation over Networks with Noisy Links

Yicong He, Fei Wang, Shiyuan Wang, Pengju Ren, Badong Chen

摘要:

网络上的分布式估计是近年来研究的热点。在许多情况下,由于节点之间的信息通信不完善,传统的扩散自适应算法,如扩散LMS(DLMS)的性能可能会下降。为了解决这个问题,已经提出了几种改进的DLMS算法。然而,这些基于DLMS的算法仍然遭受有偏估计,并且对脉冲链路噪声不鲁棒。在本文中,我们专注于提高性能的扩散自适应噪声链路从两个方面:准确性和鲁棒性。提出了一种新的算法--扩散最大总相关熵(DMTC)算法.新算法在高斯噪声中具有理论上的无偏性,并且能够有效地处理存在较大离群值的链路噪声。自适应组合规则的应用,以进一步提高性能。给出了算法的稳定性分析。仿真结果表明,DMTC算法在高斯和非高斯噪声环境下都能取得良好的性能。

英文摘要:

Distributed estimation over networks draws much attraction in recent years. In many situations, due to imperfect information communication among nodes, the performance of traditional diffusion adaptive algorithms such as the diffusion LMS (DLMS) may degrade. To deal with this problem, several modified DLMS algorithms have been proposed. However, these DLMS based algorithms still suffer from biased estimation and are not robust to impulsive link noise. In this paper, we focus on improving the performance of diffusion adaptation with noisy links from two aspects: accuracy and robustness. A new algorithm called diffusion maximum total correntropy (DMTC) is proposed. The new algorithm is theoretically unbiased in Gaussian noise, and can efficiently handle the link noises in the presence of large outliers. The adaptive combination rule is applied to further improve the performance. The stability analysis of the proposed algorithm is given. Simulation results show that the DMTC algorithm can achieve good performance in both Gaussian and non-Gaussian noise environments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑