Adaptive Decoding of LDPC Codes with Binary Messages
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORYIEEE International Symposium on Information Theory - Proceedings, NEW YORK: IEEE , 2009, 2146-2150 p.Conference paper (Refereed)
A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable node decoders use the binary check node decoders multiple times; each single use is referred to as a sub-iteration. To process the sequences of binary messages in each iteration, the variable node decoders employ pre-computed look-up tables. These look-up tables as well as the number of sub-iterations per iteration are dynamically adapted during the decoding process based on the decoder state, represented by the mutual information between the current messages and the syndrome bits. The look-up tables and the number of sub-iterations per iteration are determined and optimized using density evolution. The performance and the complexity of the proposed adaptive decoding algorithm is exemplified by simulations.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 2146-2150 p.
IdentifiersURN: urn:nbn:se:kth:diva-28934DOI: 10.1109/ISIT.2009.5205782ISI: 000280141401143ScopusID: 2-s2.0-70449469505ISBN: 978-1-4244-4312-3OAI: oai:DiVA.org:kth-28934DiVA: diva2:399656
2009 IEEE International Symposium on Information Theory, ISIT 2009; Seoul; South Korea; 28 June 2009 through 3 July 2009;
QC 201507132011-02-232011-01-252015-07-13Bibliographically approved