English
Related papers

Related papers: On information rates over a binary input channel

200 papers

Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…

Information Theory · Computer Science 2009-04-22 David Tse , Roy Yates

Almost all modern communication systems rely on electromagnetic fields as a means of information transmission, and finding the capacities of these systems is a problem of significant practical importance. The Additive White Gaussian Noise…

Quantum Physics · Physics 2013-02-05 Robert Koenig , Graeme Smith

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

Neurons and Cognition · Quantitative Biology 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup

We consider covert communication, i.e., hiding the presence of communication from an adversary for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channels. We characterize the maximum covert coding rate under a…

Signal Processing · Electrical Eng. & Systems 2021-01-25 Ahmed Bendary , Amr Abdelaziz , C. Emre Koksal

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot

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

This paper slightly improves the upper bound in Thangaraj et al. for the capacity of the amplitude-constrained scalar AWGN channel. This improvement makes the upper bound within 0.002 bits of the capacity for $\frac{E_b}{N_0}\leq 2.5$ dB.

Information Theory · Computer Science 2016-05-05 Borazon Rassouli , Bruno Clerckx

We investigate design and performance of communications over the bandlimited Gaussian channel with one-bit output quantization. A transceiver structure is proposed, which generates the channel input using a finite set of time-limited and…

Information Theory · Computer Science 2020-11-05 Rui Deng , Jing Zhou , Wenyi Zhang

The mutual information between a complex-valued channel input and its complex-valued output is decomposed into four parts based on polar coordinates: an amplitude term, a phase term, and two mixed terms. Numerical results for the additive…

Information Theory · Computer Science 2015-03-13 Bernhard Goebel , René-Jean Essiambre , Gerhard Kramer , Peter J. Winzer , Norbert Hanik

In this report, we study communication over an additive white Gaussian noise channel with a fixed signal constellation. We measure how much information we can send through this channel and how to improve the rate of communication by…

Information Theory · Computer Science 2023-02-17 Sébastien Delsad

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 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

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

We determine lower and upper bounds on the capacity of bandlimited optical intensity channels (BLOIC) with white Gaussian noise. Three types of input power constraints are considered: 1) only an average power constraint, 2) only a peak…

Information Theory · Computer Science 2017-02-14 Jing Zhou , Wenyi Zhang

A new achievable rate for bit-metric decoding (BMD) is derived using random coding arguments. The rate expression can be evaluated for any input distribution, and in particular the bit-levels of binary input labels can be stochastically…

Information Theory · Computer Science 2016-05-31 Georg Böcherer

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

A practical communication channel often suffers from constraints on input other than the average power, such as the peak power constraint. In order to compare achievable rates with different constellations as well as the channel capacity…

Information Theory · Computer Science 2011-05-17 Shiro Ikeda , Kazunori Hayashi , Toshiyuki Tanaka

In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…

Information Theory · Computer Science 2007-10-02 Amichai Sanderovich , Shlomo Shamai , Yossef Steinberg

We consider the problem of covert communication over continuous-time additive white Gaussian noise (AWGN) channels under spectral mask constraints, wherein two legitimate parties attempt to communicate reliably in the presence of an…

Information Theory · Computer Science 2020-01-07 Qiaosheng , Zhang , Matthieu R. Bloch , Mayank Bakshi , Sidharth Jaggi