• DocumentCode
    1090118
  • Title

    Simplified convolutional self-doubly orthogonal codes: search algorithms and codes determination

  • Author

    Cardinal, Christian ; Roy, Eric ; Haccoun, David

  • Author_Institution
    Dept. of Electr. Eng., Ecole Polytech. de Montreal, Montreal, QC
  • Volume
    57
  • Issue
    6
  • fYear
    2009
  • fDate
    6/1/2009 12:00:00 AM
  • Firstpage
    1674
  • Lastpage
    1682
  • Abstract
    A new class of convolutional self-doubly orthogonal codes which can be decoded by an iterative threshold decoder is presented. This new type of codes, called simplified convolutional self-doubly orthogonal codes (S-CSO2C), are obtained by simplifying some of the conditions on the double orthogonality of the convolutional self-doubly orthogonal codes (CSO2C). The relaxing of these conditions yields a substantial reduction of the total decoding delay induced by the memory length of the convolutional encoder at a cost of any a small degradation of the error performances. These simplified codes are also amenable to high coding rates R = b/(b + 1), b > 1 by puncturing a rate 1/2 systematic convolutional encoder. These new simplified CSO2C provide an interesting alternative for low complexity implementation error correcting schemes.
  • Keywords
    convolutional codes; iterative decoding; orthogonal codes; search problems; decoding delay; iterative threshold decoder; search algorithm; simplified convolutional self-doubly orthogonal code; Computer errors; Convolution; Convolutional codes; Costs; Degradation; Delay; Error correction; Iterative algorithms; Iterative decoding; Signal to noise ratio; Convolutional self-doubly orthogonal codes, iterative threshold decoder, punctured convolutional codes.;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2009.06.070529
  • Filename
    5089506