On channel capacity per unit cost
- 1 September 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (5), 1019-1030
- https://doi.org/10.1109/18.57201
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.Keywords
This publication has 11 references indexed in Scilit:
- Capacity and error exponent for the direct detection photon channel. IIIEEE Transactions on Information Theory, 1988
- Point Processes and QueuesSpringer Series in Statistics, 1981
- Capacity and cutoff rate for Poisson-type channelsIEEE Transactions on Information Theory, 1980
- Multiple user information theoryProceedings of the IEEE, 1980
- An iteration method for calculating the relative capacityInformation and Control, 1979
- Optical Channels: Practical Limits with Photon CountingIEEE Transactions on Communications, 1978
- $I$-Divergence Geometry of Probability Distributions and Minimization ProblemsThe Annals of Probability, 1975
- On the capacity of a discrete, constant channelInformation and Control, 1967
- A lower bound for discrimination information in terms of variation (Corresp.)IEEE Transactions on Information Theory, 1967
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952