• DocumentCode
    2647356
  • Title

    Reconstruction of punctured convolutional codes

  • Author

    Cluzeau, Mathieu ; Finiasz, Matthieu

  • fYear
    2009
  • fDate
    11-16 Oct. 2009
  • Firstpage
    75
  • Lastpage
    79
  • Abstract
    We present here a new technique to reconstruct punctured convolutional codes from a noisy intercepted bit-stream. Compared to existing techniques our algorithm has two major advantages: it can tolerate much higher noise levels in the bitstream and it is able to recover the best possible decoder (in terms of decoding complexity). This is achieved by identifying the exact puncturing pattern that was used and recovering the parent convolutional code.
  • Keywords
    convolutional codes; decoding complexity; noisy intercepted bit-stream; parent convolutional code; punctured convolutional codes reconstruction; Concatenated codes; Conferences; Convolutional codes; Decoding; Digital communication; Information rates; Information theory; Noise level; Polynomials; Viterbi algorithm; convolutional codes; puncturing; reconstruction;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2009. ITW 2009. IEEE
  • Conference_Location
    Taormina
  • Print_ISBN
    978-1-4244-4982-8
  • Electronic_ISBN
    978-1-4244-4983-5
  • Type

    conf

  • DOI
    10.1109/ITW.2009.5351168
  • Filename
    5351168