Citation
Abstract
This paper presents a new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space, A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector E(D) in this error coset, An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2, 1) CC.
Details
- Volume
- 42-73
- Published
- May 15, 1983
- Pages
- 15–21
- File Size
- 458.2 KB