Finite State Channels With Time-Invariant Deterministic Feedback

  title={Finite State Channels With Time-Invariant Deterministic Feedback},
  author={Haim H. Permuter and Tsachy Weissman and Andrea J. Goldsmith},
  journal={IEEE Transactions on Information Theory},
We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite alphabet, we find a sequence of achievable rates and a sequence of upper bounds on the capacity. The achievable rates and the upper bounds are computable for any N, and the limits of the sequences exist. We show that when the probability of the initial state is… 

Figures from this paper

To Feed or Not to Feedback
The capacity is given for indecomposable channels without intersymbol interference as the limit of normalized directed information between the input and output sequences, maximized over an appropriate set of causally conditioned distributions.
Capacity Region of the Finite-State Multiple-Access Channel With and Without Feedback
The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize
Capacity of Binary Symmetric POST Channels
It is shown that the non feedback capacity of the POST(a, b) channel equals its feedback capacity, despite the memory of the channel, because the induced output distribut ion, when maximizing the directed information in the presence of feedback, can be achieved by an input distribution that does not utilize of the feedback.
Channel Capacity in the Presence of Feedback and Side Information
An inner bound is provided which demonstrates the rate required to transmit this information to the receiver in order to get a tight converse for the sum-rate capacity of the Shannon-theoretic fundamental limits of channel coding.
Coding with frame synchronization for finite-state channels with feedback
This work characterize a large family of indecomposable FSCs for which the channel state is determined by a finite number of the most recent channel inputs and outputs and derive their feedback capacity, and shows that the feedback capacity of these channels is independent of the initial channel state.
Feedback Capacity of Finite-State Channels with Causal State Known at the Encoder
A single-letter computable lower bound is derived based on auxiliary directed graphs that are used to provide an auxiliary structure for the channel outputs and are called Q-graphs, with achievable rates that outperform the best achievable rates known in the literature.
Finite-State Channel with Feedback and Causal State Information Available at the Encoder
It is shown that the achievable rate can be formulated as an infinite-horizon average-reward Markov decision process (MDP), and the MDP formulation constitutes a rigorous tool to numerically compute and analytically prove achievable rates.
Upper Bounds on the Capacities of Noncontrollable Finite-State Channels With/Without Feedback
This paper takes the delayed channel state as part of the channel input and then defines the directed information rate from the new channel input to the channel output sequence to derive a series of upper bounds on the capacities of noncontrollable FSCs with/without feedback.
Capacity results on the finite state Markov wiretap channel with delayed state feedback
  • Bin Dai, Zheng Ma
  • Computer Science
    2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2017
This paper measures the eavesdropper's uncertainty about the transmitted message by equivocation, and provides inner and outer bounds on the capacity-equivocation region of this novel model, and shows that these bounds meet if the channel output for the eavesdrop is a degraded version of that for the legitimate receiver.
Capacity of a POST Channel With and Without Feedback
It is shown that the nonfeedback capacity of the POST(α) channel equals its feedback capacity, despite the memory of the channel, and that, in general, feedback may increase the capacity of a POST channel.


Capacity of Finite-State Channels with Time-Invariant Deterministic Feedback
It is shown that when the channel is indecomposable, and has no intersymbol interference, its capacity is given by the limit of the maximum of the (normalized) directed information between the input XN and the output YN.
Feedback capacity of finite-state machine channels
The feedback capacity computation may be formulated as an average-reward-per-stage stochastic control problem, which is solved by dynamic programming and the value of the capacity is easily estimated using Markov chain Monte Carlo methods.
On the capacity of some channels with channel state information
This paper deals with channels with causal transmitter CSI, and is interested in finding conditions such that the capacity achieving codes can be constructed directly on the channel input alphabet.
The capacity of finite-State Markov Channels With feedback
  • Jun Chen, T. Berger
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2005
The corresponding converse coding theorem and direct coding theorem are proved and the optimal stationary and nonstationary input processes that maximize the long-term directed mutual information are constructed.
The Compound Channel Capacity of a Class of Finite-State Channels
The compound channel capacity of a class of Gilbert-Elliott channels is derived from an expression for the highest achievable rate of a given family of finite-state channels.
The Capacity of Channels With Feedback
A general feedback channel coding theorem based on Massey's concept of directed information is proved and the average cost optimality equation (ACOE) can be viewed as an implicit single-letter characterization of the capacity.
A general formula for channel capacity
A formula for the capacity of arbitrary single-user channels without feedback is proved and capacity is shown to equal the supremum, over all input processes, of the input-output inf-information rate defined as the liminf in probability of the normalized information density.
The zero error capacity of a noisy channel
  • C. Shannon
  • Computer Science
    IRE Trans. Inf. Theory
  • 1956
It is shown that while the ordinary capacity of a memoryless channel with feedback is equal to that of the same channel without feedback, the zero error capacity may be greater and a solution is given to the problem of evaluating C_oF.
Capacity of Markov Channels with Receiver CSI and Delayed Feedback
This work determines the capacity of finite-state Markov channels as a function of the feedback delay assuming perfect channel state information at the receiver.