...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network
【24h】

Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network

机译：高斯两跳中继网络的部分解码转发中继

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

摘要

The multicast capacity of the Gaussian two-hop relay network with one source, N relays, and L destinations is studied. It is shown that a careful modification of the partial decode-forward coding scheme, whereby the relays recover and coherently transmit degraded sets of message parts, achieves the cutset upper bound within (1/2)logN bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Özgür, which is also based on partial decode-forward yet has an unbounded gap from the cutset bound for L≥2 destinations. When restricted to noncoherent transmission among the relays, the proposed partial decode-forward scheme achieves a slightly larger gap of logN bits from the cutset bound. The computation of this relaxed achievable rate involves evaluating mutual information across L(N+1) cuts out of the total L2N possible cuts, providing a very simple linear-complexity algorithm to approximate the single-source multicast capacity of the Gaussian two-hop relay network.
机译：研究了具有一个源，N个中继和L个目的地的高斯两跳中继网络的多播容量。结果表明，对部分前向编码方案的仔细修改，使中继恢复并相干地传输消息部分的降级集合，无论信道增益和功率限制如何，都可以在（1/2）logN位内实现割集上限。 。该方案对Chern和Özgür的先前方案进行了改进，该方案也基于部分解码前向，但与L≥2的目标的割集边界相比具有无限制的间隙。当限于中继器之间的非相干传输时，建议的部分解码转发方案从割集边界实现logN位的稍大间隙。此轻松可达到的速率的计算涉及评估L2N个可能剪切中的L（N + 1）个剪切的互信息，从而提供一种非常简单的线性复杂度算法来近似高斯两跳中继的单源多播容量网络。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号