Rameshwar, VA and Kashyap, N (2020) Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. In: 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21-26 July 2020, Los Angeles; United States, pp. 2002-2007.
PDF
iee_int_sym_inf_the_pro_2020_2002-2007_2020.pdf - Published Version Restricted to Registered users only Download (428kB) | Request a copy |
Abstract
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. © 2020 IEEE.
Item Type: | Conference Paper |
---|---|
Publication: | IEEE International Symposium on Information Theory - Proceedings |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Additional Information: | The copyright of this article belongs to Institute of Electrical and Electronics Engineers Inc. |
Keywords: | Information theory, Bellman equations; Binary erasure channel; Current input; Deterministic functions; Directed information rate; Finite state channels; Run length limiteds; Time invariants, Dynamic programming |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 19 Oct 2020 06:23 |
Last Modified: | 19 Oct 2020 06:23 |
URI: | http://eprints.iisc.ac.in/id/eprint/66612 |
Actions (login required)
View Item |