Citation
Abstract
This paper presents a new syndrome decoding algorithm for the (n, Kk) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinek. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector EB (D). An example, illustrating the new decoding algorithm, is given;for the binary nonsystemmatic (3,1) CC.
Details
- Volume
- 42-74
- Published
- August 15, 1983
- Pages
- 40–53
- File Size
- 921.6 KB