Iterative decoding algorithms updating likelihood and channel values based on interim hard decision results

This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.

[1]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[2]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.