The capacity of channels with feedback
Author(s)
Mitter, Sanjoy K.; Tatikonda, Sekhar
DownloadTatikonda-2009-The Capacity of Chan.pdf (587.4Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
In this paper, we introduce a general framework for treating channels with memory and feedback. First, we prove a general feedback channel coding theorem based on Massey's concept of directed information. Second, we present coding results for Markov channels. This requires determining appropriate sufficient statistics at the encoder and decoder. We give a recursive characterization of these sufficient statistics. Third, a dynamic programming framework for computing the capacity of Markov channels is presented. Fourth, it is shown that the average cost optimality equation (ACOE) can be viewed as an implicit single-letter characterization of the capacity. Fifth, scenarios with simple sufficient statistics are described. Sixth, error exponents for channels with feedback are presented.
Date issued
2008-12Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers
Citation
Tatikonda, S., and S. Mitter. “The Capacity of Channels With Feedback.” Information Theory, IEEE Transactions on 55.1 (2009): 323-349. © 2009 IEEE
Version: Final published version
ISSN
0018-9448
Keywords
sufficient statistics, feedback, dynamic programming, directed information, Markov channels, Capacity