Low-complexity ML decoding for convolutional tail-biting codes
暂无分享，去创建一个
Recently, a maximum-likelihood (ML) decoding algorithm with two phases has been proposed for convolutional tailbiting codes. The first phase applies the Viterbi algorithm to obtain the trellis information, and then the second phase employs the algorithm A* to find the ML solution. In this work, we improve the complexity of the algorithm A* by using a new evaluation function. Simulations showed that the improved A* algorithm has over 5 times less average decoding complexity in the second phase when Eb/N0ges 4 dB.
[1] Qiang Wang,et al. An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes , 1989, IEEE Trans. Commun..
[2] Shu Lin,et al. Two decoding algorithms for tailbiting codes , 2003, IEEE Trans. Commun..
[3] R. V. Cox,et al. An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes , 1994 .
[4] B. Sundar Rajan,et al. Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises , 2006, ArXiv.