...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Capacity of a Class of State-Dependent Orthogonal Relay Channels
【24h】

Capacity of a Class of State-Dependent Orthogonal Relay Channels

机译：一类状态相关正交中继信道的容量

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

摘要

The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the state sequence is fully known at the destination, while it is not known at the source or the relay. The capacity of this class of relay channels is characterized, and shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme. Then, the capacity of certain binary and Gaussian state-dependent orthogonal relay channels are studied in detail, and it is shown that the compress-and-forward (CF) and partial-decode-and-forward (pDF) schemes are suboptimal in general. To the best of our knowledge, this is the first single relay channel model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal. Furthermore, it is shown that the capacity of the considered class of state-dependent orthogonal relay channels is in general below the cut-set bound. The conditions under which pDF or CF suffices to meet the cut-set bound, and hence, achieve the capacity, are also derived.
机译：考虑了正交中继信道的类别，在该正交中继信道中，将源终端连接到中继器和目的地以及将中继器连接到目的地的正交信道取决于状态序列。假定状态序列在目标位置是完全已知的，而在源或中继点却是未知的。此类中继信道的容量已得到表征，并显示为通过部分解码-压缩-转发（pDCF）方案实现。然后，详细研究了某些二进制和依赖于高斯状态的正交中继信道的容量，结果表明，压缩转发（CF）和部分解码转发（pDF）方案通常不是最优的。据我们所知，这是第一个通过pDCF实现容量的单中继信道模型，而pDF和CF方案都不理想。此外，示出了所考虑的状态依赖的正交中继信道的类别的容量通常在割集边界以下。还推导了pDF或CF足以满足切割定界并因此达到容量的条件。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号