English
Related papers

Related papers: The DMT of Real and Quaternionic Lattice Codes and…

200 papers

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

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

This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime, some bounds were previously obtained from the high…

Information Theory · Computer Science 2015-09-29 Laura Luzzi , Roope Vehkalahti , Alexander Gorodnik

In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel.…

Information Theory · Computer Science 2015-03-17 Walid Abediseid , Mohamed Oussama Damen

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

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

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

For any $n_t$ transmit, $n_r$ receive antenna ($n_t\times n_r$) MIMO system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code-schemes (LSTBC-schemes) which have the non-vanishing…

Information Theory · Computer Science 2013-04-30 K. Pavan Srinath , B. Sundar Rajan

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

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

In this short note we will prove that non-vanishing determinant (NVD) criterion is not enough for an asymmetric space-time block code (STBC) to achieve the optimal diversity-multiplexing gain trade-off (DMT). This result is in contrast to…

Information Theory · Computer Science 2013-08-20 Roope Vehkalahti

This paper considers shifted inverse determinant sums arising from the union bound of the pairwise error probability for space-time codes in multiple-antenna fading channels. Previous work by Vehkalahti et al. focused on the approximation…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Laura Luzzi , Jean-Claude Belfiore

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

We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions…

Information Theory · Computer Science 2016-11-17 Camilla Hollanti , Jyrki Lahtonen , Hsiao-feng Francis Lu

The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless…

Information Theory · Computer Science 2021-12-10 Sufang Yang , Longguang Li , Haoyue Tang , Jintao Wang

Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing…

Information Theory · Computer Science 2010-11-03 Mireille Sarkiss , Ghaya Rekaya-Ben Othman , Mohamed Oussama Damen , Jean-Claude Belfiore

In this paper we investigate the criteria proposed by Coronel et al. for constructing MIMO MAC-DMT optimal codes over several classes of fading channels. We first give a counterexample showing their DMT result is not correct when the…

Information Theory · Computer Science 2009-08-24 Hsiao-feng , Lu , Jyrki Lahtonen , Roope Vehkalahti , Camilla Hollanti

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

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
‹ Prev 1 2 3 10 Next ›