To Feed or Not to Feedback

• Published in: IEEE transactions on information theory Vol. 60; no. 9; pp. 5150 - 5172
• Main Authors: Asnani, Himanshu, Permuter, Haim Henri, Weissman, Tsachy
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01-09-2014; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Applied sciences; Channel coding; Coding, codes; Communication; Decoding; Exact sciences and technology; Feedback; Feeds; Information theory; Information, signal and communications theory; Joints; Noise; Power capacitors; Probability; Probability distribution; Sampling, quantization; Signal and communications theory; Telecommunications and information theory; directed information; sampled feedback; intersymbol interference; Actions; Blahut-Arrimoto algorithm; indecomposable channel; causal conditioning; channel with states; feedback sampling; time-invariant deterministic feedback; cost constraints; Alphabet; Feedback regulation; Time invariance; Codec; Finite sets; Coding; Sampling; Deterministic approach; Availability; Lower bound; Coding circuit; Output signal; Decoding; Algorithm; Upper bound; Intersymbol interference; Causality
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2014.2331957

We study communication over finite state channels (FSCs), where the encoder and the decoder can control the availability or the quality of noise-free feedback, which is fed back from the decoder to the encoder. Specifically, the instantaneous feedback is a function of an action taken by the encoder, an action taken by the decoder, and the channel output. Encoder and decoder actions take values from finite alphabet sets and may be subject to average cost constraints. We prove capacity results for such a setting by constructing a sequence of codes, using a simple scheme based on code tree, which generates channel input symbols along with encoder and decoder actions. We prove that the limit of this sequence exists, and provide an upper bound on the maximum achievable rate. Our upper and lower bounds coincide and hence yield the capacity for the case where the probability of initial state is positive for all states. Next, 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. As a special case of our framework, we characterize the capacity of coding on the backward link in FSCs, i.e., when the decoder sends limited-rate instantaneous coded noise-free feedback on the backward link. Finally, we propose an extension of the Blahut-Arimoto algorithm for evaluating the capacity when actions can be cost constrained and demonstrate its application in a few examples. Among these examples are those of to feed or not to feedback where the encoder takes binary actions that determine whether the current channel output will be fed back to the encoder, with a constraint on the fraction of channel outputs that are fed back.