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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 62; H. 12; S. 7078 - 7085
Hauptverfasser: Li, Jing, Kim, Young-Han
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Capacity approximation
Codes
Complexity theory
cutset bound
Diamond
distributed decode-forward
Encoding
Information theory
Noise measurement
noisy network coding
Normal distribution
partial decode-forward
Power supply
relay network
Relay networks (telecommunications)
Upper bound
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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) log N 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 decodeforward scheme achieves a slightly larger gap of log N 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 L2 N possible cuts, providing a very simple linearcomplexity algorithm to approximate the single-source multicast capacity of the Gaussian two-hop relay network.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2016.2619902