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

同位网络中的无限消息交互函数计算

Infinite-message Interactive Function Computation in Collocated Networks

Nan Ma, Prakash Ishwar

摘要:

在分布式分组信源编码框架下研究了同位网络中交互函数的计算问题。源节点通过一系列无错广播来交换消息,目标是在接收端计算所需的函数。无限信息最小和率被看作是联合源pmf的泛函,并被刻画为具有一定凸几何性质的偏序泛函族中的最小元素。这种特性导致一个家庭的下限无限消息最小和率和一个简单的最优性测试任何可实现的无限消息和率。提出了一种求无限信息最小和率泛函的迭代算法,并通过计算三个信源的最小函数的例子进行了说明。

英文摘要:

An interactive function computation problem in a collocated network is studied in a distributed block source coding framework. With the goal of computing a desired function at the sink, the source nodes exchange messages through a sequence of error-free broadcasts. The infinite-message minimum sum-rate is viewed as a functional of the joint source pmf and is characterized as the least element in a partially ordered family of functionals having certain convex-geometric properties. This characterization leads to a family of lower bounds for the infinite-message minimum sum-rate and a simple optimality test for any achievable infinite-message sum-rate. An iterative algorithm for evaluating the infinite-message minimum sum-rate functional is proposed and is demonstrated through an example of computing the minimum function of three sources.

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

↑