Two Step SOVA-Based Decoding Algorithm for Tailbiting Codes

2025/01/23 by Jorge Ortin, Paloma Garcia, Fernando Gutierrez +1 · 1 voice
Computer Science · #cs.IT #cs.NI

paper · pdf · doi:10.1109/lcomm.2009.090810

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.

Discussions

• Jorge Ortin, Paloma Garcia, Fernando Gutierrez, Antonio Valdovinos: Two Step SOVA-Based Decoding Algorithm for Tailbiting Codes https://arxiv.org/abs/2501.13606 https://arxiv.org/pdf/2501.13606 https: [bsky, 0 points, 1 comments]

Related

• A* Based Algorithm for Reduced Complexity ML Decoding of Tailbiting Codes
• Statistical Learning Aided Decoding of BMST of Tail-Biting Convolutional Code
• Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
• Sequential Decoding of Convolutional Codes for Synchronization Errors
• Error-Trellis Construction for Tailbiting Convolutional Codes