English
Related papers

Related papers: Lower Bounds on Parameter Modulation-Estimation Un…

200 papers

Detailed derivations of two bounds of the minimum mean-square error (MMSE) of complex-valued multiple-input multiple-output (MIMO) systems are proposed for performance evaluation. Particularly, the lower bound is derived based on a…

Information Theory · Computer Science 2021-11-29 Chongjun Ouyang , Hongwen Yang

We consider distributed estimation of a Gaussian vector with a linear observation model in an inhomogeneous wireless sensor network, where a fusion center (FC) reconstructs the unknown vector, using a linear estimator. Sensors employ…

Information Theory · Computer Science 2016-08-24 Alireza Sani , Azadeh Vosoughi

Achievable error exponents for the one-way with noisy feedback and two-way AWGN channels are derived for the transmission of a finite number of messages $M$ using fixed block length $n$, under the almost sure (AS) and the expected block…

Information Theory · Computer Science 2019-01-23 Kenneth Palacio-Baus , Natasha Devroye

We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…

Information Theory · Computer Science 2009-09-24 Young-Han Kim , Amos Lapidoth , Tsachy Weissman

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

Information Theory · Computer Science 2015-03-17 Mojtaba Rahmati , Tolga M. Duman

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

We consider a signaling format where the information to be communicated from one or multiple transmitters to a receiver is modulated via a superposition of independent data streams. Each data stream is formed by error-correction encoding,…

Information Theory · Computer Science 2018-06-18 Dmitri Truhachev , Christian Schlegel

In the theory of wireless communications, average performance measures (APMs) are widely utilized to quantify the performance gains/impairments in various fading environments under various scenarios, and to comprehend how the factors…

Information Theory · Computer Science 2019-10-15 Ferkan Yilmaz

We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the transmitter has AWGN channels to an…

Information Theory · Computer Science 2013-10-18 Boulat A. Bash , Dennis Goeckel , Don Towsley

The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…

Information Theory · Computer Science 2016-04-22 Quoc Tuan Nguyen , D. T. Nguyen , Cong Lam Sinh

In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…

Information Theory · Computer Science 2021-10-06 Sadaf ul Zuhra , Samir M. Perlaza , Eitan Altman

We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum "pseudodistance") for coded modulation systems using linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive white…

Information Theory · Computer Science 2008-06-12 Vitaly Skachek , Mark F. Flanagan

A continuous-time Wiener phase noise channel with an integrate-and-dump multi-sample receiver is studied. A lower bound to the capacity with an average input power constraint is derived, and a high signal-to-noise ratio (SNR) analysis is…

Information Theory · Computer Science 2015-03-12 Luca Barletta , Gerhard Kramer

This paper investigates the capacity of a communications channel that, in addition to additive white Gaussian noise, also suffers from interference caused by a co-existing radar transmission. The radar interference (of short duty-cycle and…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

For a continuous-time additive white Gaussian noise (AWGN) channel with possible feedback, it has been shown that as sampling gets infinitesimally fine, the mutual information of the associative discrete-time channels converges to that of…

Information Theory · Computer Science 2020-08-26 Guangyue Han , Shlomo Shamai

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

The performance of maximum-likelihood (ML) decoded binary linear block codes over the AWGN channel is addressed via the tangential-sphere bound (TSB) and two of its recent improved versions. The paper is focused on the derivation of the…

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

We study the amplitude-constrained additive white Gaussian noise (AWGN) channel from the perspective of near-optimal input distributions. While it is known that the capacity-achieving input is discrete with finitely many mass points, the…

Information Theory · Computer Science 2026-04-17 Luca Barletta , Alex Dytso

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

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
‹ Prev 1 3 4 5 6 7 10 Next ›