English
Related papers

Related papers: On the Outage Capacity of a Practical Decoder Usin…

200 papers

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

In diffusion-based communication, as for molecular systems, the achievable data rate is very low due to the slow nature of diffusion and the existence of severe inter-symbol interference (ISI). Multiple-input multiple-output (MIMO)…

Information Theory · Computer Science 2018-01-23 S. Mohammadreza Rouzegar , Umberto Spagnolini

In many channel measurement applications, one needs to estimate some characteristics of the channels based on a limited set of measurements. This is mainly due to the highly time varying characteristics of the channel. In this contribution,…

Information Theory · Computer Science 2009-11-13 Øyvind Ryan , Merouane Debbah

We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook ${\cal C}$ consisting of strings of $n$ bits, and our model of the channel corresponds to an adversary who may delete…

Information Theory · Computer Science 2011-02-02 Ian A. Kash , Michael Mitzenmacher , Justin Thaler , Jonathan Ullman

We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits…

Information Theory · Computer Science 2016-01-19 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Eren Şaşoğlu , Rüdiger Urbanke

Interleaving is a mechanism universally used in wireless access technologies to alleviate the effect of channel correlation. In spite of its wide adoption, to the best of our knowledge, there are no analytical models proposed so far. In…

Information Theory · Computer Science 2018-01-31 Dmitri Moltchanov , Pavel Kustarev , Yevgeni Kucharyavy

Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, an approximately optimal…

Information Theory · Computer Science 2015-03-17 K. Pavan Srinath , B. Sundar Rajan

The second-order coding rate of the multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channel is studied. We tackle this problem via an information-spectrum approach and statistical bounds based on recent random matrix…

Information Theory · Computer Science 2016-11-17 Jakob Hoydis , Romain Couillet , Pablo Piantanida

We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the full linear code was used, with the motivation of…

Information Theory · Computer Science 2022-06-22 Neri Merhav , Georg Bocherer

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

In this work, a new energy-efficiency performance metric is proposed for MIMO (multiple input multiple output) point-to-point systems. In contrast with related works on energy-efficiency, this metric translates the effects of using finite…

Networking and Internet Architecture · Computer Science 2018-04-09 Vineeth S. Varma , Samson Lasaulce , Merouane Debbah , Salah Eddine Elayoubi

Transmission of a Gaussian source over a time-varying multiple-input multiple-output (MIMO) channel is studied under strict delay constraints. Availability of a correlated side information at the receiver is assumed, whose quality, i.e.,…

Information Theory · Computer Science 2015-05-27 Iñaki Estella Aguerri , Deniz Gündüz

The capacity of a channel with an energy-harvesting (EH) encoder and a finite battery remains an open problem, even in the noiseless case. A key instance of this scenario is the binary EH channel (BEHC), where the encoder has a unit-sized…

Information Theory · Computer Science 2025-02-12 Eli Shemuel , Oron Sabag , Haim H. Permuter

The point-to-point multiple-antenna channel is investigated in uncorrelated block fading environment with Rayleigh distribution. The maximum throughput and maximum expected-rate of this channel are derived under the assumption that the…

Information Theory · Computer Science 2012-01-17 Mahdi Zamani , Amir K. Khandani

Motivated by the recent advancement of quantum processors, we investigate quantum approximate optimization algorithm (QAOA) to employ quasi-maximum-likelihood (ML) decoding of classical channel codes. QAOA is a hybrid quantum-classical…

Information Theory · Computer Science 2019-03-07 Toshiki Matsumine , Toshiaki Koike-Akino , Ye Wang

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

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Information Theory · Computer Science 2012-10-26 Feng Xue

In general, reliable communication via multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) requires accurate channel estimation at the receiver. The existing literature largely focuses on denoising…

Signal Processing · Electrical Eng. & Systems 2025-08-12 Myeung Suk Oh , Seyyedali Hosseinalipour , Taejoon Kim , Christopher G. Brinton , David J. Love

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Information Theory · Computer Science 2023-05-17 Ioannis Papoutsidakis , Angela Doufexi , Robert J. Piechocki

Advanced channel decoders rely on soft-decision decoder inputs for which mutual information (MI) is the natural figure of merit. In this paper, we analyze an optical fiber system by evaluating MI as the maximum achievable rate of…

Information Theory · Computer Science 2015-11-20 Tobias Fehenberger , Norbert Hanik