• DocumentCode
    1243909
  • Title

    Syndrome Decoding of Convolutional Codes

  • Author

    Schalkwijk, J.P.M. ; Vinck, A.J.

  • Author_Institution
    Univ. of Eindhoven, Eindhoven, The Netherlands
  • Volume
    23
  • Issue
    7
  • fYear
    1975
  • fDate
    7/1/1975 12:00:00 AM
  • Firstpage
    789
  • Lastpage
    792
  • Abstract
    The classical Viterbi decoder recursively finds the trellis path (code word) closest to the received data. Given the received data, the syndrome decoder first forms a syndrome, instead. A recursive algorithm like Viterbi´s is used to determine the noise sequence of minimum Hamming weight that can be a possible cause of this syndrome. Given the estimate of the noise sequence, one derives an estimate of the original data sequence. While the bit error probability of the syndrome decoder is no different from that of the classical Viterbi decoder, the syndrome decoder can be implemented using a read only memory (ROM), thus obtaining a considerable saving in hardware.
  • Keywords
    Convolutional codes; Decoding; Algebra; Binary sequences; Convolutional codes; Decoding; Error probability; Hamming weight; Polynomials; Read only memory; Shift registers; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOM.1975.1092884
  • Filename
    1092884