Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes
(2011) IEEE International Symposium on Information Theory, 2011 p.1826-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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731162
- author
- Lentmaier, Michael LU ; Mellado Prenda, Maria and Fettweis, Gerhard
- organization
- publishing date
- 2011
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, LDPC convolutional codes, window decoding
- host publication
- 2011 IEEE International Symposium on Information Theory Proceedings
- pages
- 1826 - 1830
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Information Theory, 2011
- conference location
- Saint Petersburg, Russian Federation
- conference dates
- 2011-07-31 - 2011-08-05
- external identifiers
-
- scopus:80054807738
- ISSN
- 2157-8117
- 2157-8095
- ISBN
- 978-1-4577-0596-0
- DOI
- 10.1109/ISIT.2011.6033865
- language
- English
- LU publication?
- no
- id
- 91be186b-b720-4f99-ac7e-ec0c1d829e2e (old id 3731162)
- date added to LUP
- 2016-04-01 11:07:18
- date last changed
- 2024-09-24 17:35:59
@inproceedings{91be186b-b720-4f99-ac7e-ec0c1d829e2e, 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.}}, author = {{Lentmaier, Michael and Mellado Prenda, Maria and Fettweis, Gerhard}}, booktitle = {{2011 IEEE International Symposium on Information Theory Proceedings}}, isbn = {{978-1-4577-0596-0}}, issn = {{2157-8117}}, keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes; window decoding}}, language = {{eng}}, pages = {{1826--1830}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes}}, url = {{https://lup.lub.lu.se/search/files/2396765/3731167.pdf}}, doi = {{10.1109/ISIT.2011.6033865}}, year = {{2011}}, }