Approximate capacity of the two-way relay channel: A deterministic approach

Abstract

We study the capacity of the full-duplex bidirectional (or two-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e. channel reciprocity is not assumed. We use the recently proposed deterministic approach to capture the essence of the problem and to determine a good transmission and relay strategy for the Gaussian channel. Depending on the ratio of the individual channel gains, we propose to use either a simple amplify-and-forward or a particular superposition coding strategy at the relay. We analyze the achievable rate region and show that the scheme achieves to within 3 bits the cut-set bound for all values of channel gains.

7 pages, 8 figures, will be presented at 46. Allerton Conf. On Comm., Control, and Computing 2008

References in corpus (4)

• The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
• Broadcast Capacity Region of Two-Phase Bidirectional Relaying
• Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying
• Approximate Capacity of Gaussian Relay Networks

Cited by in corpus (9)

• Wireless Network Information Flow: A Deterministic Approach
• The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange
• Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit
• On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel
• On approximating Gaussian relay networks by deterministic networks
• Towards Optimal Schemes for the Half-Duplex Two-Way Relay Channel
• Nested Lattice Codes for Gaussian Two-Way Relay Channels
• Capacity of a Class of Linear Binary Field Multi-source Relay Networks
• Tight Information Theoretic Converse Results for some Pliable Index Coding Problems