English
Related papers

Related papers: Diversity versus Multiplexing at Finite Blocklengt…

200 papers

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

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…

Information Theory · Computer Science 2015-03-19 Yair Yona , Meir Feder

We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum…

Information Theory · Computer Science 2019-04-11 Yasutada Oohama

This paper considers the asymptotic behavior of two-source block-fading single-antenna Gaussian interference channels in the high-SNR regime by means of the diversity-multiplexing tradeoff. We consider a general setting where the users and…

Information Theory · Computer Science 2009-08-05 Yang Weng , Daniela Tuninetti

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, the theoretical limits on the robustness of MIMO joint source channel codes is investigated. The case in which a single joint source channel code is used for the entire range of SNRs and for all levels of required fidelity is…

Information Theory · Computer Science 2009-11-02 Mahmoud Taherzadeh , H. Vincent Poor

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength…

Information Theory · Computer Science 2018-01-12 Oliver Kosut , Joerg Kliewer

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

Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…

Information Theory · Computer Science 2009-12-24 S. Dusad , S. N. Diggavi

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the…

Information Theory · Computer Science 2009-03-16 Yijia , Fan , Chao Wang , H. Vincent Poor , John S. Thompson

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

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

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent selective-fading multiple-access multiple-input multiple-output (MIMO) channels and provide corresponding code design criteria. As a byproduct, on the conceptual…

Information Theory · Computer Science 2008-05-02 Pedro Coronel , Markus Gärtner , Helmut Bölcskei

This paper analyzes the fundamental trade-offs that occur in the co-design of pilot resource allocations in orthogonal frequency-division multiplexing signals for both ranging (via time-of-arrival estimation) and communications. These…

Signal Processing · Electrical Eng. & Systems 2024-01-31 Andrew Graff , Todd E. Humphreys

A contemporary perspective on the tradeoff between transmit antenna diversity and spatial multiplexing is provided. It is argued that, in the context of most modern wireless systems and for the operating points of interest, transmission…

Information Theory · Computer Science 2009-03-05 Angel Lozano , Nihar Jindal

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…

Information Theory · Computer Science 2007-09-29 Yijia , Fan , H. Vincent Poor , John S. Thompson

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity…

Information Theory · Computer Science 2024-10-30 Elad Domanovitz , Uri Erez

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

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d.…

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

Digital contents in large scale distributed storage systems may have different reliability and access delay requirements, and for this reason, erasure codes with different strengths need to be utilized to achieve the best storage…

Information Theory · Computer Science 2016-04-29 Chao Tian , Tie Liu