English
Related papers

Related papers: Diversity-Multiplexing Tradeoff in Selective-Fadin…

200 papers

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, 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

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

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

Information Theory · Computer Science 2015-05-22 Yair Yona , Meir Feder

We consider the sequential transmission of a stream of messages over a block-fading multi-input-multi-output (MIMO) channel. A new message arrives at the beginning of each coherence block, and the decoder is required to output each message…

Information Theory · Computer Science 2014-08-13 Ashish Khisti , Stark Draper

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

This paper investigates the diversity order of the minimum mean squared error (MMSE) based optimal transceivers in multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying systems. While the diversity-multiplexing tradeoff…

Information Theory · Computer Science 2013-12-17 Changick Song , Cong Ling

We show that the diversity-multiplexing tradeoff of a half-duplex single-relay channel with identically distributed Rayleigh fading channel gains meets the 2 by 1 MISO bound. We generalize the result to the case when there are N…

Information Theory · Computer Science 2008-10-14 Sameer Pawar , Amir Salman Avestimehr , David N. C. Tse

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks…

Information Theory · Computer Science 2008-07-02 R. N. Krishnakumar , N. Naveen , P. Vijay Kumar

We consider cooperative relay communication in a fading channel environment under the Orthogonal Amplify and Forward (OAF) and Orthogonal and Non-Orthogonal Selection Decode and Forward (OSDF and NSDF) protocols. For all these protocols, we…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Vinodh , M. Anand , P. Vijay Kumar

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

In this paper, we consider a particular class of selective fading channel corresponding to a channel that is selective either in time or in frequency. For this class of channel, we propose a systematic way to achieve the optimal DMT derived…

Information Theory · Computer Science 2010-10-14 Lina Mroueh , Jean-Claude Belfiore

The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing…

Information Theory · Computer Science 2011-03-22 Chung-Pi Lee , Hsuan-Jung Su

Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so that…

Information Theory · Computer Science 2007-09-25 S. Dusad , S. N. Diggavi

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

Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high…

Information Theory · Computer Science 2010-04-20 Hakan Topakkaya , Zhengdao Wang

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

In this work, we extend the non-orthogonal amplify-and-forward (NAF) cooperative diversity scheme to the MIMO channel. A family of space-time block codes for a half-duplex MIMO NAF fading cooperative channel with N relays is constructed.…

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

Tradeoff in diversity, multiplexing, and delay in multihop MIMO relay networks with ARQ is studied, where the random delay is caused by queueing and ARQ retransmission. This leads to an optimal ARQ allocation problem with per-hop delay or…

Information Theory · Computer Science 2010-01-06 Yao Xie , Andrea Goldsmith

The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint…

Information Theory · Computer Science 2016-11-17 Walid Abediseid , Mohamed Oussama Damen