Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is shown to have a so-called “quasi-symmetry” property under certain invertibility conditions. As a result, it is proved that a uniformly distributed input process maximizes the channel’s block mutual information, resulting in a closed-form formula for its non-feedback capacity in terms of the noise-erasure entropy rate and the entropy rate of an auxiliary erasure process. The feedback channel capacity is also characterized, showing that the feedback does not increase capacity and generalizing prior related results. The capacity-cost function of the channel with and without feedback is next investigated. A sequence of finite-letter upper bounds for the capacity-cost function without feedback is derived. Finite-letter lower bonds for the capacity-cost function with feedback are obtained using a specific encoding rule. Based on these bounds, it is demonstrated both numerically and analytically that feedback can increase the capacity-cost function for a class of channels with Markov noise-erasure processes.

[1]  Charalambos D. Charalambous,et al.  Feedback does not increase the capacity of compound channels with additive noise , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[2]  Gerhard Kramer,et al.  Directed information for channels with feedback , 1998 .

[3]  Andrea J. Goldsmith,et al.  Finite State Channels With Time-Invariant Deterministic Feedback , 2006, IEEE Transactions on Information Theory.

[4]  Toby Berger,et al.  The capacity of finite-State Markov Channels With feedback , 2005, IEEE Transactions on Information Theory.

[5]  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.

[6]  Sarah J. Johnson.  Burst erasure correcting LDPC codes , 2009, IEEE Transactions on Communications.

[7]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[8]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[9]  Parimal Parag,et al.  Code-Rate Selection, Queueing Behavior, and the Correlated Erasure Channel , 2013, IEEE Transactions on Information Theory.

[10]  Fady Alajaji,et al.  An Introduction to Single-User Information Theory , 2018 .

[11]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[12]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[13]  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.

[14]  Kan Li,et al.  Channels with both random errors and burst erasures: Capacities, LDPC code thresholds, and code performances , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[16]  Robert J. McEliece,et al.  The theory of information and coding : a mathematical framework for communication , 1977 .

[17]  Haim H. Permuter,et al.  Capacity and Coding for the Ising Channel With Feedback , 2012, IEEE Transactions on Information Theory.

[18]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[19]  Paul H. Siegel,et al.  Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels , 2010, IEEE Transactions on Information Theory.

[20]  Cecilio Pimentel,et al.  Finite-state Markov modeling of correlated Rician-fading channels , 2004, IEEE Transactions on Vehicular Technology.

[21]  Aaron D. Wyner,et al.  Bounds on the rate-distortion function for stationary sources with memory , 1971, IEEE Trans. Inf. Theory.

[22]  Fady Alajaji,et al.  A Model for Correlated Rician Fading Channels Based on a Finite Queue , 2008, IEEE Transactions on Vehicular Technology.

[23]  Fady Alajaji.  Feedback does not increase the capacity of discrete channels with additive noise , 1995, IEEE Trans. Inf. Theory.

[24]  Fady Alajaji,et al.  A communication channel molded on contagion , 1994, IEEE Trans. Inf. Theory.

[25]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[26]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[27]  W. Rudin.  Principles of mathematical analysis , 1964 .

[28]  Fady Alajaji,et al.  A Binary Communication Channel With Memory Based on a Finite Queue , 2007, IEEE Transactions on Information Theory.

[29]  J. Hamkins.  Optimal Codes for the Burst Erasure Channel , 2010 .

[30]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[31]  Jun Chen,et al.  Price of perfection: Limited prediction for streaming over erasure channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[32]  J. Massey.  CAUSALITY, FEEDBACK AND DIRECTED INFORMATION , 1990 .

[33]  Wai-tian Tan,et al.  Streaming Codes With Partial Recovery Over Channels With Burst and Isolated Erasures , 2015, IEEE Journal of Selected Topics in Signal Processing.

[34]  Haim H. Permuter,et al.  Can feedback increase the capacity of the energy harvesting channel? , 2015, 2015 IEEE Information Theory Workshop (ITW).

[35]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[36]  Guangyue Han,et al.  Asymptotics of Input-Constrained Erasure Channel Capacity , 2016, IEEE Transactions on Information Theory.

[37]  Haim H. Permuter,et al.  Capacity of the Trapdoor Channel With Feedback , 2006, IEEE Transactions on Information Theory.

[38]  B. Vasic,et al.  2-D Magnetic Recording: Read Channel Modeling and Detection , 2009, IEEE Transactions on Magnetics.

[39]  Sergio Verdú,et al.  The source-channel separation theorem revisited , 1995, IEEE Trans. Inf. Theory.

[40]  F. Alajaji,et al.  Effect of feedback on the capacity of discrete additive channels with memory , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[41]  Fady Alajaji,et al.  The capacity-cost function of discrete additive noise channels with and without feedback , 2000, IEEE Trans. Inf. Theory.

[42]  Amiel Feinstein,et al.  Information and information stability of random variables and processes , 1964 .

[43]  Fady Alajaji,et al.  On the capacity of burst noise-erasure channels with and without feedback , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[44]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[45]  E. O. Elliott.  Estimates of error rates for codes on burst-noise channels , 1963 .

[46]  Sekhar Tatikonda,et al.  The Capacity of Channels With Feedback , 2006, IEEE Transactions on Information Theory.

[47]  Farrokh Etezadi,et al.  Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels , 2014, IEEE Transactions on Information Theory.

[48]  Illtyd Trethowan.  Causality , 1938 .

[49]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[50]  Fady Alajaji,et al.  Feedback Capacity of a Class of Symmetric Finite-State Markov Channels , 2009, IEEE Transactions on Information Theory.