• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Function Computation Through a Bidirectional Relay
【24h】

Function Computation Through a Bidirectional Relay

机译：通过双向继电器进行功能计算

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider a function computation problem in a three-node wireless network. Nodes A and B observe two correlated sources X and Y, respectively, and want to compute a function f (X, Y). To achieve this, nodes A and B send messages to a relay node C at rates R-A and R-B, respectively. The relay C then broadcasts a message to A and B at rate R-C. We allow block coding and study the achievable region of rate triples under both zero-error and epsilon-error. As a preparation, we first consider a broadcast network from the relay to A and B. A and B have side information X and Y, respectively. The relay node C observes both X and Y and broadcasts an encoded message to A and B. We want to obtain the optimal broadcast rate such that A and B can recover the function f (X, Y) from the received message and their individual side information X and Y, respectively. For this problem, we show equivalence between epsilon-error and zero-error computations-this gives a rate characterization for zero-error computation. As a corollary, this also gives a rate characterization for the relay network under zero error for a class of functions called component-wise one-to-one functions when the support set of pXY is full. For the relay network, the zero-error rate region for arbitrary functions is characterized in terms of graph coloring of some suitably defined probabilistic graphs. We then give a single-letter inner bound to this rate region. Furthermore, we extend the graph theoretic ideas to address the epsilon-error problem and obtain a single-letter inner bound.
机译：我们考虑三节点无线网络中的功能计算问题。节点A和B分别观察两个相关的源X和Y，并希望计算函数f（X，Y）。为了实现这一点，节点A和B分别以速率R-A和R-B向中继节点C发送消息。然后，中继器C以速率R-C向A和B广播消息。我们允许进行块编码，并研究零误差和ε误差下三倍速率的可实现区域。作为准备，我们首先考虑从中继站到A和B的广播网络。A和B分别具有边信息X和Y。中继节点C观察X和Y并向A和B广播编码的消息。我们希望获得最佳广播速率，以使A和B可以从接收到的消息及其各自的侧面恢复函数f（X，Y）信息X和Y。对于这个问题，我们展示了ε误差和零误差计算之间的等价关系，这给出了零误差计算的速率表征。作为推论，对于pXY的支持集已满时，对于一类称为分量智能一对一函数的函数，该函数还提供了零误差下的中继网络速率表征。对于中继网络，根据某些适当定义的概率图的图色来表征任意函数的零错误率区域。然后，我们给出此速率区域的单字母内边界。此外，我们扩展了图论思想以解决ε误差问题并获得单字母内边界。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号