Adaptive decoding of LDPC codes with binary messages
Files
(Published version)
Date
2009
Authors
Land, I.
Lechner, G.
Rasmussen, L.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 2009 International Symposium on Information Theory, 2009, pp.2146-2150
Statement of Responsibility
Conference Name
International Symposium on Information Theory (28 Jun 2009 - 3 Jul 2009 : Seoul, Korea)
Abstract
A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a com parable 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. © 2009 IEEE.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2009 IEEE