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.

翻译：卷积码最著名的错误译码算法是维特比算法。本文提出了一种该算法的降复杂度新版本，可应用于一类具有最优列距离的二进制卷积码，即k-部分单纯形卷积码。