On the Capacity Region of Asymmetric Gaussian Two-Way Line Channel

Lattice codes are known to outperform random codes for certain networks, especially in the Gaussian two-way relay channels (GTWRCs) where lattice codes are able to exploit their linearity. As an extension of the GTWRC, in this paper, we consider the asymmetric Gaussian two-way line network where two nodes exchange their messages through multiple relays. We first investigate the capacity region of the full-duplex two-way two-relay line network. The results can be extended to an arbitrary number of relays and to half-duplex scenarios. This channel consists of four nodes: 1 ↔ 2 ↔ 3 ↔ 4, where nodes 1 and 4 with the help of two full-duplex relays, i.e., nodes 2 and 3, exchange their messages with each other. Using lattice codes, we design a novel scheme that allows the relay nodes to send the data in both directions simultaneously under an asymmetric rate region. In the proposed scheme, each relay decodes the sum of lattice points and then re-encodes it into another lattice codeword (which satisfies the transmit power constraint at the relay). It is shown that the proposed scheme achieves the capacity region of asymmetric two-way line network within 0.5 bit independent of the number of relays.

[1]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.

[2]  Uri Erez,et al.  A simple proof for the existence of “good” pairs of nested lattices , 2012 .

[3]  Sae-Young Chung,et al.  Nested Lattice Codes for Gaussian Relay Networks With Interference , 2011, IEEE Transactions on Information Theory.

[4]  Petar Popovski,et al.  Bi-directional Amplification of Throughput in a Wireless Multi-Hop Network , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[5]  Giuseppe Caire,et al.  Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations , 2015, IEEE Transactions on Information Theory.

[6]  Natasha Devroye,et al.  Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward , 2011, IEEE Transactions on Information Theory.

[7]  Natasha Devroye,et al.  Lattice Coding for the Two-Way Line Network , 2014, IEEE Journal on Selected Areas in Communications.

[8]  Gregory Poltyrev,et al.  On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.

[9]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[10]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

[11]  Uri Erez,et al.  The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2012, IEEE Transactions on Information Theory.

[12]  Uri Erez,et al.  The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2014, IEEE Trans. Inf. Theory.

[13]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[14]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit , 2009, IEEE Transactions on Information Theory.

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

[16]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[17]  S. Sandeep Pradhan,et al.  A proof of the existence of good nested lattices , 2007 .

[18]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[19]  Yuval Kochman,et al.  Lattice Coding for Signals and Networks: Lattice shaping , 2014 .

[20]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.