Computer Science – Information Theory
Scientific paper
2008-08-02
Computer Science
Information Theory
This submission is Part-I of a two-part paper, which is a detailed version of the previous submission arXiv:0802.1888
Scientific paper
In this two-part paper, the DMT of cooperative multi-hop networks is examined. The focus is on single-source single-sink (ss-ss) multi-hop relay networks having slow-fading links and relays that potentially possess multiple antennas. The present paper examines the two end-points of the DMT of full-duplex networks. In particular, the maximum achievable diversity of arbitrary multi-terminal wireless networks is shown to be equal to the min-cut. The maximum multiplexing gain of arbitrary full-duplex ss-ss networks is shown to be equal to the min-cut rank, using a new connection to a deterministic network. We also prove some basic results including a proof that the colored noise encountered in AF protocols for cooperative networks can be treated as white noise for DMT computations. The DMT of a parallel channel with independent MIMO links is also computed here. As an application of these basic results, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable for full-duplex networks with single antenna nodes. All protocols in this paper are explicit and rely only upon amplify-and-forward (AF) relaying. Half duplex networks are studied, and explicit codes for all protocols proposed in both parts, are provided in the companion paper.
Birenjith S.
Kumar Vijay P.
Sreeram K.
No associations
LandOfFree
DMT of Multi-hop Cooperative Networks - Part I: Basic Results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with DMT of Multi-hop Cooperative Networks - Part I: Basic Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DMT of Multi-hop Cooperative Networks - Part I: Basic Results will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-662246