• DocumentCode
    2881367
  • Title

    Recovery of unknown constraint length and generator polynomials for linear convolutional encoders

  • Author

    Boyd, Phillip L. ; Robertson, R. Clark

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Naval Postgraduate Sch., Monterey, CA, USA
  • Volume
    2
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    947
  • Abstract
    There are cases where the parameters of a forward error correcting encoder, the constraint length K and the generator polynomials, are unknown and must be obtained before the message data can be recovered. An algorithm is presented which, through observation and manipulation of the encoder data, composes a synthetic impulse response and from this sequence performs encoder parameter recovery. With these parameters in hand, selection of a suitable (Viterbi) decoder is straightforward, as is recovery of message data. The class of encoder examined is feedback-free, rate 1/2, linear, convolutional encoders, and for simplicity the algorithm is presented assuming noise-free data. The algorithm is then generalized to accommodate rate m/n codes
  • Keywords
    Viterbi decoding; convolutional codes; linear codes; polynomials; transient response; Viterbi decoder; algorithm; code rate; encoder parameter recovery; feedback-free encoder; forward error correcting encoder; linear convolutional encoders; message data recovery; noise-free data; synthetic impulse response; unknown constraint generator polynomials recovery; unknown constraint length recovery; Computer errors; Convolutional codes; Decoding; Error correction; Linearity; Polynomials; Protection; Shift registers; US Government; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    MILCOM 2000. 21st Century Military Communications Conference Proceedings
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    0-7803-6521-6
  • Type

    conf

  • DOI
    10.1109/MILCOM.2000.904070
  • Filename
    904070