English
Related papers

Related papers: The AWGN Red Alert Problem

200 papers

In many signal processing applications, including communications, sonar, radar, and localization, a fundamental problem is the detection of a signal of interest in background noise, known as signal detection [1] [2]. A simple version of…

Signal Processing · Electrical Eng. & Systems 2025-12-16 Tom Anders , Hiten Prakash Kothari , R. Michael Buehrer

We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the total error probability in the short blocklength regime. We…

Information Theory · Computer Science 2025-03-05 Alexander Sauter , A. Oguz Kislal , Giuseppe Durisi , Gianluigi Liva , Balazs Matuz , Erik G. Ström

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

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

The error exponent of the typical random code is defined as the asymptotic normalized expectation of the logarithm of the probability of error, as opposed to the traditional definition of the random coding exponent as the normalized…

Information Theory · Computer Science 2018-12-18 Neri Merhav

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

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

This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or…

Information Theory · Computer Science 2019-04-12 Federico Brunero , Daniela Tuninetti , Natasha Devroye

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

Lattice coding and decoding have been shown to achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was accomplished using a minimum mean-square error scaling and randomization to transform the AWGN channel into a…

Information Theory · Computer Science 2013-08-08 Charles H. Swannack , Uri Erez , Gregory W. Wornell

We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained…

Information Theory · Computer Science 2009-05-18 Christian Senger , Vladimir Sidorenko , Victor Zyablov

In continuation to an earlier work, where error exponents of typical random codes were studied in the context of general block coding, with no underlying structure, here we carry out a parallel study on typical random, time-varying trellis…

Information Theory · Computer Science 2019-03-05 Neri Merhav

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

Information Theory · Computer Science 2007-07-13 M. Twitto , I. Sason , S. Shamai

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

In this paper, we investigate the problem of transmitting an analog source to a destination over $N$ uses of an additive-white-Gaussian-noise (AWGN) channel, where $N$ is very small (in the order of 10 or even less). The proposed coding…

Information Theory · Computer Science 2024-02-01 Mohammad Ali Maddah-Ali , Soheil Mohajer

We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…

Information Theory · Computer Science 2021-09-29 Alejandro Lancho , Johan Östman , Giuseppe Durisi

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

In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are…

Information Theory · Computer Science 2017-01-05 Minh Au , Francois Gagnon

Modulo-wrapping receivers have attracted interest in several areas of digital communications, including precoding and lattice coding. The asymptotic capacity and error performance of the modulo AWGN channel have been well established.…

Information Theory · Computer Science 2021-05-21 Gizem Tabak , Andrew Singer

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have…

Information Theory · Computer Science 2011-10-11 Anusha Gorantla , Vinod Sharma