A GENERAL FORMULA FOR CHANNEL CAPACITY

被引：507

作者：

VERDU, S ^{[1
]}

HAN, TS ^{[1
]}

机构：

[1] UNIV ELECTROCOMMUN TOKYO, GRAD SCH INFORMAT SYST, TOKYO 182, JAPAN

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1994年 / 40卷 / 04期

基金：

美国国家科学基金会;

关键词：

SHANNON THEORY; CHANNEL CAPACITY; CHANNEL CODING THEOREM; CHANNELS WITH MEMORY; STRONG CONVERSE;

D O I：

10.1109/18.335960

中图分类号：

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

学科分类号：

0812 ;

摘要：

A formula for the capacity of arbitrary single-user channels without feedback (not necessarily information stable, stationary, etc.) is proved. Capacity is shown to equal the supremum, over all input processes, of the input-output information rate defined as the liminf in probability of the normalized information density. The key to this result is a new converse approach based on a simple new lower bound on the error probability of m-ary hypothesis tests among equiprobable hypotheses. A necessary and sufficient condition for the validity of the strong converse is given, as well as general expressions for is-an-element-of-capacity.

引用

页码：1147 / 1157

页数：11