English
Related papers

Related papers: Linear Correction of Mismatched L-values in BICM r…

200 papers

Error correction codes are an integral part of communication applications, boosting the reliability of transmission. The optimal decoding of transmitted codewords is the maximum likelihood rule, which is NP-hard due to the curse of…

Information Theory · Computer Science 2021-02-22 Nir Raviv , Avi Caciularu , Tomer Raviv , Jacob Goldberger , Yair Be'ery

Coded modulation is a key technique to increase the spectral efficiency of coherent optical communication systems. Two popular strategies for coded modulation are turbo trellis-coded modulation (TTCM) and bit-interleaved coded modulation…

Information Theory · Computer Science 2017-10-12 Eric Sillekens , Alex Alvarado , Chigo Okonkwo , Benn C. Thomsen

In this paper, linear index codes with multiple senders are studied, where every receiver receives encoded messages from all senders. A new fitting matrix for the multiple senders is proposed and it is proved that the minimum rank of the…

Information Theory · Computer Science 2019-09-19 Jae-Won Kim , Jong-Seon No

Quantum error correction offers a promising path for performing quantum computations with low errors. Although a fully fault-tolerant execution of a quantum algorithm remains unrealized, recent experimental developments, along with…

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

Information Theory · Computer Science 2021-03-29 Anelia Somekh-Baruch

It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local…

Information Theory · Computer Science 2016-11-15 Mark F. Flanagan

Machine learning (ML) starts to be widely used to enhance the performance of multi-user multiple-input multiple-output (MU-MIMO) receivers. However, it is still unclear if such methods are truly competitive with respect to conventional…

Information Theory · Computer Science 2021-07-01 Mathieu Goutay , Fayçal Ait Aoudia , Jakob Hoydis , Jean-Marie Gorce

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

Information Theory · Computer Science 2025-05-28 Priyanka Patel , Francesc Molina , Albert Guillén i Fàbregas

Straightforward methods for adapting the familiar chi^2 statistic to histograms of discrete events and other Poisson distributed data generally yield biased estimates of the parameters of a model. The bias can be important even when the…

Data Analysis, Statistics and Probability · Physics 2014-03-12 Joseph W. Fowler

Linear programming (LP) decoding approximates maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem. The LP problem is defined by a set of…

Information Theory · Computer Science 2013-01-01 Xiaojie Zhang , Paul H. Siegel

Index coded PSK modulation over an AWGN broadcast channel, for a given index coding problem (ICP) is studied. For a chosen index code and an arbitrary mapping (of broadcast vectors to PSK signal points), we have derived a decision rule for…

Information Theory · Computer Science 2017-03-10 Divya U. S. , B. Sundar Rajan

We study the maximum sum rate optimization problem in the multiple-input multiple-output interfering broadcast channel. The multiple-antenna transmitters and receivers are assumed to have perfect channel state information. In this setting,…

Information Theory · Computer Science 2015-07-07 Rami Mochaourab , Mats Bengtsson

A new property which relies on the linear programming (LP) decoder, the approximate maximum-likelihood certificate (AMLC), is introduced. When using the belief propagation decoder, this property is a measure of how close the decoded…

Information Theory · Computer Science 2011-05-17 Idan Goldenberg , David Burshtein

Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…

Quantum Physics · Physics 2018-10-23 Ben Criger , Imran Ashraf

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-17 Pablo Piantanida , Sajad Sadough , Pierre Duhamel

A joint robust transmit/receive adaptive beamforming for multiple-input multipleoutput (MIMO) radar based on probability-constrained optimization approach is developed in the case of Gaussian and arbitrary distributed mismatch present in…

Information Theory · Computer Science 2016-03-03 Weiyu Zhang , Sergiy A. Vorobyov

Modern spacecraft communication systems rely on concatenated error correction schemes, typically combining convolutional and Reed-Solomon (RS) codes. This paper presents a decoder-side method that uses a machine learning model to estimate…

Information Theory · Computer Science 2025-09-12 Michael Greenwood , Robert Hunter

Generalized Linear Models (GLMs) have been used extensively in statistical models of spike train data. However, the maximum likelihood estimates of the model parameters and their uncertainty, can be challenging to compute in situations…

Applications · Statistics 2021-09-07 Sahand Farhoodi , Uri Eden

In this paper, we propose a new approach to justify a round-off error impact on the accuracy of the linear least squares (LS) solution using Cholesky decomposition. This decomposition is widely employed to inverse a matrix in the linear…

Information Theory · Computer Science 2024-04-09 Alexander Osinsky , Roman Bychkov , Mikhail Trefilov , Vladimir Lyashev , Andrey Ivanov

Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder…

Information Theory · Computer Science 2016-09-29 Neri Merhav