• DocumentCode
    3505218
  • Title

    Efficient message passing scheduling for terminated LDPC convolutional codes

  • Author

    Lentmaier, Michael ; Prenda, Maria Mellado ; Fettweis, Gerhard P.

  • Author_Institution
    Dept. of Mobile Commun. Syst., Dresden Univ. of Technol. (TU Dresden), Dresden, Germany
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    1826
  • Lastpage
    1830
  • Abstract
    Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding.
  • Keywords
    AWGN channels; convolutional codes; decoding; message passing; parity check codes; AWGN channel; decoding complexity reduction; density evolution; low complexity decoding; low latency decoding; message passing scheduling; terminated LDPC convolutional codes; Block codes; Complexity theory; Convolutional codes; Decoding; Message passing; Parity check codes; Schedules;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6033865
  • Filename
    6033865
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3505218