同位网络中多轮函数计算的信息论界
Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks
摘要:
在多端块信源编码理论的框架下,研究了同位网络中函数计算的通信效率极限。为了计算在汇点处的源的期望函数,节点通过一系列无错误的、网络范围的有限速率消息的广播来彼此交互。对于任何功能的独立来源,我们得出一个可计算的表征的一组所有可行的消息编码率-率区域-在单字母的信息措施。我们表明,当计算对称函数的二进制源,汇将不可避免地学习某些额外的信息,这是不需要在计算功能。这种概念上的理解导致新的改进的最小和率的界限。新的界限被证明是有序优于那些基于割集的网络规模。研究了不同对称函数和源参数下最小和率的缩放定律。
英文摘要:
We study the limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired function of sources at a sink, nodes interact with each other through a sequence of error-free, network-wide broadcasts of finite-rate messages. For any function of independent sources, we derive a computable characterization of the set of all feasible message coding rates - the rate region - in terms of single-letter information measures. We show that when computing symmetric functions of binary sources, the sink will inevitably learn certain additional information which is not demanded in computing the function. This conceptual understanding leads to new improved bounds for the minimum sum-rate. The new bounds are shown to be orderwise better than those based on cut-sets as the network scales. The scaling law of the minimum sum-rate is explored for different classes of symmetric functions and source parameters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。