...
首页> 外文期刊>IEEE Transactions on Information Theory >Cooperative Multiple-Access Encoding With States Available at One Transmitter
【24h】

Cooperative Multiple-Access Encoding With States Available at One Transmitter

机译:具有一个发送器可用状态的协作多址编码

获取原文
获取原文并翻译 | 示例
           

摘要

We generalize the Gel'fand-Pinsker model to encompass the setup of a memoryless multiple-access channel (MAC). According to this setup, only one of the encoders knows the state of the channel (noncausally), which is also unknown to the receiver. Two independent messages are transmitted: a common message and a message transmitted by the informed encoder. We find explicit characterizations of the capacity region with both noncausal and causal state information. Further, we study the noise-free binary case, and we also apply the general formula to the Gaussian case with noncausal channel state information, under an individual power constraint as well as a sum power constraint. In this case, the capacity region is achievable by a generalized writing-on-dirty-paper scheme.
机译:我们对Gel'fand-Pinsker模型进行了概括,以涵盖无记忆多路访问通道(MAC)的设置。根据这种设置,只有一个编码器(无因果地)知道信道的状态,而接收器也不知道。传输两个独立的消息:公共消息和由通知编码器传输的消息。我们发现带有非因果关系和因果状态信息的能力区域的显着特征。此外,我们研究了无噪声的二进制情况,并在单个功率约束和总功率约束下,将通用公式应用于具有非因果信道状态信息的高斯情况。在这种情况下,容量区域可以通过一般的脏纸书写方案来实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号