Share Email Print

Proceedings Paper • new

An improved normalized min-sum decoding algorithm for regular LDPC
Author(s): Peng Jiang; Zheng Dou
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Low-density parity-check code (LDPC) is a kind of better error correction code which is played an important role in the reliability transmission of communication systems. In the aspect of decoding algorithm, the NMS algorithm becomes the mainstream algorithm dues to its lower complexity. what’s more, the Semi-serial decoding algorithm was put forward to reduce decoding iterations. However, the compensation factor of NMS algorithm is a fixed value and the Semi-serial decoding algorithm only considers one aspect of reducing iterations. In the actual decoding process, this value varies with the degree of the check node and the number of iterations. in order to solve the problems of these algorithms, this paper will propose a new improved algorithm. Firstly, we will adopt a dynamic compensation factor to improve performance of NMS algorithm on regular LDPC code. Then combined with the idea of Semi-serial decoding algorithm to reduce the number of iterations. The dynamic factor is firstly analyzed theoretically by density evolution theory. Then through the Monte Carlo experiment and the true LLR, the suitable dynamic compensation factors can be obtained which is changes with the number of iterations.

Paper Details

Date Published: 3 January 2020
PDF: 8 pages
Proc. SPIE 11373, Eleventh International Conference on Graphics and Image Processing (ICGIP 2019), 113732X (3 January 2020); doi: 10.1117/12.2557619
Show Author Affiliations
Peng Jiang, Harbin Engineering Univ. (China)
Zheng Dou, Harbin Engineering Univ. (China)

Published in SPIE Proceedings Vol. 11373:
Eleventh International Conference on Graphics and Image Processing (ICGIP 2019)
Zhigeng Pan; Xun Wang, Editor(s)

© SPIE. Terms of Use
Back to Top