Input-constrained erasure channels: Mutual information and capacity
Input-constrained erasure channels: Mutual information and capacity
复制标题
输入受限的擦除通道：互信息和容量
DOI：
10.1109/isit.2014.6875399
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
G. Han
中科院分区：
文献类型：
--
作者：
Yonglong Li;G. Han
在本文中，我们推导出一个显式的隐马尔可夫链的熵率，观察时，马尔可夫链通过一个无记忆擦除通道。这一结果自然会导致一个明确的公式与马尔可夫输入的无记忆擦除信道的互信息率。此外，如果输入马氏链是一阶的，并且支持在（1，∞）-游程长度受限（RLL）约束下，我们证明了互信息率关于所选参数是严格凹的.然后，我们应用最近的算法[1]来近似计算一阶噪声约束信道容量和相应的容量实现分布。
In this paper, we derive an explicit formula for the entropy rate of a hidden Markov chain, observed when the Markov chain passes through a memoryless erasure channel. This result naturally leads to an explicit formula for the mutual information rate of memoryless erasure channels with Markovian inputs. Moreover, if the input Markov chain is of first-order and supported on the (1, ∞)-run length limited (RLL) constraint, we show that the mutual information rate is strictly concave with respect to a chosen parameter. Then we apply a recent algorithm [1] to approximately compute the first-order noisy constrained channel capacity and the corresponding capacity-achieving distribution.