论文标题
输入驱动的有限状态通道的能力的可计算下限
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels
论文作者
论文摘要
本文研究了输入驱动的有限状态通道的能力，即其当前状态是先前状态和当前输入的时间不变的确定性功能的通道。我们使用在最大反向定向的信息速率上的动态编程公式降低了这种通道的容量。我们表明，可以通过明确求解相应的钟声方程来简化基于动态编程的界限。特别是，我们为$（d，k）$ - 运行限制的输入约束的二进制对称和二进制擦除通道的容量提供了分析下限。此外，我们根据内存的输入分布提供了一个单书的下限。
This paper studies the capacities of input-driven finite-state channels, i.e., channels whose current state is a time-invariant deterministic function of the previous state and the current input. We lower bound the capacity of such a channel using a dynamic programming formulation of a bound on the maximum reverse directed information rate. We show that the dynamic programming-based bounds can be simplified by solving the corresponding Bellman equation explicitly. In particular, we provide analytical lower bounds on the capacities of $(d, k)$-runlength-limited input-constrained binary symmetric and binary erasure channels. Furthermore, we provide a single-letter lower bound based on a class of input distributions with memory.
