ON CHANNEL CAPACITY PER UNIT COST

被引：360

作者：

VERDU, S

机构：

[1] Department of Electrical Engineering, Princeton University, Princeton

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 05期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1109/18.57201

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. © 1990 IEEE

引用

页码：1019 / 1030

页数：12