A new soft-output algorithm of decoding is derived from the Bahl algorithm. The complex operations of estimating posterior probabilities and difference metric in the Bahl algorithm are paralleled and well formulated into a set of simple matrix operations which are fit to design efficient VLSI circuits. The probability of uk uk is quantized with n bits and is output together with uk branch code Xk. Thus, the algorithm not only increases the decoding speed, but also provides a soft-output algorithm for multi-level concatenated code.
Hagenauer J, Hoeher P. A Viterbi algorithm with soft-decision outputs and its applications. Proc. of IEEE Globeconi 89, Dallas, Texas: Nov. 1989: 47.11-47.17.[2]Bahl L R, Cocke .J, Jeinek F, Raviv J. Optimal decoding of linear codes for minimizng symbol error rate. IEEE Trans. on Inform. Theroy, 1974, IT-20(3): 284-287.[3]Forney C D. The Viterbi algorithm[J].Proc. IEEE.1973, 61(3):268-278[4]Blahut. R E. Theory and Practice of Error Control Codes. New York: Addison-Wesley, 1983, Chapter 9: 248 281.[5]GlennGulak P, Sliwedyk E. VLSI structures for Viterbi receivers: Part 1-General theroy and applications, Part. 2-Encoded MSK modulation. IEEE J. of Selected Areas in Comm., 1986,[6]SAC-4(1): 142-159.[7]Berrou C, Glavieux A, Thitirnajshinia P. Near Shannon limit error-correcting coding and decoding: turbo-codes. ICC 1993, 1064-1070.