Dynamic check message majority-logic decoding algorithm for non-binary LDPC codes

Yichao Lu, Xiao Peng, Guifen Tian, Satoshi Goto

Research output: Contribution to journalArticle

Abstract

Majority-logic algorithms are devised for decoding nonbinary 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.0 dB, 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.

Original languageEnglish
Pages (from-to)1356-1364
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE97-A
Issue number6
DOIs
Publication statusPublished - 2014

Fingerprint

Majority logic
LDPC Codes
Decoding
Logic
Computational complexity
Computational Complexity
Belief Propagation
Coding Gain
Min-max

Keywords

  • Iterative decoding
  • Majority-logic decoding
  • Message-passing algorithms
  • Non-binary LDPC codes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

Dynamic check message majority-logic decoding algorithm for non-binary LDPC codes. / Lu, Yichao; Peng, Xiao; Tian, Guifen; Goto, Satoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E97-A, No. 6, 2014, p. 1356-1364.

Research output: Contribution to journalArticle

@article{684db8db5ce6432e9a84268adc4e164c,
title = "Dynamic check message majority-logic decoding algorithm for non-binary LDPC codes",
abstract = "Majority-logic algorithms are devised for decoding nonbinary 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.0 dB, 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 = "Iterative decoding, Majority-logic decoding, Message-passing algorithms, Non-binary LDPC codes",
author = "Yichao Lu and Xiao Peng and Guifen Tian and Satoshi Goto",
year = "2014",
doi = "10.1587/transfun.E97.A.1356",
language = "English",
volume = "E97-A",
pages = "1356--1364",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

TY - JOUR

T1 - Dynamic check message majority-logic decoding algorithm for non-binary LDPC codes

AU - Lu, Yichao

AU - Peng, Xiao

AU - Tian, Guifen

AU - Goto, Satoshi

PY - 2014

Y1 - 2014

N2 - Majority-logic algorithms are devised for decoding nonbinary 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.0 dB, 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.

AB - Majority-logic algorithms are devised for decoding nonbinary 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.0 dB, 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.

KW - Iterative decoding

KW - Majority-logic decoding

KW - Message-passing algorithms

KW - Non-binary LDPC codes

UR - http://www.scopus.com/inward/record.url?scp=84901813024&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901813024&partnerID=8YFLogxK

U2 - 10.1587/transfun.E97.A.1356

DO - 10.1587/transfun.E97.A.1356

M3 - Article

VL - E97-A

SP - 1356

EP - 1364

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 6

ER -