English
Related papers

Related papers: Remarks on criteria for achieving the optimal dive…

200 papers

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

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

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

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

An extension of the popular diversity-multiplexing tradeoff framework to the low-SNR (or wideband) regime is proposed. The concept of diversity gain is shown to be redundant in this regime since the outage probability is SNR-independent and…

Information Theory · Computer Science 2015-03-19 Sergey Loyka , Georgy Levin

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

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

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

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

In this paper, a general criterion for space time block codes (STBC) to achieve full-diversity with a linear receiver is proposed for a wireless communication system having multiple transmitter and single receiver antennas (MISO).…

Information Theory · Computer Science 2016-11-18 Jing Liu , Jian-Kang Zhang , Kon Max Wong

The perfect space-time block codes (STBCs) are based on four design criteria - full-rateness, non-vanishing determinant, cubic shaping and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at…

Information Theory · Computer Science 2012-12-12 K. Pavan Srinath , B. Sundar Rajan

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

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

In this work we explicitly provide the first ever optimal, with respect to the Zheng-Tse diversity multiplexing gain (D-MG) tradeoff, cooperative diversity schemes for wireless relay networks. The schemes are based on variants of perfect…

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

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method,…

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

Performance of reliable communication over a coherent slow fading channel at high SNR is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. We study the problem of designing codes that optimally tradeoff…

Information Theory · Computer Science 2007-07-13 Saurabha Tavildar , Pramod Viswanath
‹ Prev 1 2 3 10 Next ›