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 条
  • [21] Definitions of resistance and deformation capacity for non-sway steel and composite structures
    Steenhuis, C.M.
    Vrouwenvelder, A.C.W.M.
    Van Herwijnen, F.
    Snijder, H.H.
    Heron, 2002, 47 (01): : 3 - 27
  • [22] Definitions intermezzo: Ten annotated definitions of capacity building
    Alaerts, GJ
    WATER SECTOR CAPACITY BUILDING: CONCEPTS AND INSTRUMENTS, 1999, : 85 - 88
  • [23] Capacity theorems for the "Z" channel
    Chong, Hon-Fah
    Motani, Mehul
    Garg, Hari Krishna
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (04) : 1348 - 1365
  • [24] CAPACITY THEOREMS FOR THE RELAY CHANNEL
    COVER, TM
    ELGAMAL, AA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (05) : 572 - 584
  • [25] On the Capacity of Duplication Channels
    Ramezani, Mahdi
    Ardakani, Masoud
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (03) : 1020 - 1027
  • [26] ON THE CAPACITY OF A CASCADE OF CHANNELS
    KIELY, AB
    COFFEY, JT
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1310 - 1321
  • [27] ON CHANNELS WITHOUT A CAPACITY
    WOLFOWITZ, J
    INFORMATION AND CONTROL, 1963, 6 (01): : 49 - &
  • [28] CAPACITY OF PRODUCT OF CHANNELS
    WYNER, AD
    INFORMATION AND CONTROL, 1966, 9 (04): : 423 - &
  • [29] THE CAPACITY OF A CLASS OF CHANNELS
    BLACKWELL, D
    BREIMAN, L
    THOMASIAN, AJ
    ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (04): : 1229 - 1241
  • [30] The Capacity of Channels With Feedback
    Tatikonda, Sekhar
    Mitter, Sanjoy
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 323 - 349