English
Related papers

Related papers: Optimum Power Control at Finite Blocklength

200 papers

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total…

Information Theory · Computer Science 2012-07-26 Kenneth Andrews , Sam Dolinar

For the discrete-time AWGN channel with a power constraint, we give an alternative derivation of Shannon's sphere-packing upper bound on the optimal block error exponent and prove for the first time an analogous lower bound on the optimal…

Information Theory · Computer Science 2023-07-26 Sergey Tridenski , Anelia Somekh-Baruch

This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. Tight general achievability and converse bounds are derived that hold at…

Information Theory · Computer Science 2016-11-15 Victoria Kostina , Sergio Verdú

Parallel, additive white Gaussian noise (AWGN) channels with an average sum power constraint are considered. It is shown how the waterfilling Shannon capacity can be approached by higher order modulation and probabilistic amplitude shaping…

Information Theory · Computer Science 2018-04-06 Fabian Steiner , Georg Böcherer , Patrick Schulte

$M$-ary signal transmission over AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. Shannon's theorem for channels with side information at…

Information Theory · Computer Science 2007-07-13 Hamid Farmanbar , Amir K. Khandani

In non-coherent wideband fading channels where energy rather than spectrum is the limiting resource, peaky and non-peaky signaling schemes have long been considered species apart, as the first approaches asymptotically the capacity of a…

Information Theory · Computer Science 2017-04-04 Felipe Gomez-Cuba , Jinfeng Du , Muriel Médard , Elza Erkip

Channel coding for discrete memoryless channels (DMCs) with mean and variance cost constraints has been recently introduced. We show that there is an improvement in coding performance due to cost variability, both with and without feedback.…

Information Theory · Computer Science 2025-07-10 Adeel Mahmood , Aaron B. Wagner

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

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

This paper investigates the information-theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan , Jing Yang

The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect,…

Information Theory · Computer Science 2018-04-18 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

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

Recent advances in deep learning for wireless communications have renewed interest in channel output feedback codes. In the additive white Gaussian broadcast channel with feedback (AWGN-BC-F), feedback can expand the channel capacity region…

Signal Processing · Electrical Eng. & Systems 2025-12-02 Jacqueline Malayter , Yingyao Zhou , Natasha Devroye , Chih-Chun Wang , Christopher Brinton , David J. Love

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

This paper provides an upper-bound for the capacity of the underwater acoustic (UWA) channel with dominant noise sources and generalized fading environments. Previous works have shown that UWA channel noise statistics are not necessary…

Information Theory · Computer Science 2014-04-29 Mustafa A. Kishk , Ahmed M. Alaa

The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years, but it is still unknown for the general case. In this paper we derive bounds on the…

Information Theory · Computer Science 2011-07-05 Itsik Bergel , Sergio Benedetto

We consider an energy-harvesting communication system where a transmitter powered by an exogenous energy arrival process and equipped with a finite battery of size $B_{max}$ communicates over a discrete-time AWGN channel. We first…

Information Theory · Computer Science 2015-01-12 Yishun Dong , Farzan Farnia , Ayfer Özgür

Feedback communication is studied from a control-theoretic perspective, mapping the communication problem to a control problem in which the control signal is received through the same noisy channel as in the communication problem, and the…

Information Theory · Computer Science 2010-06-29 Ehsan Ardestanizadeh , Massimo Franceschetti

Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate…

Information Theory · Computer Science 2022-01-25 Venkatesan Guruswami , Andrii Riazanov , Min Ye

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…

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