Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes

Yichao LU; Xiao PENG; Guifen TIAN; Satoshi GOTO

doi:10.1587/transfun.E97.A.1356

Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes

Yichao LU, Xiao PENG, Guifen TIAN, Satoshi GOTO

Full Text Views

0

Share
Cite this

Summary :

Majority-logic algorithms are devised for decoding non-binary LDPC codes in order to reduce computational complexity. However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. Reliability measures for check nodes are novelly introduced to realize mutual update between variable message and check message, and hence more efficient reliability propagation can be achieved, similar to belief-propagation algorithm. Simulation results on NB-LDPC codes with different characteristics demonstrate that our algorithm can reduce the bit error ratio by more than one order of magnitude and the coding gain enhancement over ISRB-MLGD can reach 0.2-2.0dB, compared with both the ISRB-MLGD and IISRB-MLGD algorithms. Moreover, simulations on typical LDPC codes show that the computational complexity of the proposed algorithm is closely equivalent to ISRB-MLGD algorithm, and is less than 10% of Min-max algorithm. As a result, the proposed algorithm achieves a more efficient trade-off between decoding computational complexity and error performance.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.6 pp.1356-1364

Publication Date: 2014/06/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E97.A.1356

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Authors

Yichao LU
  Waseda University
Xiao PENG
  NEC Corporation
Guifen TIAN
  CSRD of Toshiba
Satoshi GOTO
  Waseda University

Keyword

non-binary LDPC codes, majority-logic decoding, iterative decoding, message-passing algorithms

Cite this

Copy

Yichao LU, Xiao PENG, Guifen TIAN, Satoshi GOTO, "Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E97-A, no. 6, pp. 1356-1364, June 2014, doi: 10.1587/transfun.E97.A.1356.
Abstract: Majority-logic algorithms are devised for decoding non-binary LDPC codes in order to reduce computational complexity. However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. Reliability measures for check nodes are novelly introduced to realize mutual update between variable message and check message, and hence more efficient reliability propagation can be achieved, similar to belief-propagation algorithm. Simulation results on NB-LDPC codes with different characteristics demonstrate that our algorithm can reduce the bit error ratio by more than one order of magnitude and the coding gain enhancement over ISRB-MLGD can reach 0.2-2.0dB, compared with both the ISRB-MLGD and IISRB-MLGD algorithms. Moreover, simulations on typical LDPC codes show that the computational complexity of the proposed algorithm is closely equivalent to ISRB-MLGD algorithm, and is less than 10% of Min-max algorithm. As a result, the proposed algorithm achieves a more efficient trade-off between decoding computational complexity and error performance.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1356/_p

Copy

@ARTICLE{e97-a_6_1356,
author={Yichao LU, Xiao PENG, Guifen TIAN, Satoshi GOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes},
year={2014},
volume={E97-A},
number={6},
pages={1356-1364},
abstract={Majority-logic algorithms are devised for decoding non-binary LDPC codes in order to reduce computational complexity. However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. Reliability measures for check nodes are novelly introduced to realize mutual update between variable message and check message, and hence more efficient reliability propagation can be achieved, similar to belief-propagation algorithm. Simulation results on NB-LDPC codes with different characteristics demonstrate that our algorithm can reduce the bit error ratio by more than one order of magnitude and the coding gain enhancement over ISRB-MLGD can reach 0.2-2.0dB, compared with both the ISRB-MLGD and IISRB-MLGD algorithms. Moreover, simulations on typical LDPC codes show that the computational complexity of the proposed algorithm is closely equivalent to ISRB-MLGD algorithm, and is less than 10% of Min-max algorithm. As a result, the proposed algorithm achieves a more efficient trade-off between decoding computational complexity and error performance.},
keywords={},
doi={10.1587/transfun.E97.A.1356},
ISSN={1745-1337},
month={June},}

Copy

TY - JOUR
TI - Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1356
EP - 1364
AU - Yichao LU
AU - Xiao PENG
AU - Guifen TIAN
AU - Satoshi GOTO
PY - 2014
DO - 10.1587/transfun.E97.A.1356
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2014
AB - Majority-logic algorithms are devised for decoding non-binary LDPC codes in order to reduce computational complexity. However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. Reliability measures for check nodes are novelly introduced to realize mutual update between variable message and check message, and hence more efficient reliability propagation can be achieved, similar to belief-propagation algorithm. Simulation results on NB-LDPC codes with different characteristics demonstrate that our algorithm can reduce the bit error ratio by more than one order of magnitude and the coding gain enhancement over ISRB-MLGD can reach 0.2-2.0dB, compared with both the ISRB-MLGD and IISRB-MLGD algorithms. Moreover, simulations on typical LDPC codes show that the computational complexity of the proposed algorithm is closely equivalent to ISRB-MLGD algorithm, and is less than 10% of Min-max algorithm. As a result, the proposed algorithm achieves a more efficient trade-off between decoding computational complexity and error performance.
ER -