• DocumentCode
    2389321
  • Title

    Punctured recursive convolutional encoders and their applications in turbo codes

  • Author

    Shen, Ba-Zhong ; Patapoutian, Ara ; McEwen, Peter

  • Author_Institution
    Broadcom Corp., Irvine, CA, USA
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    291
  • Abstract
    Puncturing is the predominant strategy to construct high code rate convolutional encoders, and infinite impulse response convolutional encoders are an essential building block in turbo codes. In this paper various properties of convolutional encoders with these characteristics are developed. In particular, the closed form representation of a punctured convolutional encoder and its generator matrix are constructed, necessary and sufficient conditions are given such that the punctured encoders retain the infinite impulse response property, and various lower bounds on distance properties, such as effective free distance, are developed. Finally, necessary and sufficient conditions are given on the inverse puncturing problem: representing a known convolutional encoder as a punctured encoder
  • Keywords
    convolutional codes; matrix algebra; transient response; turbo codes; IIR; closed form representation; distance properties; effective free distance; generator matrix; high code rate convolutional encoders; infinite impulse response convolutional encoders; inverse puncturing problem; lower bounds; necessary and sufficient conditions; punctured convolutional encoder; punctured recursive convolutional encoders; turbo codes; Convolutional codes; Feedback; Finite impulse response filter; Polynomials; Sufficient conditions; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2000. Proceedings. IEEE International Symposium on
  • Conference_Location
    Sorrento
  • Print_ISBN
    0-7803-5857-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2000.866589
  • Filename
    866589