The A* algorithm is a graph search algorithm which has shown good results in terms of computational complexity for Maximum Likelihood (ML) decoding of tailbiting convolutional codes. The decoding of tailbiting codes with this algorithm is performed in two phases. In the first phase, a typical Viterbi decoding is employed to collect information regarding the trellis. The A* algorithm is then applied in the second phase, using the information obtained in the first one to calculate the heuristic function. The improvements proposed in this work decrease the computational complexity of the A* algorithm using further information from the first phase of the algorithm. This information is used for obtaining a more accurate heuristic function and finding early terminating conditions for the A* algorithm. Simulation results show that the proposed modifications decrease the complexity of ML decoding with the A* algorithm in terms of the performed number of operations.
[1]
B. Sundar Rajan,et al.
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
,
2006,
ArXiv.
[2]
Hung-Ta Pai,et al.
Priority-first search decoding for convolutional tail-biting codes
,
2008,
2008 International Symposium on Information Theory and Its Applications.
[3]
Yunghsiang Sam Han,et al.
Low-complexity ML decoding for convolutional tail-biting codes
,
2008,
IEEE Communications Letters.
[4]
Shu Lin,et al.
Two decoding algorithms for tailbiting codes
,
2003,
IEEE Trans. Commun..
[5]
R. V. Cox,et al.
An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes
,
1994
.
[6]
Antonio Valdovinos,et al.
Two step SOVA-based decoding algorithm for tailbiting codes
,
2009,
IEEE Communications Letters.