Evaluation of a Reduced Complexity ML Decoding Algorithm for Tailbiting Codes on Wireless Systems

Ortin, Jorge (Universidad de Zaragoza) ; Garcia, Paloma (Universidad de Zaragoza) ; Gutierrez, Fernando (Universidad de Zaragoza) ; Valdovinos, Antonio (Universidad de Zaragoza)

Resumen: Tailbiting convolutional codes will be used for several applications in new cellular mobile radio systems. This encoding method does not reset the encoder memory at the end of each data block, avoiding the overhead of the zero tail and improving the efficiency. Nevertheless, the absence of a known tail highly increases the complexity of the decoding process. Recently, the use of the A* algorithm has highly decreased the computational complexity of Maximum Likelihood (ML) decoding of tailbiting convolutional codes. The decoding process in this case requires two steps. In the first step, a typical Viterbi decoding is employed to collect information regarding the trellis. The A* algorithm is then applied in the second step, using the information obtained in the first step 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 step of the algorithm. This information is used for finding early terminating conditions for the A* algorithm. Simulation results show that the proposed modification decreases the complexity of ML decoding with the A* algorithm in terms of the performed number of operations.

Idioma: Inglés

DOI: 10.1109/VETECF.2010.5594467

Año: 2010

Publicado en: IEEE Vehicular Technology Conference (1993) 72 (2010), [5 pp.]
ISSN: 1090-3038

Financiación: info:eu-repo/grantAgreement/ES/DGA/PI003-08
Financiación: info:eu-repo/grantAgreement/ES/MICINN-FEDER/TEC2008-06684-C03-02/TEC

Tipo y forma: Congress (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.)