Capacity Theorems for the AWGN multi-way relay channel

The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are shown to be bounded away from the cut-set upper bound at high signal-to-noise ratios (SNR). It is known that the gap between the compress-forward rate and the capacity upper bound is a constant at high SNR, and that between the complete-decode-forward rate and the upper bound increases with SNR at high SNR. In this paper, a functional-decode-forward coding strategy is proposed. It is shown that for L ≥ 3, complete-decode-forward achieves the capacity when SNR ≤ 0 dB, and functional-decode-forward achieves the capacity when SNR ≥ 0 dB. For L = 2, functional-decode-forward achieves the capacity asymptotically as SNR increases.

[1]  Sae-Young Chung,et al.  Capacity Bounds for Two-Way Relay Channels , 2008, 2008 IEEE International Zurich Seminar on Communications.

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Andrea J. Goldsmith,et al.  The multi-way relay channel , 2009, 2009 IEEE International Symposium on Information Theory.

[4]  Lawrence Ong,et al.  An optimal coding strategy for the binary multi-way relay channel , 2010, IEEE Communications Letters.

[5]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.