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 条
  • [1] Capacity Theorems for Relay Channels with ISI
    Marina, Ninoslav
    Kavcic, Aleksandar
    Gaarder, N. Thomas
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 479 - 483
  • [2] Capacity Theorems for Covert Bosonic Channels
    Bullock, Michael S.
    Gagatsos, Christos N.
    Bash, Boulat A.
    2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [3] Capacity theorems for channels with designable feedback
    Liu, Youjian
    CONFERENCE RECORD OF THE FORTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1-5, 2007, : 1936 - 1940
  • [4] Capacity theorems for cooperative relay broadcast channels
    Liang, Yingbin
    Kramer, Gerhard
    2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-4, 2006, : 1719 - 1724
  • [5] Capacity theorems for quantum multiple access channels
    Yard, J
    Devetak, I
    Hayden, P
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 884 - 888
  • [6] Capacity theorems for relay channels with confidential messages
    Ohama, Yasutada
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 926 - 930
  • [7] Capacity definitions of general channels with receiver side information
    Effros, Michelle
    Goldsmith, Andrea
    Liang, Yifan
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 921 - +
  • [8] Bounds and Capacity Theorems for Cognitive Interference Channels With State
    Duan, Ruchen
    Liang, Yingbin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (01) : 280 - 304
  • [9] Capacity definitions and coding strategies for general channels with receiver side information
    Effros, M
    Goldsmith, A
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 39 - 39
  • [10] CAPACITY AS A SUBLINEAR FUNCTIONAL GENERALIZING AN INTEGRAL
    FUGLEDE, B
    MATEMATISK-FYSISKE MEDDELELSER UDGIVET AF DET KONGELIGE DANSKE VIDENSKABERNES SELSKAB, 1971, 38 (07): : 1 - &