English
Related papers

Related papers: Zero-rate feedback can achieve the empirical capac…

200 papers

We study finite alphabet channels with Unit Memory on the previous Channel Outputs called UMCO channels. We identify necessary and sufficient conditions, to test whether the capacity achieving channel input distributions with feedback are…

Information Theory · Computer Science 2017-01-05 Christos K. Kourtellaris , Charalambos D. Charalambous , Ioannis Tzortzis

Multiuser multiple-input multiple-output (MIMO) systems are a prime candidate for use in massive connection density in machine-type communication (MTC) networks. One of the key challenges of MTC networks is to obtain accurate channel state…

Information Theory · Computer Science 2019-04-25 Jiho Song , Byungju Lee , Song Noh , Jong-Ho Lee

We present a new technique to obtain outer-bounds on the capacity region of networks with ultra low-rate feedback. We establish a connection between the achievable rates in the forward channel and the minimum distortion that can be attained…

Information Theory · Computer Science 2021-05-11 Alireza Vahid

In their $1996$ paper Anantharam and Verd\'u showed that feedback does not increase the capacity of a queue when the service time is exponentially distributed. Whether this conclusion holds for general service times has remained an open…

Information Theory · Computer Science 2017-10-18 Laure Aptel , Aslan Tchamkerten

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are…

Information Theory · Computer Science 2016-09-08 Cheuk Ting Li , Abbas El Gamal

We consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios…

Systems and Control · Electrical Eng. & Systems 2021-09-01 Aritra Mitra , John A. Richards , Saurabh Bagchi , Shreyas Sundaram

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

We consider scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

In this paper, diffusion-based molecular commu- nication with ligand receptor receivers is studied. Information messages are assumed to be encoded via variations of the con- centration of molecules. The randomness in the ligand reception…

Information Theory · Computer Science 2015-11-10 Mehrdad Tahmasbi , Faramarz Fekri

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

Information Theory · Computer Science 2015-12-18 Jihad Fahs , Ibrahim Abou-Faycal

We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…

Information Theory · Computer Science 2022-05-16 Yihan Zhang , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate

Noncontrollable finite-state channels (FSCs) are FSCs in which the channel inputs have no influence on the channel states, i.e., the channel states evolve freely. Since single-letter formulae for the channel capacities are rarely available…

Information Theory · Computer Science 2016-11-18 Xiujie Huang , Aleksandar Kavcic , Xiao Ma

Recent work in data-driven control has led to methods that find stabilizing controllers directly from measurements of an unknown system. However, for multi-agent systems we are often interested in finding controllers that take their…

Optimization and Control · Mathematics 2022-08-01 Jaap Eising , Jorge Cortes

Feedback communication is studied from a control-theoretic perspective, mapping the communication problem to a control problem in which the control signal is received through the same noisy channel as in the communication problem, and the…

Information Theory · Computer Science 2010-06-29 Ehsan Ardestanizadeh , Massimo Franceschetti

We study memoryless interference channels with gradual data arrival in the absence of feedback. The information bits arrive at the transmitters according to independent and asynchronous~(Tx-Tx asynchrony) Bernoulli processes with average…

Information Theory · Computer Science 2021-08-23 Kamyar Moshksar

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…

Information Theory · Computer Science 2012-02-13 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry Pfister

In communications, unknown variables are usually modelled as random variables, and concepts such as independence, entropy and information are defined in terms of the underlying probability distributions. In contrast, control theory often…

Systems and Control · Computer Science 2014-01-14 Girish N. Nair

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number…

Information Theory · Computer Science 2008-03-11 Satish Babu Korada , Nicolas Macris