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

From MaRDI portal
Publication:2976427

DOI10.1109/TIT.2016.2619902zbMATH Open1359.94962arXiv1508.00443MaRDI QIDQ2976427

Jing Li, Younghan Kim

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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 cooperate through 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 Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for Lge2 destinations. When specialized to independent codes among relays, the proposed scheme achieves within logN bits from the cutset bound. The computation of this relaxation 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.


Full work available at URL: https://arxiv.org/abs/1508.00443






Related Items (2)


Recommendations





This page was built for publication: Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network