Simplified turbo decoding for binary Markov channels

We present a simplified method for combining turbo decoding and binary Markov channels. The resulting performance is slightly worse than that of the best known methods using supertrellis approaches, but it clearly outperforms traditional systems based on channel interleaving. Moreover, the complexity is much lower than in the supertrellis case and the structure of the encoder does not depend on the parameters of the hidden Markov model describing the channel.

[1]  J.D. Villasenor,et al.  Exploiting binary Markov channels with unknown parameters in turbo decoding , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[2]  J. Garcia-Frias,et al.  Turbo codes for continuous hidden Markov channels with unknown parameters , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[3]  William Turin,et al.  Performance Analysis of Digital Transmission Systems , 1990 .

[4]  J.D. Villasenor,et al.  Simplified methods for combining hidden Markov models and turbo codes , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[5]  A.R.K. Sastry,et al.  Models for channels with memory and their applications to error control , 1978, Proceedings of the IEEE.