ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Bounds on the Feedback Capacity of the (d, \infty)-RLL Input-Constrained Binary Erasure Channel

Rameshwar, VA and Kashyap, N (2021) Bounds on the Feedback Capacity of the (d, \infty)-RLL Input-Constrained Binary Erasure Channel. In: 2021 IEEE International Symposium on Information Theory, ISIT 2021, 12-20 Jul 2021, Melbourne, pp. 290-295.

[img] PDF
ISIT_290-295_2021.pdf - Published Version
Restricted to Registered users only

Download (684kB) | Request a copy
Official URL: https://doi.org/10.1109/ISIT45174.2021.9518138

Abstract

The paper considers the input-constrained binary erasure channel (BEC) with causal, noiseless feedback. The channel input sequence respects the (d, \infty)-runlength limited (RLL) constraint, i.e., any pair of successive 1s must be separated by at least d 0s. We derive upper and lower bounds on the feedback capacity of this channel, given by single parameter maximization problems that differ exclusively in the domain of maximization. The results of Sabag et al. (2016) show that our bounds are tight for the case when d=1. For the case when d=2, our lower bound implies that the feedback capacity is equal to the capacity with non-causal knowledge of erasures, for ε\in 0,1-\frac{1}{2\log_{2}(3/2)}. The approach in this paper follows Sabag et al. (2017), by deriving single-letter bounds on the feedback capacity, based on output distributions supported on a finite Q-graph, which is a directed graph with edges labelled by output symbols. © 2021 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 for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords: Directed graphs; Graph structures, Binary erasure channel; Feedback capacity; Maximization problem; Noiseless feedback; Output distribution; Run length limiteds; Single parameter; Upper and lower bounds, Information theory
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 03 Dec 2021 08:41
Last Modified: 03 Dec 2021 08:41
URI: http://eprints.iisc.ac.in/id/eprint/70263

Actions (login required)

View Item View Item