English
Related papers

Related papers: Diversity-Multiplexing Tradeoff of the Half-Duplex…

200 papers

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…

Information Theory · Computer Science 2011-07-01 Sanjay Karmakar , Mahesh K. Varanasi

In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward…

Information Theory · Computer Science 2009-11-09 Olivier Leveque , Christophe Vignat , Melda Yuksel

The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas,…

Information Theory · Computer Science 2010-08-10 Sanjay Karmakar , Mahesh K. Varanasi

In this paper, we analyze the fundamental tradeoff of diversity and multiplexing in multi-input multi-output (MIMO) channels with imperfect channel state information at the transmitter (CSIT). We show that with imperfect CSIT, a higher…

Information Theory · Computer Science 2009-08-16 Xiao Juan Zhang , Yi Gong

A multi-hop two-way relay channel is considered in which all the terminals are equipped with multiple antennas. Assuming independent quasi-static Rayleigh fading channels and channel state information available at the receivers, we…

Information Theory · Computer Science 2008-12-19 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second…

Information Theory · Computer Science 2014-12-16 Daniel Zahavi , Lili Zhang , Ivana Maric , Ron Dabora , Andrea J. Goldsmith , Shuguang Cui

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d.…

Information Theory · Computer Science 2016-11-17 Sergey Loyka , Georgy Levin

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…

Information Theory · Computer Science 2007-09-29 Yijia , Fan , H. Vincent Poor , John S. Thompson

This paper considers an interference network composed of K half-duplex single-antenna pairs of users who wish to establish bi-directional communication with the aid of a multi-input-multi-output (MIMO) half-duplex relay node. This channel…

Information Theory · Computer Science 2009-01-20 Hassan Ghozlan , Yahya Mohasseb , Hesham El Gamal , Gerhard Kramer

It is well known that the presence of double scattering degrades the performance of a MIMO channel, in terms of both the multiplexing gain and the diversity gain. In this paper, a closed-form expression of the diversity-multiplexing…

Information Theory · Computer Science 2007-07-16 Sheng Yang , Jean-Claude Belfiore

Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully…

Information Theory · Computer Science 2013-05-16 Ritesh Kolte , Ayfer Özgür

In this paper, an outage limited MIMO channel is considered. We build on Zheng and Tse's elegant formulation of the diversity-multiplexing tradeoff to develop a better understanding of the asymptotic relationship between the probability of…

Information Theory · Computer Science 2007-07-16 Kambiz Azarian , Hesham El Gamal

In this paper, a multiple-relay network in considered, in which $K$ single-antenna relays assist a single-antenna transmitter to communicate with a single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF) scheme is…

Information Theory · Computer Science 2007-10-01 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. khandani

A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown…

Information Theory · Computer Science 2016-11-18 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

Diversity-multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high data rate and/or low error rate). This tradeoff was characterized…

Information Theory · Computer Science 2016-11-15 Sergey Loyka , George Levin

This paper studies the setup of a multiple-relay network in which $K$ half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are…

Information Theory · Computer Science 2008-06-08 Shahab Oveis Gharan , Alireza Bayesteh , Amir K. Khandani

In this paper, we propose novel cooperative transmission protocols for delay limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay,…

Information Theory · Computer Science 2007-07-16 Kambiz Azarian , Hesham El Gamal , Philip Schniter

This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate…

Information Theory · Computer Science 2008-10-22 Rahul Vaze , Robert W. Heath

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…

Information Theory · Computer Science 2016-11-17 Johan Östman , Wei Yang , Giuseppe Durisi , Tobias Koch

We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed…

Information Theory · Computer Science 2007-08-03 Sheng Yang , Jean-Claude Belfiore
‹ Prev 1 2 3 10 Next ›