An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes
Q. Wang, V.K. Bhargava · IEEE Transactions on Communications · 1989
The complexity of the algorithm is shown to be asymptotically equal to that of the Viterbi algorithm and is very close for practical noisy channels. The latter is shown by means of computer simulation. The algorithm can be applied directly in an environment where soft-decision decoding is required or preferred. However, depending on the environment, some simplifications may be possible and/or necessary, resulting in suboptimal algorithms. Codes suitable for use with the algorithm should have short total memory length.>