CaltechAUTHORS
  A Caltech Library Service

Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels

Effros, Michelle and Goldsmith, Andrea and Liang, Yifan (Ethan) (2010) Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels. IEEE Transactions on Information Theory, 56 (7). pp. 3069-3087. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847

[img]
Preview
PDF - Published Version
See Usage Policy.

685Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847

Abstract

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/TIT.2010.2048456 DOIUNSPECIFIED
Additional Information:© 2010 IEEE. Manuscript received April 24, 2008; revised February 28, 2010. Current version published June 16, 2010. This work was supported by the DARPA ITMANET program under grant number 1105741-1-TFIND. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Cambridge, MA, August 1998; the IEEE International Symposium on Information Theory, Nice, France, June 2007; and the IEEE Information Theory Workshop, Lake Tahoe, CA, September 2007.
Funders:
Funding AgencyGrant Number
Defense Advanced Research Projects Agency - Information Theory for Mobile Ad-Hoc Networks (DARPA IT-MANET)1105741-1-TFIND
Subject Keywords:Capacity versus outage; composite channel; expected capacity; information density; separation; Shannon capacity
Issue or Number:7
Record Number:CaltechAUTHORS:20100709-094818847
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:18956
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:09 Jul 2010 16:56
Last Modified:03 Oct 2019 01:50

Repository Staff Only: item control page