An early decision decoding algorithm for LDPC codes using dynamic thresholds

Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requireme...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 2005 European Conference on Circuit Theory and Design, 2005 Vol. 3; pp. III/285 - III/288 vol. 3
Main Authors Blad, A., Gustafsson, O., Wanhammar, L.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Bipartite graph
Decoding
Electronic mail
Error correction codes
Forward error correction
Hardware
Null space
Parity check codes
Sparse matrices
Turbo codes
Online AccessGet full text

Cover

More Information
Summary:Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate a modification to the decoding algorithm, using early decisions for bits with high reliabilities. This reduces the amount of messages passed by the algorithm, which can be expected to reduce the switching activity of a hardware implementation. While direct application of the modification results in severe performance penalties, we show how to adapt the algorithm to reduce the impact, resulting in a negligible decrease in error correction performance.
ISBN:9780780390669
0780390660
DOI:10.1109/ECCTD.2005.1523116