A GENERAL FORMULA FOR CHANNEL CAPACITY

A GENERAL FORMULA FOR CHANNEL CAPACITY
复制标题

DOI:
10.1109/18.335960
复制
发表时间:
1994-07-01
影响因子:
2.5
通讯作者:
HAN, TS
HAN, TS
中科院分区:
计算机科学2区
文献类型:
--
作者:
VERDU, S;HAN, TS

文献摘要

被引文献

相似文献

无反馈的任意单用户信道(不一定是信息稳定的、平稳的等)的容量公式。被证明了。容量等于上确界,在所有的输入过程中,输入输出信息率定义为liminf的概率的归一化信息密度。这一结果的关键是一个新的匡威方法的基础上一个简单的新的下界的错误概率的m-ary假设检验之间的等概率假设。给出了强匡威成立的一个充要条件,并给出了是容量元的一般表达式。
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.