An efficiently implementable maximum likelihood decoding algorithm for tailbiting codes

Ortin Gracia, Jorge ; Garcia Ducar, Paloma (Universidad de Zaragoza) ; Gutierrez Soler, Fernando (Universidad de Zaragoza) ; Valdovinos Bardají, Antonio (Universidad de Zaragoza)

Resumen: Convolutional tailbiting codes are widely used in mobile systems to perform error-correcting strategies of data and control information. Unlike zero tail codes, tailbiting codes do not reset the encoder memory at the end of each data block, improving the code efficiency for short block lengths. The objective of this work is to propose a low-complexity maximum likelihood decoding algorithm for convolutional tailbiting codes based on the Viterbi algorithm. The performance of the proposed solution is compared to that of another maximum likelihood decoding strategy which is based on the A* algorithm. The computational load and the memory requirements of both algorithms are also analysed in order to perform a fair comparison between them. Numerical results considering realistic transmission conditions show the lower memory requirements of the proposed solution, which makes its implementation more suitable for devices with limited resources.

Idioma: Inglés

DOI: 10.1007/s12243-013-0400-9

Año: 2013

Publicado en: ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 69, 9 (2013), 529–537
ISSN: 0003-4347

Factor impacto JCR: 0.408 (2013)

Categ. JCR: TELECOMMUNICATIONS rank: 69 / 78 = 0.885 (2013) - Q4 - T3

Tipo y forma: Artículo (Versión definitiva)

Á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.)