On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel

Rahul Vaze, Robert W. Heath Jr.

Abstract

This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate region, when each relay employs an amplify and forward (AF) strategy. The iterative algorithm solves a power minimization problem at every step, subject to minimum signal-to-interference-and-noise ratio constraints, which is non-convex, however, for which the Karush Kuhn Tuker conditions are sufficient for optimality. The optimal AF strategy assumes global channel state information (CSI) at each relay. To simplify the CSI requirements, a simple amplify and forward strategy, called dual channel matching, is also proposed, that requires only local channel state information, and whose achievable rate region is close to that of the optimal AF strategy. In the asymptotic regime of large number of relays, we show that the achievable rate region of the dual channel matching and an upper bound differ by only a constant term and establish the capacity scaling law of the two-way relay channel. Relay strategies achieving optimal diversity-multiplexing tradeoff are also considered with a single relay node. A compress and forward strategy is shown to be optimal for achieving diversity multiplexing tradeoff for the full-duplex case, in general, and for the half-duplex case in some cases.

Introduction

In traditional wireless relaying, data typically flows in a unidirectional manner. This "one-way" relaying often suffers from reduced spectral efficiency, particularly when nodes operate in half-duplex mode—meaning they cannot transmit and receive simultaneously. Such systems effectively lose half of their potential throughput during the relaying process.

The Two-Way Relay Channel (TWRC) addresses this inefficiency by allowing two terminal nodes to transmit simultaneously to a relay in a first phase. In the second phase, the relay broadcasts a combined signal back to both terminals. Since each terminal knows its own transmitted signal, it can perform self-interference cancellation to recover the desired data from the other node. This approach effectively doubles the spectral efficiency, allowing half-duplex hardware to approach the performance of full-duplex systems.

System Model and Methods

This research focuses on a MIMO TWRC setup where two terminal nodes, $T_1$ and $T_2$, each equipped with $M$ antennas, exchange information through $K$ intermediate relays, each having $N$ antennas.

Figure 2: Multi-relay MIMO two-way relay channel model showing the two-phase communication protocol.

The study investigates two primary Amplify-and-Forward (AF) strategies:

  1. Optimal AF Strategy: This involves an iterative power minimization algorithm. By recasting the rate maximization problem into a series of steps subject to Signal-to-Interference-and-Noise Ratio (SINR) constraints, the authors utilize Karush-Kuhn-Tucker (KKT) conditions to find global optima for this non-convex problem. However, this requires global Channel State Information (CSI) at each relay.
  2. Dual Channel Matching: To reduce complexity, the authors propose a strategy where each relay only requires local CSI—knowledge of the channels directly connected to itself ($H_k$ and $G_k$).
Figure 4: Detailed view of the channel matrices (H and G) for the k-th relay, illustrating the local CSI requirements.

Key Insights and Results

Capacity Scaling Laws

A major contribution of this work is establishing the capacity scaling law for large relay networks. The authors prove that the achievable rate scales as $\frac{M}{2} \log K + O(1)$. This indicates that capacity grows logarithmically with the number of relays. Remarkably, the simple "dual channel matching" strategy performs nearly as well as the optimal global CSI strategy in large networks, with the performance gap narrowing to a mere constant term.

Diversity-Multiplexing Tradeoff (DMT)

For scenarios involving a single relay, the paper analyzes the balance between reliability (diversity) and data rate (multiplexing). Through outage analysis, the authors demonstrate that a modified Compress-and-Forward (CF) strategy is optimal for achieving the best possible DMT in full-duplex cases and several half-duplex configurations. This strategy effectively decouples the two-way channel into two independent one-way channels, simplifying subsequent code design.

Conclusion

The findings demonstrate that TWRC is a powerful architecture for overcoming the half-duplex penalty in wireless networks. By showing that local CSI is sufficient to achieve near-optimal capacity scaling, the authors provide a path toward practical, high-performance relaying in large-scale MIMO systems. Future work may extend these results to include direct paths between terminals in multi-relay environments and further refine DMT proofs for all half-duplex protocol variations.

Summary updated

Abstract

This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate region, when each relay employs an amplify and forward (AF) strategy. The iterative algorithm solves a power minimization problem at every step, subject to minimum signal-to-interference-and-noise ratio constraints, which is non-convex, however, for which the Karush Kuhn Tuker conditions are sufficient for optimality. The optimal AF strategy assumes global channel state information (CSI) at each relay. To simplify the CSI requirements, a simple amplify and forward strategy, called dual channel matching, is also proposed, that requires only local channel state information, and whose achievable rate region is close to that of the optimal AF strategy. In the asymptotic regime of large number of relays, we show that the achievable rate region of the dual channel matching and an upper bound differ by only a constant term and establish the capacity scaling law of the two-way relay channel. Relay strategies achieving optimal diversity-multiplexing tradeoff are also considered with a single relay node. A compress and forward strategy is shown to be optimal for achieving diversity multiplexing tradeoff for the full-duplex case, in general, and for the half-duplex case in some cases.
BibTeX
@article{vaze2011capacity,
  author = {Rahul Vaze and Robert W. Heath Jr.},
  title = {{On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel}},
  journal = {IEEE Trans. Information Theory},
  year = {2011},
  url = {https://openreview.net/forum?id=234WbDufiM},
}

Loading related content...

Figure