Distributed Function Computation Over a Rooted Directed Tree
Distributed Function Computation Over a Rooted Directed Tree
复制标题
有根有向树上的分布式函数计算
DOI：
10.1109/tit.2016.2530398
复制
发表时间：
2013
影响因子：
2.5
通讯作者：
A. Tchamkerten
中科院分区：
文献类型：
--
作者：
Milad Sefidgaran;A. Tchamkerten
本文确定了一类信源编码函数计算设置的容量区域，在这种设置中，信息源在一棵树的节点处可用，并且这些信源的一个函数必须在树的根节点处被计算。只要信源的联合分布满足某个马尔可夫准则，该容量区域对任何函数都成立。特别是当信源相互独立时，这个准则是满足的。这一结果涵盖了几种函数计算设置的容量区域。其中包括具有任意信源的点对点通信设置、具有条件独立信源的无噪多址网络以及具有马尔可夫信源的级联网络。
This paper establishes the capacity region for a class of source coding function computation setups, where sources of information are available at the nodes of a tree and where a function of these sources must be computed at its root. The capacity region holds for any function as long as the sources' joint distribution satisfies a certain Markov criterion. This criterion is met, in particular, when the sources are independent. This result recovers the capacity regions of several function computation setups. These include the point-to-point communication setting with arbitrary sources, the noiseless multiple access network with conditionally independent sources, and the cascade network with Markovian sources.