Dual capacity upper bounds for noisy runlength constrained channels

Binary-input memoryless channels with a runlength constrained input, where an input of one is necessarily followed by a fixed number of zeros, are considered. Computable upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method. Simplified versions of the bounds are presented for the binary erasure channel (BEC) and the binary symmetric channel (BSC). These bounds improve upon previously known computable bounds and show that feedback strictly improves the capacity of the runlength constrained BEC and BSC for all parameters.

[1]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[2]  B. Marcus.  Constrained Systems and Coding for Recording Channels, in Handbook of Coding Theory, v. Finite-state Modulation Codes for Data Storage, Ieee , 2000 .

[3]  Pascal O. Vontobel,et al.  An upper bound on the capacity of channels with memory and constraint input , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[4]  J. Kemperman.  On the Shannon capacity of an arbitrary channel , 1974 .

[5]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[6]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.

[7]  Andrew Thangaraj,et al.  Capacity upper bounds for discrete-time amplitude-constrained AWGN channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[8]  Haim H. Permuter,et al.  Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint , 2018, IEEE Transactions on Information Theory.

[9]  Guangyue Han,et al.  Input-constrained erasure channels: Mutual information and capacity , 2014, 2014 IEEE International Symposium on Information Theory.

[11]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[12]  Giuseppe Durisi.  On the Capacity of the Block-Memoryless Phase-Noise Channel , 2012, IEEE Communications Letters.

[13]  Haim H. Permuter,et al.  The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint , 2016, IEEE Transactions on Information Theory.

[14]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[15]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[16]  Amos Lapidoth,et al.  On the Capacity of Free-Space Optical Intensity Channels , 2008, IEEE Transactions on Information Theory.