• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Channel Simulation via Interactive Communications
【24h】

Channel Simulation via Interactive Communications

机译：通过交互式通信进行频道模拟

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

摘要

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe independent identically distributed (i.i.d.) copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and Anantharam to study the general problem of channel simulation via interactive communication stated above. However, only inner and outer bounds for the special case of no shared randomness were obtained in their work. In this paper, we settle this problem by providing an exact computable characterization of the multiround problem. To show this we employ the technique of output statistics of random binning that has been recently developed by the authors.
机译：在本文中，我们研究了在两终端网络中通过交互式通信进行信道仿真的问题，称为协调能力。我们假设两个终端观察到两个随机变量的独立均匀分布（i.i.d.）副本，并希望生成i.i.d.与观察到的随机变量共同分布的其他两个随机变量的副本。终端具有双向通信链路，并且具有共享的公共随机性，所有这些都以有限的速率进行。这个问题的两个特殊情况是Ma和Ishwar研究的交互函数计算，以及Cuff研究了单向通信和共享随机性之间的折衷曲线。后者的工作启发了Gohari和Anantharam通过上述互动交流研究频道模拟的一般问题。但是，在他们的工作中，只获得了没有共享随机性的特殊情况的内边界和外边界。在本文中，我们通过提供多轮问题的精确可计算特征来解决该问题。为了说明这一点，我们采用了作者最近开发的随机装箱输出统计技术。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号