By Topic

The Diversity-Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sanjay Karmakar ; Department of Electrical, Computer and Energy Engineering, University of Colorado, Boulder, CO, USA ; Mahesh K. Varanasi

The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which opportunistic scheduling (or dynamic operation) of the relay is allowed, i.e., the relay can switch between receive and transmit modes at a channel dependent time. In this most general case, the diversity-multiplexing tradeoff is characterized as a solution to a simple, two-variable optimization problem. This problem is then solved in closed form for special classes of channels defined by certain restrictions on the numbers of antennas at the three nodes. The key mathematical tool developed here that enables the explicit characterization of the diversity-multiplexing tradeoff is the joint eigenvalue distribution of three mutually correlated random Wishart matrices. Besides being relevant here, this distribution result is interesting in its own right. Previously, without actually characterizing the diversity-multiplexing tradeoff, the optimality in this tradeoff metric of the dynamic compress-and-forward protocol based on the classical compress-and-forward scheme of Cover and El Gamal was shown by Yuksel and Erkip. However, this scheme requires global channel state information at the relay. In this paper, the so-called quantize-map and forward (QMF) coding scheme is adopted as the achievability scheme with the added benefit that it achieves optimal tradeoff with only the knowledge of the (channel dependent) switching time at the relay node. Moreover, in special classes of the MIMO half-duplex relay channel, the optimal tradeoff is shown to be attainable even without this knowledge. Such a result was previously known only for the half-duplex relay channel with a single antenna at each node, also via the QMF scheme. More generally, the explicit characterization of the tradeoff curve in this study enables the in-depth comparisons herein - f full-duplex versus half-duplex relaying as well as static versus dynamic relaying, both as a function of the numbers of antennas at the three nodes.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 12 )