Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit

By Wooseok Nam, Sae-Young Chung, Yong Hoon Lee. IEEE Transactions on Information Theory, 2009

305 citations recorded by the source corpus.

In this paper, a Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode and there is no direct channel between the source nodes. We propose an achievable scheme composed of nested lattice codes for the uplink and structured binning for the downlink. Unlike conventional nested lattice codes, our codes utilize two different shaping lattices for source nodes based on a three-stage lattice partition chain, which is a key ingredient for producing the best gap-to-capacity results to date. Specifically, for all channel parameters, the achievable rate region of our scheme is within 1/2 bit from the capacity region for each user and its sum rate is within log3/2 bit from the sum capacity.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/16745a1f5758fa80796f1433bd2aeaf605a3f2bb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Compute-and-Forward: Harnessing Interference Through Structured Codes (2009, background): “Nam, Chung, and Lee generalized this nested lattice strategy to include asymmetric power constraints [35], found the capacity to within half a bit [ 36 ], and extended their scheme to Gaussian multiple-access networks [37].”