Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information
A. Zaidi, L. Vandendorpe

TL;DR
This paper derives rate regions for a partially cooperative relay broadcast channel with non-causal side information, extending to Gaussian channels and employing generalized dirty paper coding techniques.
Contribution
It provides new achievable rate regions for the PC-RBC with side information known at different nodes, including Gaussian channel extensions and novel coding strategies.
Findings
Achievable rate regions are characterized for discrete memoryless channels.
Extension to Gaussian channels with additive Gaussian side information.
GDPC is effective when only the source has side information.
Abstract
In this work, we consider a partially cooperative relay broadcast channel (PC-RBC) controlled by random parameters. We provide rate regions for two different situations: 1) when side information (SI) S^n on the random parameters is non-causally known at both the source and the relay and, 2) when side information S^n is non-causally known at the source only. These achievable regions are derived for the general discrete memoryless case first and then extended to the case when the channel is degraded Gaussian and the SI is additive i.i.d. Gaussian. In this case, the source uses generalized dirty paper coding (GDPC), i.e., DPC combined with partial state cancellation, when only the source is informed, and DPC alone when both the source and the relay are informed. It appears that, even though it can not completely eliminate the effect of the SI (in contrast to the case of source and relay…
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
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Cellular Automata and Applications
