Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network
From MaRDI portal
Abstract: The multicast capacity of the Gaussian two-hop relay network with one source, relays, and 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 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 destinations. When specialized to independent codes among relays, the proposed scheme achieves within bits from the cutset bound. The computation of this relaxation involves evaluating mutual information across cuts out of the total possible cuts, providing a very simple linear-complexity algorithm to approximate the single-source multicast capacity of the Gaussian two-hop relay network.
Recommendations
- Maximizing the Partial Decode-and-Forward Rate in the Gaussian MIMO Relay Channel
- On the Maximum Achievable Partial Decode-and-Forward Rate for the Gaussian MIMO Relay Channel
- On Optimal Gaussian Signaling in MIMO Relay Channels With Partial Decode-and-Forward
- On the Gaussian Half-Duplex Relay Channel
- Gaussian Degraded Relay Broadcast Channel
- Coding for Parallel Gaussian Bidirectional Relay Channels: A Deterministic Approach
- Distributed Decode–Forward for Relay Networks
- Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities
Cited in
(2)
This page was built for publication: Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976427)