English
Related papers

Related papers: Opportunistic capacity and error exponent regions …

200 papers

We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which we…

Information Theory · Computer Science 2008-03-12 Ron Dabora , Andrea Goldsmith

As a brain inspired wireless communication scheme, cognitive radio is a novel approach to promote the efficient use of the scarce radio spectrum by allowing some users called cognitive users to access the under-utilized spectrum licensed…

Information Theory · Computer Science 2014-02-21 Reza K. Farsani , Reza Ebrahimpour

The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of…

Information Theory · Computer Science 2019-10-29 Ghassen Zafzouf , Girish N. Nair , Jamie S. Evans

In this paper, a general binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are calculated for the case of an…

Information Theory · Computer Science 2018-01-09 Oron Sabag , Haim H. Permuter , Navin Kashyap

The Finite Transmission Feedback Information (FTFI) capacity is characterized for any class of channel conditional distributions $\big\{{\bf P}_{B_i|B^{i-1}, A_i} :i=0, 1, \ldots, n\big\}$ and $\big\{ {\bf P}_{B_i|B_{i-M}^{i-1}, A_i} :i=0,…

Information Theory · Computer Science 2016-08-22 Christos K. Kourtellaris , Charalambos D. Charalambous

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

The randomized fixe-composition with optimal decoding error exponents are studied \cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the…

Information Theory · Computer Science 2016-11-15 Cheng Chang

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

We investigate the achievable error probability in communication over an AWGN discrete time memoryless channel with noiseless delay-less rate-limited feedback. For the case where the feedback rate R_FB is lower than the data rate R…

Information Theory · Computer Science 2012-04-24 Reza Mirghaderi , Andrea Goldsmith , Tsachy Weissman

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

In interference channels, channel state information (CSI) can be exploited to reduce the interference signal dimensions and thus achieve the optimal capacity scaling, i.e. degrees of freedom, promised by the interference alignment…

Information Theory · Computer Science 2017-01-03 Zhinan Xu , Markus Hofer , Thomas Zemen

The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…

Quantum Physics · Physics 2009-11-10 Garry Bowen , Igor Devetak , Stefano Mancini

We consider the communication channel given by a fiber optical transmission line. We develop a method to perturbatively calculate the information capacity of a nonlinear channel, given the corresponding evolution equation. Using this…

Optics · Physics 2007-05-23 Evgenii Narimanov , Partha Mitra

We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the…

Information Theory · Computer Science 2017-02-07 Yasutada Oohama

The concept of optimal communication channels shapes our understanding of wave-based communication. Its analysis, however, always pertains to specific communication-domain geometries, without a general theory of scaling laws or fundamental…

Information Theory · Computer Science 2022-05-12 Zeyu Kuang , David A. B. Miller , Owen D. Miller

In this paper, we study the effect of channel output feedback on the sum capacity in a two-user symmetric deterministic interference channel. We find that having a single feedback link from one of the receivers to its own transmitter…

Information Theory · Computer Science 2009-08-31 Achaleshwar Sahai , Vaneet Aggarwal , Melda Yuksel , Ashutosh Sabharwal

We establish that the feedback capacity of the trapdoor channel is the logarithm of the golden ratio and provide a simple communication scheme that achieves capacity. As part of the analysis, we formulate a class of dynamic programs that…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Paul Cuff , Benjamin Van Roy , Tsachy Weissman

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions…

Information Theory · Computer Science 2016-11-15 Himanshu Asnani , Haim Permuter , Tsachy Weissman