Title :
A general formula for compound channel capacity
Author :
Sergey Loyka;Charalambos D. Charalambous
Author_Institution :
School of Electrical Engineering and Computer Science, University of Ottawa, Ontario, Canada
fDate :
6/1/2015 12:00:00 AM
Abstract :
A general formula for the capacity of arbitrary compound channels, which are not necessarily ergodic, stationary or information-stable, is obtained using the information density approach. 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. This extends the general formula for channel capacity in [8] to arbitrary compound channels (not necessarily finite-state or countable).
Keywords :
"Compounds","Channel capacity","Uncertainty","Error probability","Transmitters","Channel models","Receivers"
Conference_Titel :
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN :
2157-8117
DOI :
10.1109/ISIT.2015.7282508