The capacity of channels with feedback
Name
Tatikonda-2009-The Capacity of Chan.pdf
Size
587.49 KB
Format
Adobe PDF
Checksum (MD5)
03e59b22f1d15c025618d3685dda610f
Author(s)
Mitter, Sanjoy K.
Tatikonda, Sekhar
Date Issued
December 2008
Journal
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
Abstract
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.
Subjects
sufficient statistics
feedback
dynamic programming
directed information
Markov channels
Capacity
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/TIT.2008.2008147
