Two step SOVA-based decoding algorithm for tailbiting codes
Year: 2009
Type: article
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.
Source: IEEE Communications Letters
Authors: J. Ortin, P. Garcia, F. Gutierrez, A. Valdovinos
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Gobierno de Aragón
OpenAlex ID: W2147640366
