Further results on the equivalence between SOVA and max-log-MAP decodings

Turbo codes are preferred for high rate data services in the third generation mobile communication system IMT-2000. Thus low decoding delay and low complexity interactive decoding is of paramount importance. The modified soft output Viterbi algorithm (SOVA) and the max-log-maximum a posterioi (MAP) algorithm are such decoding techniques. The equivalence of modified SOVA and max-log-MAP decodings has been proven on the assumption of no a priori information and infinite decoding depth. Since the a priori information has to be updated continuously in iterative decoding, we prove their equivalence when there exists a priori information. We further demonstrate the equivalence between the sliding window (SW) max-log-MAP algorithm and the modified SOVA for finite decoding depth.

[1]  Sergio Benedetto,et al.  Algorithm for continuous decoding of turbo codes , 1996 .

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

[3]  Marc P. C. Fossorier,et al.  On the equivalence between SOVA and max-log-MAP decodings , 1998, IEEE Communications Letters.

[4]  Patrick Robertson,et al.  Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding , 1997, Eur. Trans. Telecommun..

[5]  Roger S. Cheng,et al.  Improvements in SOVA-based decoding for turbo codes , 1997, Proceedings of ICC'97 - International Conference on Communications.

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

[7]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.