On channel capacity per unit cost
Verdu, S.
Dept. of Electr. Eng., Princeton Univ., NJ;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Sep 1990
Volume: 36,
Issue: 5
On page(s): 1019-1030
ISSN: 0018-9448
References Cited: 22
CODEN: IETTAW
INSPEC Accession Number: 3758195
Digital Object Identifier: 10.1109/18.57201
Current Version Published: 2002-08-06
Abstract
Memoryless communication channels with arbitrary alphabets where
each input symbol is assigned a cost are considered. The maximum number
of bits that can be transmitted reliably through the channel per unit
cost is studied. It is shown that, if the input alphabet contains a
zero-cost symbol, then the capacity per unit cost admits a simple
expression as the maximum normalized divergence between two conditional
output distributions. The direct part of this coding theorem admits a
constructive proof via Stein's lemma on the asymptotic error probability
of binary hypothesis tests. Single-user, multiple-access, and
interference channels are studied
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
