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

2024/02/02 by Zita Abreu, Abreu, Zita, Julia Lieb +3
Engineering · Computer Science · #Advanced Wireless Communication Techniques #Advanced Wireless Network Optimization #Wireless Communication Networks Research

paper · pdf · doi:10.48550/arxiv.2402.01279

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.

Related

• Binary convolutional codes with optimal column distances
• Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding
• Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes
• Performance Peculiarities of Viterbi Decoder in Mathworks Simulink, GNU Radio and Other Systems with Likewise Implementation
• A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes