On channel capacity per unit cost
Verdu, S.
Information Theory, IEEE Transactions on
Volume 36, Issue 5, Sep 1990 Page(s):1019 - 1030
Digital Object Identifier 10.1109/18.57201
Summary: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
View citation and abstract |
Cart
