Reduced-Dimension Cooperative Precoding for MIMO Two-Way Relay Channels

Abstract

We investigate efficient communications over MIMO two-way relay channels (TWRCs) of n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> <; n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> , where n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> denotes the number of antennas at each user and n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> denotes that at the relay. We propose a new reduced-dimension (RD) cooperative precoding scheme. In the proposed scheme, the two users cooperatively create n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> aligned eigen-modes, supporting n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> streams of physical-layer network coding. We investigate the design of the RD cooperative precoder and derive an asymptotically optimal solution. We analytically show that, in the worst case, the proposed scheme is within ½ bit per transmit antenna of the asymptotic sum-capacity of the MIMO TWRC. For fading MIMO TWRCs with i.i.d. Gaussian coefficients, we derive a closed-form expression of the average sum-rate of the proposed scheme using large system analysis. Our analytical result shows that, for a large system with n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> /n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> = ½, the proposed scheme is less than 0.16 bit per transmit antenna away from the capacity. Furthermore, this gap reduces as n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> /n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> increases, and vanishes as n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> /n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> tends to 1. It is demonstrated that the proposed scheme can significantly outperform other existing schemes in the literature.