DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint
In: IEEE transactions on information theory, Jg. 59 (2013), Heft 6, S. 3875-3891
Online
academicJournal
- print, 37 ref
Zugriff:
In this paper, we study the diversity-multiplexing-gain tradeoff (DMT) of wireless relay networks under the half-duplex constraint. It is often unclear what penalty if any, is imposed by the half-duplex constraint on the DMT of such networks. We study two classes of networks; the first class, called KPP(I) networks, is the class of networks with the relays organized in K parallel paths between the source and the destination. While we assume that there is no direct source-destination path, the K relaying paths can interfere with each other. The second class, termed as layered networks, is comprised of relays organized in layers, where links exist only between adjacent layers. We present a communication scheme based on static schedules and amplify-and-forward relaying for these networks. We also show that for KPP(I) networks with K ≥ 3, the proposed schemes can achieve full-duplex DMT performance, thus demonstrating that there is no performance hit on the DMT due to the half-duplex constraint. We also show that, for layered networks, a linear DMT of dmax(1 ― r)+ between the maximum diversity dmax and the maximum MG, rmax = 1 is achievable. We adapt existing DMT optimal coding schemes to these networks, thus specifying the end-to-end communication strategy explicitly.
Titel: |
DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint
|
---|---|
Autor/in / Beteiligte Person: | SREERAM, K ; BIRENJITH, S ; VIJAY KUMAR, P |
Link: | |
Zeitschrift: | IEEE transactions on information theory, Jg. 59 (2013), Heft 6, S. 3875-3891 |
Veröffentlichung: | New York, NY: Institute of Electrical and Electronics Engineers, 2013 |
Medientyp: | academicJournal |
Umfang: | print, 37 ref |
ISSN: | 0018-9448 (print) |
Schlagwort: |
|
Sonstiges: |
|