English
Related papers

Related papers: Saddlepoint Approximations for Short-Packet Wirele…

200 papers

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying…

Quantum Physics · Physics 2016-01-01 William Matthews , Stephanie Wehner

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

Information Theory · Computer Science 2007-07-13 Siddharth Ray , Muriel Medard , Lizhong Zheng

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

As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…

Information Theory · Computer Science 2012-02-13 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry Pfister

Ultra-Reliable Low-Latency Communications have stringent delay constraints, and hence use codes with small block length (short codewords). In these cases, classical models that provide good approximations to systems with infinitely long…

Information Theory · Computer Science 2021-01-29 Nourhan Hesham , Anas Chaaban

In this paper we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken…

Information Theory · Computer Science 2016-10-25 Tomaso Erseghe

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

The use of multiple antenna arrays in transmission and reception has become an integral part of modern wireless communications. To quantify the performance of such systems, the evaluation of bounds on the error probability of realistic…

Information Theory · Computer Science 2017-11-28 Apostolos Karadimitrakis , Aris L. Moustakas , Romain Couillet

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

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF)…

Information Theory · Computer Science 2016-07-26 Rahul Devassy , Giuseppe Durisi , Benjamin Lindqvist , Wei Yang , Marco Dalai

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing…

Information Theory · Computer Science 2021-07-19 Volodymyr Shyianov , Mohamed Akrout , Faouzi Bellili , Amine Mezghani , Robert W. Heath

A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of…

Information Theory · Computer Science 2007-10-30 Masoud Ebrahimi , Amir K. Khandani

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