A systematic approach to modified BCJR MAP algorithms for convolutional codes (Q2500918): Difference between revisions

Summary: Since \textit{C. Berrou, A. Glavieux} and \textit{P. Thitimajshima} [Near Shannon limit error-correcting coding and decoding: turbo-codes. I. Proc. IEEE Int. Conf. Commun. (ICC '93), Geneva, Switzerland vol. 2, 1064--1070 (1993)]. published their landmark paper in 1993, different modified BCJR MAP algorithms have appeared in the literature. The existence of a relatively large number of similar but different modified BCJR MAP algorithms, derived using the Markov chain properties of convolutional codes, naturally leads to the following questions. What is the relationship among the different modified BCJR MAP algorithms? What are their relative performance, computational complexities, and memory requirements? In this paper, we answer these questions. We derive systematically four major modified BCJR MAP algorithms from the BCJR MAP algorithm using simple mathematical transformations. The connections between the original and the four modified BCJR MAP algorithms are established. A detailed analysis of the different modified BCJR MAP algorithms shows that they have identical computational complexities and memory requirements. Computer simulations demonstrate that the four modified BCJR MAP algorithms all have identical performance to the BCJR MAP algorithm.