Research Article
Capacity Region of the Dirty Two-Way Relay Channel to Within Constant Bits
@INPROCEEDINGS{10.1007/978-3-319-66625-9_30, author={Zhixiang Deng and Yuan Gao and Wei Li and Changchun Cai}, title={Capacity Region of the Dirty Two-Way Relay Channel to Within Constant Bits}, proceedings={Communications and Networking. 11th EAI International Conference, ChinaCom 2016, Chongqing, China, September 24-26, 2016, Proceedings, Part I}, proceedings_a={CHINACOM}, year={2017}, month={10}, keywords={Two-way relay channel Dirty paper channel Nested lattice coding Compute-and-forward}, doi={10.1007/978-3-319-66625-9_30} }- Zhixiang Deng
Yuan Gao
Wei Li
Changchun Cai
Year: 2017
Capacity Region of the Dirty Two-Way Relay Channel to Within Constant Bits
CHINACOM
Springer
DOI: 10.1007/978-3-319-66625-9_30
Abstract
In this paper, we consider a dirty Gaussian two-way relay channel, where the two user nodes exchange messages with the help of a relay node. The three nodes experience two independent additive interferences which are assumed to be known at some nodes. We consider two cases: (1) the two user nodes know each of the two interferences respectively; (2) the relay node knows both the interferences. With nested lattice coding and compute-and-forward relaying, we derive achievable rate regions for the above two cases. The achievable rate regions are shown to be within constant bits from the cut-set outer bound for all channel parameters regardless of the interferences. Comparing the two achievable rate regions of the above two cases, it is shown that more information about the interferences the relay node knows more interferences will be canceled, larger achievable rate region can be achieved.