arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.4134cs.ITmath.IT
收藏

分布式有损平均

Distributed Lossy Averaging

Han-I Su, Abbas El Gamal

摘要:

提出了一种以前在计算机科学和控制中研究的分布平均问题的信息论公式。我们假设一个网络有m个节点,每个节点观察一个WGN源。这些节点进行通信并执行本地处理,目标是计算源的平均值,使其在规定的均方误差失真内。建立了具有相关高斯源的2节点网络的率失真函数R^*(D)。建立了R^*(D)的一般割集下界,并证明通过星型网络上的集中式协议,R ^*(D)的一般割集下界可达到2倍以内。分布式加权和协议的网络率失真函数,这是更大的,为了比割集的一个因子的log m的约束的下限建立。建立了基于流言的加权和协议的网络速率失真函数的上界,该上界仅比完全图网络的下界大log log m。结果表明,使用分布式协议的结果在一个因素的log m增加,以相对于集中式协议。

英文摘要:

An information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We assume a network with m nodes each observing a WGN source. The nodes communicate and perform local processing with the goal of computing the average of the sources to within a prescribed mean squared error distortion. The network rate distortion function R^*(D) for a 2-node network with correlated Gaussian sources is established. A general cutset lower bound on R^*(D) is established and shown to be achievable to within a factor of 2 via a centralized protocol over a star network. A lower bound on the network rate distortion function for distributed weighted-sum protocols, which is larger in order than the cutset bound by a factor of log m is established. An upper bound on the network rate distortion function for gossip-base weighted-sum protocols, which is only log log m larger in order than the lower bound for a complete graph network, is established. The results suggest that using distributed protocols results in a factor of log m increase in order relative to centralized protocols.

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

↑