Performance of quantized min-sum decoding algorithms for irregular LDPC codes

Daesun Oh, Keshab K Parhi

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

In this paper, we analyze the performance of quantized min-sum decoding algorithms for irregular low-density parity-check (LDPC) codes. For regular LDPC codes, it is known that the normalized or offset min-sum decoding algorithm with quantization bits less than 6 bits achieves good performances over wide range of signal-to-noise ratios (SNR). However, finite precision effects in decoding irregular LDPC codes are different from that In decoding regular LDPC codes which is caused by the difference of convergence speeds between low degree nodes and high degree nodes. This paper proposes a novel method to improve the performance of the conventional normalized or offset min-sum decoding algorithm when it is approximated with finite precision for hardware Implementations. The proposed method applies down-scaling factors to Intrinsic Information which has effects on Increasing the reliability of extrinsic information at variable nodes and compensating the quantization errors caused by finite precision. Computer simulation results for Irregular LDPC codes show that our proposed normalized and offset min-sum decoding algorithms achieve much better performances at high SNR compared to the conventional normalized and offset min-sum algorithms under (6:2) quantization scheme.

Original languageEnglish (US)
Article number4253249
Pages (from-to)2758-2761
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - Sep 27 2007

    Fingerprint

Cite this