SpringerOpen Newsletter

Receive periodic news and updates relating to SpringerOpen.

Open Access Research Article

A Systematic Approach to Modified BCJR MAP Algorithms for Convolutional Codes

Sichun Wang1* and François Patenaude2

Author Affiliations

1 Defence Research and Development Canada *#8211; Ottawa, Ottawa, ON, Canada, K1A 0Z4

2 Communications Research Centre Canada, Ottawa, ON, Canada, K2H 8S2

For all author emails, please log on.

EURASIP Journal on Advances in Signal Processing 2006, 2006:095360  doi:10.1155/ASP/2006/95360

The electronic version of this article is the complete one and can be found online at: http://asp.eurasipjournals.com/content/2006/1/095360


Received:19 November 2004
Revisions received:19 July 2005
Accepted:12 September 2005
Published:13 April 2006

© 2006 Wang and Patenaude

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Since Berrou, Glavieux and Thitimajshima 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.

References

  1. C Berrou, A Glavieux, P Thitimajshima, Near Shannon limit error-correcting coding and decoding: turbo-codes. (1). Proceedings of IEEE International Conference on Communications (ICC '93), May 1993, Geneva, Switzerland 2, 1064–1070

  2. C Berrou, A Glavieux, Near optimum error correcting coding and decoding: turbo-codes. IEEE Transactions on Communications 44(10), 1261–1271 (1996). Publisher Full Text OpenURL

  3. S Wang, F Patenaude, A simplified BGT MAP algorithm and its dual. Proceedings of IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM '03), August 2003, Victoria, BC, Canada 2, 954–959

  4. LR Bahl, J Cocke, F Jelinek, J Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). IEEE Transactions on Information Theory 20(2), 284–287 (1974)

  5. SS Pietrobon, AS Barbulescu, A simplification of the modified Bahl decoding algorithm for systematic convolutional codes. Proceedings of International Symposium on Information Theory & Its Applications (ISITA '94), November 1994, Sydney, Australia 2, 1073–1077 PubMed Abstract OpenURL

  6. L Kleinrock, Queuing Systems, Volume 1: Theory (John Wiley & Sons, New York, NY, USA, 1975)

  7. SS Pietrobon, Implementation and performance of a turbo/MAP decoder. International Journal of Satellite Communications 16(1), 23–46 (1998). Publisher Full Text OpenURL