Bounds on the sum-rate capacity of the Gaussian MIMO X channel

Prasad, Ranga ; Srinidhi, N. ; Chockalingam, A. (2012) Bounds on the sum-rate capacity of the Gaussian MIMO X channel In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 1-5 October 2012, Illinois, USA.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/6483360/

Related URL: http://dx.doi.org/10.1109/Allerton.2012.6483360

Abstract

We consider the MIMO X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. Both the transmitters and receivers are equipped with multiple antennas. First, we derive an upper bound on the sum-rate capacity of the MIMO XC under individual power constraint at each transmitter. The sum-rate capacity of the two-user multiple access channel (MAC) that results when receiver cooperation is assumed forms an upper bound on the sum-rate capacity of the MIMO XC. We tighten this bound by considering noise correlation between the receivers and deriving the worst noise covariance matrix. It is shown that the worst noise covariance matrix is a saddle-point of a zero-sum, two-player convex-concave game, which is solved through a primal-dual interior point method that solves the maximization and the minimization parts of the problem simultaneously. Next, we propose an achievable scheme which employs dirty paper coding at the transmitters and successive decoding at the receivers. We show that the derived upper bound is close to the achievable region of the proposed scheme at low to medium SNRs.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
Keywords:Dirty Paper Coding; MIMO X Channel; Interference Channel; Convex-Concave Game; Primal-dual Interior Point Method
ID Code:102204
Deposited On:26 Mar 2017 16:46
Last Modified:26 Mar 2017 16:46

Repository Staff Only: item control page