Tailbiting MAP Decoders

We extend the MAP decoding algorithm of Bahl et al. (1974) to the case of tail-biting trellis codes. An algorithm is given that is based on finding an eigenvector, and another that avoids this. Several examples are given. The algorithm has application to turbo decoding and source-controlled channel decoding.

[1]  Joachim Hagenauer,et al.  Source-controlled channel decoding , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[2]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[3]  Philippe Godlewski,et al.  Replication decoding , 1979, IEEE Trans. Inf. Theory.

[4]  Jack K. Wolf,et al.  On Tail Biting Convolutional Codes , 1986, IEEE Trans. Commun..

[5]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[6]  Assem S. Deif,et al.  Advanced matrix theory for scientists and engineers , 1990 .