Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes

Summary, in English

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.

• Författare: Michael Lentmaier; Maria Mellado Prenda; Gerhard Fettweis
• Avdelning/ar: ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2011
• Språk: Engelska
• Sidor: 1826-1830
• Publikation/Tidskrift/Serie: 2011 IEEE International Symposium on Information Theory Proceedings
• Fulltext: - 196 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/ISIT.2011.6033865
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: spatial coupling; LDPC codes; LDPC convolutional codes; window decoding
• Conference name: IEEE International Symposium on Information Theory, 2011
• Conference date: 2011-07-31 - 2011-08-05
• Conference place: Saint Petersburg, Russian Federation
• Status: Published
• Forskningsgrupp: Telecommunication Theory
• ISBN/ISSN/Övrigt: ISSN: 2157-8095; ISSN: 2157-8117; ISBN: 978-1-4577-0596-0