An Optimal Coding Scheme for the BIBO Channel with a No-Repeated-Ones Input Constraint

Sabag, Oron and Permuter, Haim H and Kashyap, Navin (2017) An Optimal Coding Scheme for the BIBO Channel with a No-Repeated-Ones Input Constraint. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY, pp. 216-220.

PDF Ieee_Int_Sym_Int_The_216_2017.pdf - Published Version Restricted to Registered users only Download (217kB) | Request a copy

Abstract

A binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are presented for the case where the input sequence contains no consecutive ones. A simple coding scheme is designed based on the principle of posterior matching, which was introduced by Shayevitz and Feder for memoryless channels. The posterior matching scheme for our input-constrained setting is shown to achieve capacity using two new ideas: message history, which captures the memory embedded in the setting, and message splitting, which simplifies the scheme analysis. Additionally, in the special case of an S-channel, we give a very simple zero-error coding scheme that achieves capacity.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for this article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	18 May 2018 16:00
Last Modified:	18 May 2018 16:00
URI:	http://eprints.iisc.ac.in/id/eprint/59898

Actions (login required)

View Item