Cooperative Relaying with State Available Non-Causally at the Relay
Abdellatif Zaidi, Shiva Prasad Kotagiri, J. Nicholas Laneman, Luc, Vandendorpe

TL;DR
This paper investigates the capacity of a state-dependent relay channel with noncausal state information at the relay, providing bounds and capacity results for both discrete memoryless and Gaussian cases, including half-duplex scenarios.
Contribution
It introduces new coding schemes combining codeword splitting, Gel'fand-Pinsker binning, and dirty paper coding, and derives capacity bounds for the relay channel with noncausal state information.
Findings
Lower and upper bounds on capacity for DM and Gaussian channels.
Capacity is exactly determined in some degraded Gaussian cases.
Extends results to half-duplex relay operation.
Abstract
We consider a three-terminal state-dependent relay channel with the channel state noncausally available at only the relay. Such a model may be useful for designing cooperative wireless networks with some terminals equipped with cognition capabilities, i.e., the relay in our setup. In the discrete memoryless (DM) case, we establish lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, Gel'fand-Pinsker binning, and decode-and-forward relaying. The upper bound improves upon that obtained by assuming that the channel state is available at the source, the relay, and the destination. For the Gaussian case, we also derive lower and upper bounds on the capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, generalized dirty paper coding,…
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.
