Simplified recursive structure for turbo decoder with Log-MAP algorithm

For the efficient implementation of a turbo decoder with Log-MAP (logarithm-maximum a posteriori) algorithm, we propose in this paper a solution with three highlights: the general core for forward and backward recursions, the simple branch metric calculation and a simplified rescaling of the path metrics. An FPGA (field programmable gate array) implementation with the proposed solution reduces area consumption to half and shows favorable performance.

[1]  Andries P. Hekstra,et al.  An alternative to metric rescaling in Viterbi decoders , 1989, IEEE Trans. Commun..

[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.

[3]  Thomas Kailath,et al.  Locally connected VLSI architectures for the Viterbi algorithm , 1988, IEEE J. Sel. Areas Commun..

[4]  P. Glenn Gulak,et al.  Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders , 1998 .

[5]  Paul H. Siegel,et al.  Area-efficient architectures for the Viterbi algorithm. I. Theory , 1993, IEEE Trans. Commun..

[6]  Patrick Robertson,et al.  Improved decoding with the SOVA in a parallel concatenated (Turbo-code) scheme , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[7]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.