English
Related papers

Related papers: Estimating Channel Parameters from the Syndrome of…

200 papers

We consider the design of identical one-bit probabilistic quantizers for distributed estimation in sensor networks. We assume the parameter-range to be finite and known and use the maximum Cram\'er-Rao Lower Bound (CRB) over the…

Information Theory · Computer Science 2012-06-01 Swarnendu Kar , Hao Chen , Pramod K. Varshney

An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first…

Information Theory · Computer Science 2019-03-19 Yu Tsunoda , Yuichiro Fujiwara , Hana Ando , Peter Vandendriessche

We propose a method for estimating channel parameters from RSSI measurements and the lost packet count, which can work in the presence of losses due to both interference and signal attenuation below the noise floor. This is especially…

Machine Learning · Computer Science 2015-04-07 Silvija Kokalj-Filipovic , Larry Greenstein

This paper introduces an expectation-maximization (EM) algorithm within a wavelet domain Bayesian framework for semi-blind channel estimation of multiband OFDM based UWB communications. A prior distribution is chosen for the wavelet…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Mahieddine Ichir , Emmanuel Jaffrot , Pierre Duhamel

We introduce combinatorial interpretability, a methodology for understanding neural computation by analyzing the combinatorial structures in the sign-based categorization of a network's weights and biases. We demonstrate its power through…

Machine Learning · Computer Science 2025-05-07 Micah Adler , Dan Alistarh , Nir Shavit

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

A linear-programming decoder for \emph{nonbinary} expander codes is presented. It is shown that the proposed decoder has the maximum-likelihood certificate properties. It is also shown that this decoder corrects any pattern of errors of a…

Information Theory · Computer Science 2016-11-17 Vitaly Skachek

Neural networks are increasingly used to estimate parameters in quantitative MRI, in particular in magnetic resonance fingerprinting. Their advantages over the gold standard non-linear least square fitting are their superior speed and their…

In recent years, infinite-dimensional methods have been introduced for the Gaussian channels estimation. The aim of this paper is to study the application of similar methods to Poisson channels. In particular we compute the Bayesian…

Information Theory · Computer Science 2009-02-11 Anthony Reveillac

We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This notion generalizes previous definitions of perfect and quasi-perfect codes and encompasses maximum…

Information Theory · Computer Science 2018-05-28 Gonzalo Vazquez-Vilar , Albert Guillén i Fàbregas , Sergio Verdú

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

The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) decoding rule is investigated. It is proved that the ratio of…

Information Theory · Computer Science 2023-05-10 Ling-Hua Chang , Po-Ning Chen , Fady Alajaji

We consider the problem of detecting the presence of a spatially correlated multichannel signal corrupted by additive Gaussian noise (i.i.d across sensors). No prior knowledge is assumed about the system parameters such as the noise…

Information Theory · Computer Science 2013-04-19 Vidyadhar Upadhya , Devendra Jalihal

We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (``teacher'') that transmits information through a memoryless channel to the decoder (``student''), who…

Information Theory · Computer Science 2025-05-15 Yan Hao Ling , Zhouhao Yang , Jonathan Scarlett

The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this work, we study a generalized version of this…

Information Theory · Computer Science 2016-11-17 Neri Merhav

This paper addresses the problem of coding a continuous random source correlated with another source which is only available at the decoder. The proposed approach is based on the extension of the channel coding concept of syndrome from the…

Information Theory · Computer Science 2007-10-11 Lorenzo Cappellari

A parameter estimation problem is considered for a diagonaliazable stochastic evolution equation using a finite number of the Fourier coefficients of the solution. The equation is driven by additive noise that is white in space and…

Probability · Mathematics 2008-04-03 Igor Cialenco , Sergey Lototsky , Jan Pospisil

This paper proposes a parametric-based network architecture for joint channel estimation and data detection in communications systems with hardware impairments. This architecture is composed of a data-augmented layer, a custom soft…

Signal Processing · Electrical Eng. & Systems 2022-06-16 Vincent Choqueuse , Alexandru Frunza , Adel Belouchrani , Stéphane Azou , Pascal Morel

We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the…

Information Theory · Computer Science 2016-11-17 Neri Merhav

While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary…

Quantum Physics · Physics 2022-07-20 Yingkai Ouyang , Ching-Yi Lai