• DocumentCode
    1343306
  • Title

    Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder

  • Author

    Osthoff, Harro ; Anderson, John B. ; Johannesson, Rolf ; Lin, Chin-foo

  • Author_Institution
    Erics, Nurnberg, Germany
  • Volume
    44
  • Issue
    2
  • fYear
    1998
  • fDate
    3/1/1998 12:00:00 AM
  • Firstpage
    831
  • Lastpage
    838
  • Abstract
    Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of encoder solves the correct path loss problem in reduced-search decoders. Other kinds do not. Therefore, with almost any other decoding method than the Viterbi algorithm, systematic feed-forward encoders should be used. The conclusions in this correspondence run counter to much accepted wisdom about convolutional codes
  • Keywords
    convolutional codes; decoding; error statistics; feedforward; M-algorithm decoder; correct path loss problem; distance profile; error performance; nonbacktracking convolutional decoders; reduced-search decoders; systematic feed-forward convolutional encoders; systematic feed-forward encoders; trellis survivors; Convolutional codes; Councils; Counting circuits; Decoding; Error correction; Error correction codes; Error probability; Feedforward systems; Information theory; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.661531
  • Filename
    661531