Near Optimum Majority-Logic Based Decoding of Low-Density Parity-Check Codes

Download Now Free registration required

Executive Summary

A reliability-based iterative majority-logic decoding algorithm for regular Low-Density Parity-Check (LDPC) codes was recently proposed by Huang et al. In this paper, the authors present an improved version of that algorithm by introducing a different reliability measure for each check-sum of the parity-check matrix, and taking it into account in the computation of the extrinsic information that is used to update the reliability measure of each received bit in each iteration. Some simulations results are given, which show that the new algorithm, while requiring very little additional computational complexity, not only achieves a considerable error performance gain over the standard one, but also, more importantly, outperforms the Iterative Decoding based on Belief Propagation (IDBP), for short and medium block length Finite-Geometry (FG) LDPC codes.

  • Format: PDF
  • Size: 156 KB