A* based algorithm for reduced complexity ML decoding of tailbiting codes

Ortín, J. (Universidad de Zaragoza) ; García, P. (Universidad de Zaragoza) ; Gutierrez, F. (Universidad de Zaragoza) ; Valdovinos, A. (Universidad de Zaragoza)

Resumen: 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 ailbiting 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.

Idioma: Inglés

DOI: 10.1109/LCOMM.2010.072310.100295

Año: 2010

Publicado en: IEEE COMMUNICATIONS LETTERS 14, 9 (2010), 854-856
ISSN: 1089-7798

Factor impacto JCR: 1.06 (2010)

Categ. JCR: TELECOMMUNICATIONS rank: 29 / 79 = 0.367 (2010) - Q2 - T2

Tipo y forma: Artículo (PostPrint)

Área (Departamento): Área Teoría Señal y Comunicac. (Dpto. Ingeniería Electrón.Com.)
Área (Departamento): Área Ingeniería Telemática (Dpto. Ingeniería Electrón.Com.)