• DocumentCode
    2031335
  • Title

    Simplified High-Rate Punctured Convolutional Self-Doubly Orthogonal Codes

  • Author

    Roy, E. ; Cardinal, C. ; Haccoun, D.

  • Author_Institution
    Ecole Polytech. de Montreal, Montreal
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    2696
  • Lastpage
    2699
  • Abstract
    In this paper a new class of high-rate punctured convolutional codes that can be decoded using an iterative threshold algorithm is proposed. These codes are called simplified punctured convolutional self-doubly orthogonal codes (S-PCSO2C) of rate-R=b/(b+1), b>1 and are obtained by puncturing a rate 1/2 systematic convolutional mother code. S-PCSO2C are codes for which the original set of conditions, respected by PCSO2C, is simplified. Relaxing the doubly orthogonal conditions yields an important reduction of the constraint length of the systematic convolutional encoder which in turn reduce the implementation complexity and the total decoding latency at the cost of a very small performance degradation.
  • Keywords
    computational complexity; convolutional codes; iterative decoding; orthogonal codes; decoding; high-rate punctured convolutional codes; implementation complexity; iterative threshold algorithm; simplified punctured convolutional self-doubly orthogonal codes; Convolutional codes; Costs; Degradation; Delay effects; Equations; Error correction codes; Iterative algorithms; Iterative decoding; Parity check codes; Real time systems; Convolutional self-doubly orthogonal codes; Iterative Threshold Decoder; Punctured convolutional codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557626
  • Filename
    4557626