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 Bounds for One-Bit MIMO Gaussian Channels With Analog Combining
    Bernardo, Neil Irwin
    Zhu, Jingge
    Eldar, Yonina C.
    Evans, Jamie
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (11) : 7224 - 7239
  • [42] Energy-Efficient Optimal Power Allocation for Fading Cognitive Radio Channels: Ergodic Capacity, Outage Capacity, and Minimum-Rate Capacity
    Zhou, Fuhui
    Beaulieu, Norman C.
    Li, Zan
    Si, Jiangbo
    Qi, Peihan
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (04) : 2741 - 2755
  • [43] Capacity-Achieving Signal and Capacity of Gaussian Mixture Channels with 1-bit Output Quantization
    Rahman, Md Hasan
    Ranjbar, Mohammad
    Tran, Nghi H.
    Khanh Pham
    ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2020,
  • [44] Capacity Upper Bounds for Deletion-Type Channels
    Cheraghchi, Mahdi
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 493 - 506
  • [45] Capacity of Gaussian Channels With Energy Harvesting and Processing Cost
    Rajesh, Ramachandran
    Sharma, Vinod
    Viswanath, Pramod
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) : 2563 - 2575
  • [46] CAPACITY OF DISCRETE MEMORYLESS CHANNELS FOR LINEAR CODES.
    Sach, Tong Van
    Problems of control and information theory, 1987, 16 (02): : 113 - 123
  • [47] The Secrecy Capacity of MIMO Gaussian Channels with Finite Memory
    Shlezinger, Nir
    Zahavi, Daniel
    Murin, Yonathan
    Dabora, Ron
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 101 - 105
  • [48] Maximizing channel capacity for non-dispersive channels
    Graham, Robert F., Jr.
    3rd International Conference on Education and Information Systems: Technologies and Applications, Vol 2, Proceedings, 2005, : 60 - 65
  • [49] Effective capacity of multiple antenna channels: correlation and keyhole
    Zhong, C.
    Ratnarajah, T.
    Wong, K. -K.
    Alouini, M. -S.
    IET COMMUNICATIONS, 2012, 6 (12) : 1757 - 1768
  • [50] Sublinear Capacity Scaling Laws for Sparse MIMO Channels
    Raghavan, Vasanthan
    Sayeed, Akbar M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (01) : 345 - 364