Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels

被引:31
|
作者
Effros, Michelle [1 ]
Goldsmith, Andrea [2 ]
Liang, Yifan [3 ]
机构
[1] CALTECH, Dept Elect Engn, Pasadena, CA 91125 USA
[2] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
[3] Goldman Sachs & Co, New York, NY 10004 USA
关键词
Capacity versus outage; composite channel; expected capacity; information density; separation; Shannon capacity; BROADCAST CHANNELS; FADING CHANNELS; SUM CAPACITY; PART II; DISTORTION; THROUGHPUT; FORMULA; CODES;
D O I
10.1109/TIT.2010.2048456
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with a distribution characterizing the probability that each channel is in operation. The Shannon capacity of a channel is the highest rate asymptotically achievable with arbitrarily small error probability. Under this definition, the transmission strategy used to achieve the capacity must achieve arbitrarily small error probability for all channels in the collection comprising the composite channel. The resulting capacity is dominated by the worst channel in its collection, no matter how unlikely that channel is. We, therefore, broaden the definition of capacity to allow for some outage. The capacity versus outage is the highest rate asymptotically achievable with a given probability of decoder-recognized outage. The expected capacity is the highest average rate asymptotically achievable with a single encoder and multiple decoders, where channel side information determines the channel in use. The expected capacity is a generalization of capacity versus outage since codes designed for capacity versus outage decode at one of two rates ( rate zero when the channel is in outage and the target rate otherwise) while codes designed for expected capacity can decode at many rates. Expected capacity equals Shannon capacity for channels governed by a stationary ergodic random process but is typically greater for general channels. The capacity versus outage and expected capacity definitions relax the constraint that all transmitted information must be decoded at the receiver. We derive channel coding theorems for these capacity definitions through information density and provide numerical examples to highlight their connections and differences. We also discuss the implications of these alternative capacity definitions for end-to-end distortion, source-channel coding, and separation.
引用
收藏
页码:3069 / 3087
页数:19
相关论文
共 50 条
  • [31] Capacity of Steganographic Channels
    Harnisen, Jeremiah J.
    Pearlman, William A.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (04) : 1775 - 1792
  • [32] Parenting capacity: Definitions, indicators, and assessment
    Zumbach, Jelena
    Oster, Anna
    ZEITSCHRIFT FUR KINDER-UND JUGENDPSYCHIATRIE UND PSYCHOTHERAPIE, 2021, 49 (01): : 37 - 50
  • [33] ON VARIOUS DEFINITIONS OF CAPACITY AND RELATED NOTIONS
    OHTSUKA, M
    NAGOYA MATHEMATICAL JOURNAL, 1967, 30 (AUG) : 121 - &
  • [34] Capacity and capacity sensitivity of soft output optical channels
    Hamkins, J
    Dolinar, S
    Divsalar, D
    Pollara, F
    FREE-SPACE LASER COMMUNICATION TECHNOLOGIES XIII, 2001, 4272 : 170 - 180
  • [35] CAPACITY AND ZERO-ERROR CAPACITY OF ISING CHANNELS
    BERGER, T
    BONOMI, F
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (01) : 173 - 180
  • [36] Capacity Analysis of Multibeam Joint Decoding over Composite Satellite Channels
    Christopoulos, Dimitrios
    Chatzinotas, Symeon
    Matthaiou, Michail
    Ottersten, Bjorn
    2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 1795 - 1799
  • [37] A Comprehensive Analysis of the Achievable Channel capacity in F Composite Fading Channels
    Yoo, Seong Ki
    Sofotasios, Paschalis C.
    Cotton, Simon L.
    Muhaidat, Sami
    Lopez-Martinez, F. Javier
    Romero-Jerez, Juan M.
    Karagiannidis, George K.
    IEEE ACCESS, 2019, 7 : 34078 - 34094
  • [38] Capacity theorems for the Gaussian zigzag channel
    Chong, Hon Fah
    Motani, Mehul
    Garg, Hari Krishna
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 1277 - +
  • [39] Representation theorems for WVaR with respect to a capacity
    Yuan, Hongmin
    Jiang, Long
    Tian, Dejian
    STATISTICS & PROBABILITY LETTERS, 2020, 158
  • [40] Capacity Theorems for Distributed Index Coding
    Liu, Yucheng
    Sadeghi, Parastoo
    Arbabjolfaei, Fatemeh
    Kim, Young-Han
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (08) : 4653 - 4680