Reduced-complexity decoding of LDPC codes

doi:10.1109/TCOMM.2005.852852

Return

Reduced-complexity decoding of LDPC codes

2005-08-01

785

PRE

Evangelos Eleftheriou

M.P.C. Fossorier

Xiaoyu Hu

DOI：10.1109/TCOMM.2005.852852

Original

Original request for help

Save

Abstract

En 中文

Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation. used in LLR-BP decoding are described. Furthermore, approximate representations of the decoding computations are shown to achieve a reduction in complexity by simplifying the check-node update, or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding, algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.

Keywords:

belief-propagation (BP) decoding

density evolution (DE)

iterative decoding

low-density parity-check (LDPC) codes

reduced-complexity decoding

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.