arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.5845cs.DCcs.LGcs.SYeess.SYmath.OC
收藏

减少通信扩散自适应最小均方算法分析

Analysis of a Reduced-Communication Diffusion LMS Algorithm

University of South Australia(南澳大学);Aalto University(阿尔托大学);University of Notre Dame(圣母大学)

Reza Arablouei, Stefan Werner, Kutluyıl Doğançay, Yih-Fang Huang

AI总结:

本文分析了减少通信扩散自适应最小均方算法,探讨其在估计性能与通信成本之间的权衡,证明了算法在均值和均方意义下的稳定性和收敛性,并计算了稳态均方偏差。

摘要:

在基于扩散的自适应分布式估计算法中,每个节点通过创建中间估计并结合其闭邻域内的中间估计来估计目标参数向量。我们分析了允许每个节点在每次迭代中仅接收其邻居部分中间估计的减少通信扩散最小均方(RC-DLMS)算法的性能。该算法减轻了网络通信资源的使用,并在估计性能和通信成本之间提供折中。我们证明了RC-DLMS算法在均值和均方意义上都是稳定和收敛的。我们还计算了其理论稳态均方偏差。仿真结果展示了理论与实验之间的良好匹配。

英文摘要:

In diffusion-based algorithms for adaptive distributed estimation, each node of an adaptive network estimates a target parameter vector by creating an intermediate estimate and then combining the intermediate estimates available within its closed neighborhood. We analyze the performance of a reduced-communication diffusion least mean-square (RC-DLMS) algorithm, which allows each node to receive the intermediate estimates of only a subset of its neighbors at each iteration. This algorithm eases the usage of network communication resources and delivers a trade-off between estimation performance and communication cost. We show analytically that the RC-DLMS algorithm is stable and convergent in both mean and mean-square senses. We also calculate its theoretical steady-state mean-square deviation. Simulation results demonstrate a good match between theory and experiment.

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

↑