Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes
Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes
复制标题
DOI：
10.1109/tit.2013.2280167
复制
发表时间：
2010-05
影响因子：
2.5
通讯作者：
Ayfer Özgür;S. Diggavi
中科院分区：
文献类型：
--
作者：
Ayfer Özgür;S. Diggavi
最近，一种新的中继策略，量化映射转发（QMF）方案，已经被证明可以近似地（在一个可加的常数位数内）实现高斯中继网络的容量，即对于任意拓扑，信道增益和信噪比。这是使用高斯码本进行传输和继电器的随机映射建立的。在本文中，我们开发了实现QMF策略的结构化格码。本文的主要结果是这种结构点阵码可以近似地普遍地实现高斯中继网络容量，同样是在一个加性常数内。此外，我们为半双工网络建立了类似的结果，其中我们证明可以使用固定的发送-接收（TX-RX）调度来实现中继的容量，而无需跨网络的不同TX-RX状态进行发送功率优化。
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.