Rate Regions for Relay Broadcast Channels

DOI10.1109/TIT.2007.904962zbMATH Open1326.94042arXivcs/0606074OpenAlexW2156447837MaRDI QIDQ3549064FDOQ3549064

Authors: Yingbin Liang, Gerhard Kramer 

Publication date: 21 December 2008

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

Abstract: A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a relay to assist destination 2. Inner and outer bounds on the capacity region of the discrete memoryless partially cooperative RBC are obtained. When the relay function is disabled, the inner and outer bounds reduce to new bounds on the capacity region of broadcast channels. Four classes of RBCs are studied in detail. For the partially cooperative RBC with degraded message sets, inner and outer bounds are obtained. For the semideterministic partially cooperative RBC and the orthogonal partially cooperative RBC, the capacity regions are established. For the parallel partially cooperative RBC with unmatched degraded subchannels, the capacity region is established for the case of degraded message sets. The capacity is also established when the source node has only a private message for destination 2, i.e., the channel reduces to a parallel relay channel with unmatched degraded subchannels.

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

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Cited In (3)

• Network coding for line networks with broadcast channels
• Broadcast diamond channel: transmission strategies and bounds
• Cooperative multiple access channels: achievable rates and optimal resource allocation

This page was built for publication: Rate Regions for Relay Broadcast Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549064)