• DocumentCode
    1780439
  • Title

    Density evolution analysis of braided convolutional codes on the erasure channel

  • Author

    Moloudi, Saeedeh ; Lentmaier, Michael

  • Author_Institution
    Dept. of Electr. & Inf. Technol., Lund Univ., Lund, Sweden
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    2609
  • Lastpage
    2613
  • Abstract
    Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes with a structure that is similar to product codes or generalized LDPC codes. We derive explicit input/output transfer functions of the component convolutional decoders for the binary erasure channel (BEC). These are then used to formulate exact density evolution equations for blockwise BCCs under belief propagation (BP) decoding with optimal component APP decoders. Thresholds are computed for the coupled and uncoupled case, which is equivalent to tailbiting. Due to the relatively high rate of the component codes a significant threshold improvement by spatial coupling can be observed.
  • Keywords
    convolutional codes; decoding; evolutionary computation; parity check codes; product codes; turbo codes; BEC; BP decoding; belief propagation decoding; binary erasure channel; blockwise BCC; braided convolutional codes; component convolutional decoders; density evolution analysis; density evolution equations; explicit input-output transfer functions; generalized LDPC codes; low-density parity-check convolutional codes; optimal component APP decoders; product codes; spatial coupled turbo-like codes; Convolutional codes; Decoding; Equations; Iterative decoding; Transfer functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2014 IEEE International Symposium on
  • Conference_Location
    Honolulu, HI
  • Type

    conf

  • DOI
    10.1109/ISIT.2014.6875306
  • Filename
    6875306