Two Step SOVA-Based Decoding Algorithm for Tailbiting Codes

Ortin, J. ; Garcia, P. (Universidad de Zaragoza) ; Gutierrez, F. (Universidad de Zaragoza) ; Valdovinos, A. (Universidad de Zaragoza)
Two Step SOVA-Based Decoding Algorithm for Tailbiting Codes
Resumen: Abstract—In this work we propose a novel decoding algorithm for tailbiting convolutional codes and evaluate its performance over different channels. The proposed method consists on a fixed two-step Viterbi decoding of the received data. In the first step, an estimation of the most likely state is performed based on a SOVA decoding. The second step consists of a conventional Viterbi decoding that employs the state estimated in the previous step as the initial and final states of the trellis. Simulations results show a performance close to that of maximum-likelihood decoding.
Idioma: Inglés
Año: 2009
Publicado en: IEEE COMMUNICATIONS LETTERS 13, 7 (2009), 510-512
ISSN: 1089-7798

Factor impacto JCR: 1.14 (2009)
Categ. JCR: TELECOMMUNICATIONS rank: 24 / 74 = 0.324 (2009) - Q2 - T1
Tipo y forma: Article (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.)


Creative Commons You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.


Exportado de SIDERAL (2025-01-25-10:29:59)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles > Artículos por área > Teoría de la Señal y Comunicaciones
Articles > Artículos por área > Ingenieria Telematica



 Record created 2025-01-25, last modified 2025-01-25


Postprint:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)