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 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.

Nyckelord

Error-correcting codes

TECHNOLOGY

TEKNIKVETENSKAP

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)