Dispersion of the Gilbert-Elliott Channel

Channel dispersion plays a fundamental role in assessing the backoff from capacity due to finite blocklength. This paper analyzes the channel dispersion for a simple channel with memory: the Gilbert-Elliott communication model in which the crossover probability of a binary symmetric channel evolves as a binary symmetric Markov chain, with and without side information at the receiver about the channel state. With side information, dispersion is equal to the average of the dispersions of the individual binary symmetric channels plus a term that depends on the Markov chain dynamics, which do not affect the channel capacity. Without side information, dispersion is equal to the spectral density at zero of a certain stationary process, whose mean is the capacity. In addition, the finite blocklength behavior is analyzed in the non-ergodic case, in which the chain remains in the initial state forever.

[1]  Andrea J. Goldsmith,et al.  Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices , 2006, IEEE Transactions on Information Theory.

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

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

[4]  H. Vincent Poor,et al.  New channel coding achievability bounds , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[6]  Alexander Tikhomirov,et al.  On the Convergence Rate in the Central Limit Theorem for Weakly Dependent Random Variables , 1981 .

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

[8]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[9]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[10]  G. Birkhoff.  Extensions of Jentzsch’s theorem , 1957 .

[11]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

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

[13]  H. Vincent Poor,et al.  Dispersion of Gaussian channels , 2009, 2009 IEEE International Symposium on Information Theory.

[14]  I. Ibragimov,et al.  Some Limit Theorems for Stationary Processes , 1962 .

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

[16]  John C. Kieffer,et al.  $\epsilon$-Capacity of Binary Symmetric Averaged Channels , 2007, IEEE Transactions on Information Theory.