A General Formula for Compound Channel Capacity
Date
2016Source
IEEE Transactions on Information TheoryVolume
62Issue
7Pages
3971-3991Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
A general formula, for the capacity of arbitrary compound channels with the receiver channel state information, is obtained using the information density approach. No assumptions of ergodicity, stationarity, or information stability are made and the channel state set is arbitrary. A direct (constructive) proof is given. To prove achievability, we generalize Feinstein Lemma to the compound channel setting, and to prove converse, we generalize Verdu-Han Lemma to the same compound setting. A notion of a uniform compound channel is introduced and the general formula is shown to reduce to the familiar sup-inf expression for such channels. As a by-product, the arbitrary varying channel capacity is established under maximum error probability and deterministic coding. Conditions are established under which the worst-case and compound channel capacities are equal, so that the full channel state information at the transmitter brings in no advantage. The compound inf-information rate plays a prominent role in the general formula. Its properties are studied and a link between the information-unstable and information-stable regimes of a compound channel is established. The results are extended to include -capacity of compound channels. Sufficient and necessary conditions for the strong converse to hold are given. © 2016 IEEE.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Conference Object
Control of jump linear systems over jump communication channels - Source-channel matching approach
Donic, S. Z.; Charalambous, Charalambos D. (2007)The control of partially observed jump linear systems over jump communication channels is investigated when the Plant State Information (I*SI) and the Channel Slate Information (CSI) are present at the transmitter and the ...
-
Conference Object
Sequential Necessary and Sufficient Conditions for optimal channel input distributions of channels with memory and feedback
Stavrou, P. A.; Charalambous, Charalambos D.; Kourtellaris, C. K. (Institute of Electrical and Electronics Engineers Inc., 2016)We derive Sequential Necessary and Sufficient Conditions (SNSC) for any channel input distribution equation to maximize directed information for channel distributions of the form equation, where Xn t {X0., Xn} and Yn t ...
-
Conference Object
On the capacity of a class of MIMO channels subject to normed uncertainty
Loyka, S.; Charalambous, Charalambos D. (2008)The compound capacity of uncertain MIMO channels is considered, when the channel is modeled by a class described by an induced norm constraint. Within this framework, two types of classes are investigated, namely, additive ...