• DocumentCode
    1457353
  • Title

    On (n,n-1) Punctured Convolutional Codes and Their Trellis Modules

  • Author

    Katsiotis, Alexandros ; Kalouptsidis, Nicholas

  • Author_Institution
    Dept. of Inf. & Telecommun., Nat. & Kapodistrian Univ. of Athens, Athens, Greece
  • Volume
    59
  • Issue
    5
  • fYear
    2011
  • fDate
    5/1/2011 12:00:00 AM
  • Firstpage
    1213
  • Lastpage
    1217
  • Abstract
    It is known that an (n,n-1) non catastrophic antipodal punctured convolutional encoder of memory m is minimal. That is, the corresponding code cannot be produced by an encoder of smaller memory size. In this letter it is shown that the trellis module of a code produced by an (n,n-1) non catastrophic punctured convolutional encoder is optimum, if and only if the encoder is antipodal.
  • Keywords
    convolutional codes; trellis codes; antipodal encoder; noncatastrophic punctured convolutional encoder; trellis modules; Complexity theory; Convolutional codes; Generators; Maximum likelihood decoding; Polynomials; Viterbi algorithm; Punctured convolutional codes; maximum likelihood decoding; minimal trellis; trellis complexity;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2011.020811.100088
  • Filename
    5719286