Matched information rate codes for binary ISI channels

We propose a coding/decoding strategy to approach the channel capacities for binary intersymbol interference (ISI) channels. The proposed codes are serially concatenated codes: inner matched information rate codes and outer irregular low-density parity-check (LDPC) codes. The whole system is iteratively decodable.

[1]  Aleksandar Kavcic,et al.  Optimized LDPC codes for partial response channels , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[3]  Paul H. Siegel,et al.  Codes for Digital Recorders , 1998, IEEE Trans. Inf. Theory.

[4]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[5]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  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).

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