English
Related papers

Related papers: Lattice Sequential Decoding for LAST Coded MIMO Ch…

200 papers

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive…

Information Theory · Computer Science 2016-11-18 Joakim Jalden , Petros Elia

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

The exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational…

Information Theory · Computer Science 2012-06-07 Walid Abediseid

Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML)…

Information Theory · Computer Science 2009-01-28 Joakim Jalden , Petros Elia

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple…

Information Theory · Computer Science 2021-02-22 Roope Vehkalahti , Laura Luzzi

In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is…

Information Theory · Computer Science 2008-04-30 Yijia Fan , Lifeng Lai , Elza Erkip , H. Vincent Poor

The work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-performance of the (DMT optimal) exact solution of…

Information Theory · Computer Science 2016-11-18 Arun Singh , Petros Elia , Joakim Jalden

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such…

Information Theory · Computer Science 2013-04-11 Walid Abediseid , Mohamed-Slim Alouini

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

Diversity order is an important measure for the performance of communication systems over MIMO fading channels. In this paper, we prove that in MIMO multiple access systems (or MIMO point-to-point systems with V-BLAST transmission),…

Information Theory · Computer Science 2016-11-15 Mahmoud Taherzadeh , Amin Mobasher , Amir K. Khandani

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 paper we are concentrating on the diversity-multiplexing gain trade-off (DMT) of some space-time lattice codes. First we give a DMT bound for lattice codes having restricted dimension. We then recover the well known results of the…

Information Theory · Computer Science 2011-05-19 Roope Vehkalahti , Hsiao-feng Lu

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

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 paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity…

Information Theory · Computer Science 2007-09-04 Mahmoud Taherzadeh , Amir K. Khandani

Linear transceiving schemes between the relay and the destination have recently attracted much interest in MIMO amplify-and-forward (AF) relaying systems due to low implementation complexity. In this paper, we provide comprehensive analysis…

Information Theory · Computer Science 2014-03-11 Changick Song , Cong Ling

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. For the case of very strong interference, we prove that decoding interference while treating the…

Information Theory · Computer Science 2009-05-04 Cemal Akçaba , Helmut Bölcskei

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

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

Studies of the MISO Broadcast Channel (BC) with delayed Channel State Information at the Transmitter (CSIT) have so far focused on the sum-rate and Degrees-of-Freedom (DoF) region analysis. In this paper, we investigate for the first time…

Information Theory · Computer Science 2014-11-10 Bruno Clerckx , David Gesbert
‹ Prev 1 2 3 10 Next ›