English
Related papers

Related papers: Explicit Space-Time Codes Achieving The Diversity-…

200 papers

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the…

Information Theory · Computer Science 2007-07-13 Pedro Coronel , Helmut Bölcskei

Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of the fundamental tradeoff between data rate and reliability in a slow fading channel. In this paper, we characterize the fundamental DMT of the two user single…

Information Theory · Computer Science 2009-09-08 Adnan Raja , Pramod Viswanath

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

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

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency, and time-frequency selective-fading multiple-input multiple-output (MIMO) channels and provide a code design criterion for DM tradeoff optimality.…

Information Theory · Computer Science 2009-07-15 Pedro Coronel , Helmut Bölcskei

Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse [1]. The SNR-asymptotic DMT overestimates the finite-SNR one [2]. This paper outlines a number of…

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

The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is…

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

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

Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size and for all numbers of transmit and receive antennas at…

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

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and…

Information Theory · Computer Science 2007-08-10 Shuangqing Wei

Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per…

Information Theory · Computer Science 2007-07-13 Petros Elia , B. A. Sethuraman , P. Vijay Kumar

In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was…

Information Theory · Computer Science 2014-05-20 Amaro Barreal , Camilla Hollanti , David Karpuk , Hsiao-feng Lu

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

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

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

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

In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…

Information Theory · Computer Science 2015-12-11 Amaro Barreal , Camilla Hollanti , Nadya Markin

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

In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for…

Information Theory · Computer Science 2018-01-10 Laura Luzzi , Roope Vehkalahti

Zhang et. al. recently derived upper and lower bounds on the achievable diversity of an N_R x N_T i.i.d. Rayleigh fading multiple antenna system using transmit antenna selection, spatial multiplexing and a linear receiver structure. For the…

Information Theory · Computer Science 2007-07-13 J. Jalden , B. Ottersten