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 条
  • [41] Capacity theorems and coding strategies for discrete memoryless three-node relay channels with feedback
    Lang, Fei
    Wang, Baoyun
    Deng, Zhixiang
    Journal of Computational Information Systems, 2012, 8 (10): : 4017 - 4029
  • [42] Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation
    Dabora, Ron
    Goldsmith, Andrea J.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (12) : 5958 - 5983
  • [43] A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels
    Rao, K. Sankeerth
    Prabhakaran, Vinod M.
    2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 35 - 39
  • [44] New Upper Bounds on the Capacity of Primitive Diamond Relay Channels
    Wu, Xiugang
    Ozgur, Ayfer
    Peleg, Michael
    Shamai , Shlomo
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 579 - 583
  • [45] New results for the Shannon channel capacity in generalized fading channels
    Sagias, NC
    Tombras, GS
    Karagiannidis, GK
    IEEE COMMUNICATIONS LETTERS, 2005, 9 (02) : 97 - 99
  • [46] A New Approach to the Capacity Distribution of MIMO Rayleigh Fading Channels
    Zhu, Yonglan
    Kam, Pooi-Yuen
    Xin, Yan
    GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
  • [47] On the Equivalence of Shannon Capacity and Stable Capacity in Networks with Memoryless Channels
    Yao, Hongyi
    Ho, Tracey
    Effros, Michelle
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 503 - 507
  • [48] A New Lower Bound on the Ergodic Capacity of Optical MIMO Channels
    Bonnefoi, Remi
    Nafkha, Amor
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [49] A New View on Channel Capacity of MISO Frequency Selective Channels
    Wu, Liang
    Zhang, Zaichen
    IEEE COMMUNICATIONS LETTERS, 2011, 15 (12) : 1314 - 1316
  • [50] New Outer Bounds on the Capacity Region of Gaussian Interference Channels
    Shang, Xiaohu
    Kramer, Gerhard
    Chen, Biao
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 245 - +