TY - JOUR
T1 - DMT of multihop networks
T2 - end points and computational tools
AU - Sreeram, K.
AU - Birenjith, S.
AU - Kumar, P. Vijay
N1 - Funding Information:
Manuscript received July 22, 2008; revised October 13, 2010; accepted May 02, 2011. Date of current version February 08, 2012. This work was supported in part by the NSF-ITR Grant CCR-0326628, in part by the DRDO-IISc Program on Advanced Mathematical Engineering, and in part by Motorola’s University Research Partnership Program with IISc. The material in this paper was presented in part at the 10th International Symposium on Wireless Personal Multimedia Communications, Jaipur, India, December 2007, at the Information Theory and Applications Workshop, San Diego, CA, January 2008, and at the 2008 IEEE International Symposium on Information Theory.
PY - 2012/2
Y1 - 2012/2
N2 - 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.
AB - 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.
KW - Amplify-and-forward protocols
KW - Cooperative diversity
KW - Degrees of freedom
KW - Deterministic network
KW - Diversity-multiplexing gain tradeoff
KW - Explicit codes
KW - Multihop networks
KW - Parallel channel
KW - Relay networks
UR - http://www.scopus.com/inward/record.url?scp=84856874132&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2173243
DO - 10.1109/TIT.2011.2173243
M3 - Article
AN - SCOPUS:84856874132
SN - 0018-9448
VL - 58
SP - 804
EP - 819
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 2
ER -