English
Related papers

Related papers: Feedback Communication over Individual Channels

200 papers

Molecular communication is a biologically-inspired method of communication with attractive properties for microscale and nanoscale devices. In molecular communication, messages are transmitted by releasing a pattern of molecules at a…

Information Theory · Computer Science 2008-12-09 Andrew W. Eckford

In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission takes place in two phases: network training phase and data…

Information Theory · Computer Science 2008-12-09 Sami Akin , Mustafa Cenk Gursoy

We consider the optimal design of sequential transmission over broadcast channel with nested feedback. Nested feedback means that the channel output of the outer channel is also available at the decoder of the inner channel. We model the…

Information Theory · Computer Science 2010-04-08 Aditya Mahajan

The performance of Maximum a posteriori (MAP) estimation is studied analytically for binary symmetric multi-channel Hidden Markov processes. We reduce the estimation problem to a 1D Ising spin model and define order parameters that…

Statistical Mechanics · Physics 2015-06-11 Avik Halder , Ansuman Adhikary

A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into…

Information Theory · Computer Science 2017-12-27 Samia Kazemi , Ali Tajer

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple…

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

Establishing a communication system is hard because the intended meaning of a signal is unknown to its receiver when first produced, and the signaller also has no idea how that signal will be interpreted. Most theoretical accounts of the…

Computation and Language · Computer Science 2025-11-13 Richard A. Blythe , Casimir Fisch

We introduce a general framework for treating channels with memory and feedback. First, we generalize Massey's concept of directed information and use it to characterize the feedback capacity of general channels. Second, we present coding…

Information Theory · Computer Science 2007-07-13 Sekhar Tatikonda , Sanjoy Mitter

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Ivana Maric , Roy D. Yates , Predrag Spasojevic

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with…

Information Theory · Computer Science 2015-03-24 Lav R. Varshney , Sanjoy K. Mitter , Vivek K Goyal

The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the…

Information Theory · Computer Science 2016-05-19 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , Mohammad Reza Aref

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

End-to-end learning of communication systems enables joint optimization of transmitter and receiver, implemented as deep neural network-based autoencoders, over any type of channel and for an arbitrary performance metric. Recently, an…

Information Theory · Computer Science 2019-06-25 Mathieu Goutay , Fayçal Ait Aoudia , Jakob Hoydis

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…

Information Theory · Computer Science 2017-03-20 Mostafa Khoshnevisan , J Nicholas Laneman

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…

Information Theory · Computer Science 2016-11-18 Matthieu R. Bloch

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

We propose a flexible gradient tracking approach with adjustable computation and communication steps for solving distributed stochastic optimization problem over networks. The proposed method allows each node to perform multiple local…

Optimization and Control · Mathematics 2023-06-13 Yan Huang , Jinming Xu
‹ Prev 1 3 4 5 6 7 10 Next ›