English
Related papers

Related papers: Optimum Power Control at Finite Blocklength

200 papers

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

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

Information Theory · Computer Science 2017-11-15 Deekshith P K , Vinod Sharma

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

In this paper, we consider single- and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the…

Information Theory · Computer Science 2016-09-22 Lan V. Truong , Silas L. Fong , Vincent Y. F. Tan

Consider a problem of forward error-correction for the additive white Gaussian noise (AWGN) channel. For finite blocklength codes the backoff from the channel capacity is inversely proportional to the square root of the blocklength. In this…

Information Theory · Computer Science 2014-08-12 Yury Polyanskiy , Yihong Wu

This paper investigates the asymptotics of the maximal throughput of communication over AWGN channels by $n$ channel uses under a covert constraint in terms of an upper bound $\delta$ of Kullback-Leibler divergence (KL divergence). It is…

Information Theory · Computer Science 2026-04-08 Xinchun Yu , Shuangqing Wei , Shao-Lun Huang , Xiao-Ping Zhang

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

This paper investigates the achievable rates of an additive white Gaussian noise (AWGN) energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by a sequence of blocks of harvested energy, which is known…

Information Theory · Computer Science 2017-09-05 Silas L. Fong , Vincent Y. F. Tan , Ayfer Özgür

This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum method. We apply…

Information Theory · Computer Science 2016-11-15 Masahito Hayashi

The second-order coding rate of the multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channel is studied. We tackle this problem via an information-spectrum approach and statistical bounds based on recent random matrix…

Information Theory · Computer Science 2016-11-17 Jakob Hoydis , Romain Couillet , Pablo Piantanida

Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication…

Information Theory · Computer Science 2017-02-01 Shihao Yan , Biao He , Yirui Cong , Xiangyun Zhou

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter…

Information Theory · Computer Science 2014-04-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

We consider an additive White Gaussian channel where the transmitter is powered by an energy harvesting source. For such a system, we provide a lower bound on the maximal code book at finite code lengths that improves upon previously known…

Information Theory · Computer Science 2016-01-27 K Gautam Shenoy , Vinod Sharma

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted…

Information Theory · Computer Science 2014-10-14 Silas L. Fong , Vincent Y. F. Tan

The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying…

Information Theory · Computer Science 2017-04-04 P. K. Deekshith , K. R. Sahasranand

This paper shows that, under the average error probability formalism, the third-order term in the normal approximation for the additive white Gaussian noise channel with a maximal or equal power constraint is at least $\frac{1}{2} \log n +…

Information Theory · Computer Science 2015-04-21 Vincent Y. F. Tan , Marco Tomamichel

In this paper, we complement Verd\'{u}'s work on spectral efficiency in the wideband regime by investigating the fundamental tradeoff between rate and bandwidth when a constraint is imposed on the error exponent. Specifically, we consider…

Information Theory · Computer Science 2007-07-13 X. Wu , R. Srikant
‹ Prev 1 2 3 10 Next ›