Feedback Capacity of the Compound Channel
Name
Shrader-2007-Feedback Capacity of.pdf
Size
367.4 KB
Format
Adobe PDF
Checksum (MD5)
d4b66d01db6f8142de70c026b700d97b
Author(s)
Shrader, Brooke E.
Permuter, Haim
Date Issued
July 2009
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers
Citation
Shrader, B., and H. Permuter. “Feedback Capacity of the Compound Channel.” Information Theory, IEEE Transactions on 55.8 (2009): 3629-3644. © 2009 IEEE
Version
Final published version
Abstract
In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant deterministic feedback. We consider the use of fixed length block codes over the compound channel. Our achievability result includes a proof of the existence of a universal decoder for the family of FSCs with feedback. As a consequence of our capacity result, we show that feedback does not increase the capacity of the compound Gilbert-Elliot channel. Additionally, we show that for a stationary and uniformly ergodic Markovian channel, if the compound channel capacity is zero without feedback then it is zero with feedback. Finally, we use our result on the FSC to show that the feedback capacity of the memoryless compound channel is given by inf[subscript thetas] max[subscript QX] I(X; Y |thetas).
Subjects
universal decoder
types of code-trees
finite-state channel (FSC)
feedback capacity
directed information
compound channel
code-trees
Sanov's theorem
Pinsker's inequality
Gilbert–Elliot channel
Causal conditioning probability
MIT Department
Lincoln Laboratory
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.2009.2023727
