Cooperative Strategies for Simultaneous and Broadcast Relay Channels
Arash Behboodi, Pablo Piantanida

TL;DR
This paper investigates cooperative strategies for simultaneous and broadcast relay channels, deriving capacity bounds and proposing coding schemes based on Decode-and-Forward and Compress-and-Forward techniques, applicable to Gaussian models.
Contribution
It introduces a unified framework for relay cooperation strategies, deriving new inner and outer bounds for the capacity region of broadcast relay channels.
Findings
Inner bounds on capacity for various relay strategies
Capacity results for Gaussian relay channels
Unified approach generalizing previous work
Abstract
Consider the \emph{simultaneous relay channel} (SRC) which consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to that of sending common and private information to several destinations in presence of helper relays where each channel outcome becomes a branch of the \emph{broadcast relay channel} (BRC). Cooperative schemes and capacity region for a set with two memoryless relay channels are investigated. The proposed coding schemes, based on \emph{Decode-and-Forward} (DF) and \emph{Compress-and-Forward} (CF) must be capable of transmitting information simultaneously to all destinations in such set. Depending on the quality of source-to-relay and relay-to-destination channels, inner bounds on the capacity of the general BRC are derived. Three cases of particular…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Wireless Communication Security Techniques · Advanced Wireless Communication Technologies
