English
Related papers

Related papers: Optimum Power Control at Finite Blocklength

200 papers

A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson $\beta$ functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verd\'{u} (2014). The new bound…

Information Theory · Computer Science 2016-01-25 Wei Yang , Austin Collins , Giuseppe Durisi , Yury Polyanskiy , H. Vincent Poor

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…

Information Theory · Computer Science 2014-03-05 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

In this paper, we consider the AWGN channel with a power constraint called the $(\sigma, \rho)$-power constraint, which is motivated by energy harvesting communication systems. Given a codeword, the constraint imposes a limit of $\sigma + k…

Information Theory · Computer Science 2015-04-22 Varun Jog , Venkat Anantharam

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

In this paper, we investigate in detail the performance of turbo codes in quasi-static fading channels both with and without antenna diversity. First, we develop a simple and accurate analytic technique to evaluate the performance of turbo…

Information Theory · Computer Science 2016-11-17 M. R. D. Rodrigues , I. Chatzigeorgiou , I. J. Wassell , R. Carrasco

Polar codes are designed for parallel binary-input additive white Gaussian noise (BiAWGN) channels with an average power constraint. The two main design choices are: the mapping between codeword bits and channels of different quality, and…

Information Theory · Computer Science 2019-05-06 Thomas Wiegart , Tobias Prinz , Fabian Steiner , Peihong Yuan

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless…

Information Theory · Computer Science 2018-08-07 Ting-Yi Wu , Lav R. Varshney , Vincent Y. F. Tan

Simultaneous transmission of information and power over a point-to-point flat-fading complex Additive White Gaussian Noise (AWGN) channel is studied. In contrast with the literature that relies on an inaccurate linear model of the energy…

Information Theory · Computer Science 2017-06-01 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

This paper presents two methods for approximating the performance of coded multicarrier systems operating over frequency-selective, quasi-static fading channels with non-ideal interleaving. The first method is based on approximating the…

Information Theory · Computer Science 2007-07-13 C. Snow , L. Lampe , R. Schober

This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that…

Information Theory · Computer Science 2019-09-27 Eren Balevi , Jeffrey G. Andrews

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

This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed {channels} whose channel law is characterized by a general mixture of (at most) uncountably many stationary and…

Information Theory · Computer Science 2016-05-09 Hideki Yagi , Te Sun Han , Ryo Nomura

This paper focuses on an improved Gaussian approximation (GA) based construction of polar codes with successive cancellation (SC) decoding over an additive white Gaussian noise (AWGN) channel. Arikan has proven that polar codes with…

Information Theory · Computer Science 2020-10-08 Hideki Ochiai , Patrick Mitran , H. Vincent Poor

We derive lower and upper bounds on the identification capacity of inverse Gaussian channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time…

Information Theory · Computer Science 2026-05-08 Mohammad Javad Salariseddigh

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim

The polar receiver architecture is a receiver design that captures the envelope and phase information of the signal rather than its in-phase and quadrature components. Several studies have demonstrated the robustness of polar receivers to…

Information Theory · Computer Science 2022-07-22 Neil Irwin Bernardo , Jingge Zhu , Jamie Evans

We study communication systems over band-limited Additive White Gaussian Noise (AWGN) channels in which the transmitter output is constrained to be symmetric binary (bi-polar). In this work we improve the original Ozarov-Wyner-Ziv (OWZ)…

Information Theory · Computer Science 2021-10-07 Michael Peleg , Tomer Michaeli , Shlomo Shamai

A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.

Information Theory · Computer Science 2010-01-14 Toshiyuki Tanaka , Ryuhei Mori
‹ Prev 1 4 5 6 7 8 10 Next ›