DMT of multihop networks: end points and computational tools

Sreeram, K. ; Birenjith, S. ; Vijay Kumar, P. (2012) DMT of multihop networks: end points and computational tools IEEE Transactions on Information Theory, 58 (2). pp. 804-819. ISSN 0018-9448

Full text not available from this repository.

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

Related URL: http://dx.doi.org/10.1109/TIT.2011.2173243

Abstract

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronic Engineers.
Keywords:Relay Networks; Amplify-and-Forward Protocols; Cooperative Diversity; Degrees of Freedom; Deterministic Network; Diversity-Multiplexing Gain Tradeoff; Explicit Codes; Multihop Networks; Parallel Channel
ID Code:110065
Deposited On:31 Jan 2018 09:59
Last Modified:31 Jan 2018 09:59

Repository Staff Only: item control page