An upper bound on the capacity of channels with memory and constraint input

A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input.

[1]  Shlomo Shamai,et al.  The intersymbol interference channel: lower bounds on capacity and channel precoding loss , 1996, IEEE Trans. Inf. Theory.

[2]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Walter Hirt.  Capacity and information rates of discrete-time channels with memory , 1988 .

[4]  Roy D. Cideciyan,et al.  A PRML System for Digital Magnetic Recording , 1992, IEEE J. Sel. Areas Commun..

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

[6]  Aleksandar Kavcic.  On the capacity of Markov sources over noisy channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).