An achievable rate region for the two-way two-relay channel

We propose an achievable rate region for the two- way two-relay channel using decode-and-forward block Markovian coding. A previous attempt to obtain an achievable region for this network encountered a fundamental deadlock problem in which each relay needed to decode before the other to enable mutual assistance. In this paper, the deadlock is resolved by introducing an additional constraint that ensures some relay can decode at least one source before the other relay. The resulting achievable region is an extension of existing results for the two- way single-relay channel.

[1]  Gerhard Kramer,et al.  Offset Encoding for Multiple-Access Relay Channels , 2007, IEEE Transactions on Information Theory.

[2]  Liang-Liang Xie,et al.  Multi-source , multi-destination , multi-relay wireless networks , 2007 .

[3]  Panganamala Ramana Kumar,et al.  Multisource, Multidestination, Multirelay Wireless Networks , 2007, IEEE Transactions on Information Theory.

[4]  Liang-Liang Xie.  Network Coding and Random Binning for Multi-User Channels , 2007, 2007 10th Canadian Workshop on Information Theory (CWIT).

[5]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[6]  Armin Wittneben,et al.  Achievable Rate Regions for the Two-way Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.