...
首页> 外文期刊>IEEE Transactions on Information Theory >Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes
【24h】

Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes

机译:使用基于格的QMF码大致实现高斯中继网络容量

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

获取外文期刊封面封底 >>

       

摘要

Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.
机译:最近,已经证明了一种新的中继策略,即量化映射转发(QMF)方案,可以在通用范围内(即对于任意拓扑而言)大致实现(在恒定的位数内)高斯中继网络的容量。和SNR。这是使用高斯码本在中继站进行传输和随机映射而建立的。在本文中,我们开发了实现QMF策略的结构化格码。本文的主要结果是,这种结构化的晶格码可以在一个加性常数内再次大致上大致实现高斯中继网络的容量。此外,我们为半双工网络建立了类似的结果,其中我们证明了使用固定的发射-接收(TX-RX)计划可以近似地实现中继的容量,而没有跨不同TX-RX状态进行发射功率优化网络。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号