Computable lower bounds for capacities of input-driven finite-state channels
VA Rameshwar, N Kashyap - 2020 IEEE International …, 2020 - ieeexplore.ieee.org
This paper studies the capacities of input-driven finite-state channels, ie, 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 …
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 …
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels
V Arvind Rameshwar, N Kashyap - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
This paper studies the capacities of input-driven finite-state channels, ie, 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 …
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 …
以上显示的是最相近的搜索结果。 查看全部搜索结果