An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes

Author:

Zita Abreu, Julia Lieb, Michael Schaller

Keyword:

Computer Science, Information Theory, Information Theory (cs.IT)

journal:

date:

2024-02-02 00:00:00

Abstract

The most famous error-decoding algorithm for convolutional codes is the Viterbi algorithm. In this paper, we present a new reduced complexity version of this algorithm which can be applied to a class of binary convolutional codes with optimum column distances called k-partial simplex convolutional codes.

PDF: An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes.pdf