English
Related papers

Related papers: Diversity versus Multiplexing at Finite Blocklengt…

200 papers

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

We study the maximal achievable rate R*(n, \epsilon) for a given block-length n and block error probability \epsilon over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that…

Information Theory · Computer Science 2012-08-21 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a…

Information Theory · Computer Science 2025-11-19 Chao Qi , Tobias Koch

Future autonomous systems require wireless connectivity able to support extremely stringent requirements on both latency and reliability. In this paper, we leverage recent developments in the field of finite-blocklength information theory…

Information Theory · Computer Science 2016-11-29 Johan Östman , Giuseppe Durisi , Erik G. Ström , Jingya Li , Henrik Sahlin , Gianluigi Liva

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

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

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

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

We consider a single antenna narrowband multiple access channel in which users send training sequences to the base station and scheduling is performed based on minimum mean square error (MMSE) channel estimates. In such a system, there is…

Information Theory · Computer Science 2011-12-13 Jonathan Scarlett , Jamie Evans , Subhrakanti Dey

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

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

We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…

Information Theory · Computer Science 2017-05-24 Johan Östman , Giuseppe Durisi , Erik G. Ström

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

This paper re-examines the well-known fundamental tradeoffs between rate and reliability for the multi-antenna, block Rayleigh fading channel in the high signal to noise ratio (SNR) regime when (i) the transmitter has access to (noiseless)…

Information Theory · Computer Science 2007-07-17 Masoud Sharif , Prakash Ishwar

We develop a framework to optimize the tradeoff between diversity, multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We first focus on the diversity-multiplexing tradeoff in MIMO systems, and develop analytical…

Information Theory · Computer Science 2008-04-09 Tim Holliday , Andrea J. Goldsmith , H. Vincent Poor

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

This paper analyzes the maximal achievable rate for a given blocklength and error probability over a multiple-antenna ambient backscatter channel with perfect channel state information at the receiver. The result consists of a finite…

Information Theory · Computer Science 2022-03-22 Likun Sui , Zihuai Lin , Pei Xiao , H. Vincent Poor , Branka Vucetic

We show that the diversity-multiplexing tradeoff of a half-duplex single-relay channel with identically distributed Rayleigh fading channel gains meets the 2 by 1 MISO bound. We generalize the result to the case when there are N…

Information Theory · Computer Science 2008-10-14 Sameer Pawar , Amir Salman Avestimehr , David N. C. Tse
‹ Prev 1 2 3 10 Next ›