arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1206.3728cs.ITcs.DCcs.SYeess.SYmath.IT
收藏

基于LMS自适应网络的分布式估计性能极限

Performance Limits for Distributed Estimation Over LMS Adaptive Networks

University of California, Los Angeles(加利福尼亚大学洛杉矶分校)

Xiaochuan Zhao, Ali H. Sayed

AI总结:

本文分析LMS自适应网络中分布式估计的均方性能,证明通过优化组合权重,扩散策略可优于集中式块或增量LMS策略,并扩展到N节点网络。

摘要:

本文分析了基于最小均方(LMS)自适应网络的分布式估计不同策略的均方性能。结果突出了分布式自适应相对于基于融合的集中式解决方案的一些有用特性。分析表明,通过优化组合权重,扩散策略可以比采用传统块或增量LMS策略的集中式解决方案提供更低的超额均方误差。我们首先详细研究了涉及两个自适应代理组合的情况,然后将结果扩展到通用的N节点自组织网络。在后一种情况下,我们证明,对于足够小的步长,通过优化左随机组合权重矩阵,扩散策略可以优于集中式块或增量LMS策略。这些结果提出了在融合中心组织和处理数据的更有效方式,并提供了有用的自适应策略,当以分布式方式实现时能够增强性能。

英文摘要:

In this work we analyze the mean-square performance of different strategies for distributed estimation over least-mean-squares (LMS) adaptive networks. The results highlight some useful properties for distributed adaptation in comparison to fusion-based centralized solutions. The analysis establishes that, by optimizing over the combination weights, diffusion strategies can deliver lower excess-mean-square-error than centralized solutions employing traditional block or incremental LMS strategies. We first study in some detail the situation involving combinations of two adaptive agents and then extend the results to generic N-node ad-hoc networks. In the later case, we establish that, for sufficiently small step-sizes, diffusion strategies can outperform centralized block or incremental LMS strategies by optimizing over left-stochastic combination weighting matrices. The results suggest more efficient ways for organizing and processing data at fusion centers, and present useful adaptive strategies that are able to enhance performance when implemented in a distributed manner.

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

↑