A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm

Xin Xiao, Yichao Lu, Satoshi Goto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Non-binary LDPC codes are flourishing in many areas for their excellent error correction performance in last decade. However, the bottleneck for NB-LDPC codes' implementation is the high decoding computational complexity. To seek for a low-complexity decoding algorithm, iterative double-reliability-based majority-logic decoding (IDRB-MLGD) algorithm has been proposed, which still suffers from relatively high error floor at BER level of 10-6. In this work, we propose a low-complexity coding scheme for non-binary LDPC code that bases on iterative IDRB-MLGD algorithm. The proposed work concatenates a Reed Solomon code with non-binary LDPC code which is decoded by IDRB-MLGD algorithm. By such concatenation, errors left by IDRB-MLGD algorithm are set into RS code blocks, which can be further reduced by these RS code blocks. Moreover, a low-complexity decoding algorithm is used to decode the RS code. The comparison results on decoding computational complexity indicate that concatenation only brings about trivial complexity increase. Simulation results show that this proposed concatenated coding scheme can trade off the performance and decoding computational complexity efficiently.

Original languageEnglish
Title of host publicationICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing
PublisherIEEE Computer Society
DOIs
Publication statusPublished - 2013
Event9th International Conference on Information, Communications and Signal Processing, ICICS 2013 - Tainan
Duration: 2013 Dec 102013 Dec 13

Other

Other9th International Conference on Information, Communications and Signal Processing, ICICS 2013
CityTainan
Period13/12/1013/12/13

Fingerprint

Majority logic
Decoding
Computational complexity
Block codes
Reed-Solomon codes
Error correction

Keywords

  • concatenation
  • majority-logic decoding
  • non-binary LDPC code
  • reliability-based
  • RS code

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Cite this

Xiao, X., Lu, Y., & Goto, S. (2013). A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm. In ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing [6782971] IEEE Computer Society. https://doi.org/10.1109/ICICS.2013.6782971

A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm. / Xiao, Xin; Lu, Yichao; Goto, Satoshi.

ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing. IEEE Computer Society, 2013. 6782971.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xiao, X, Lu, Y & Goto, S 2013, A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm. in ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing., 6782971, IEEE Computer Society, 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, Tainan, 13/12/10. https://doi.org/10.1109/ICICS.2013.6782971
Xiao X, Lu Y, Goto S. A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm. In ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing. IEEE Computer Society. 2013. 6782971 https://doi.org/10.1109/ICICS.2013.6782971
Xiao, Xin ; Lu, Yichao ; Goto, Satoshi. / A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm. ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing. IEEE Computer Society, 2013.
@inproceedings{c851c2ec7f4a4b3390803997f03c7b84,
title = "A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm",
abstract = "Non-binary LDPC codes are flourishing in many areas for their excellent error correction performance in last decade. However, the bottleneck for NB-LDPC codes' implementation is the high decoding computational complexity. To seek for a low-complexity decoding algorithm, iterative double-reliability-based majority-logic decoding (IDRB-MLGD) algorithm has been proposed, which still suffers from relatively high error floor at BER level of 10-6. In this work, we propose a low-complexity coding scheme for non-binary LDPC code that bases on iterative IDRB-MLGD algorithm. The proposed work concatenates a Reed Solomon code with non-binary LDPC code which is decoded by IDRB-MLGD algorithm. By such concatenation, errors left by IDRB-MLGD algorithm are set into RS code blocks, which can be further reduced by these RS code blocks. Moreover, a low-complexity decoding algorithm is used to decode the RS code. The comparison results on decoding computational complexity indicate that concatenation only brings about trivial complexity increase. Simulation results show that this proposed concatenated coding scheme can trade off the performance and decoding computational complexity efficiently.",
keywords = "concatenation, majority-logic decoding, non-binary LDPC code, reliability-based, RS code",
author = "Xin Xiao and Yichao Lu and Satoshi Goto",
year = "2013",
doi = "10.1109/ICICS.2013.6782971",
language = "English",
booktitle = "ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - A low-complexity coding scheme for non-binary LDPC code based on IDRB-MLGD algorithm

AU - Xiao, Xin

AU - Lu, Yichao

AU - Goto, Satoshi

PY - 2013

Y1 - 2013

N2 - Non-binary LDPC codes are flourishing in many areas for their excellent error correction performance in last decade. However, the bottleneck for NB-LDPC codes' implementation is the high decoding computational complexity. To seek for a low-complexity decoding algorithm, iterative double-reliability-based majority-logic decoding (IDRB-MLGD) algorithm has been proposed, which still suffers from relatively high error floor at BER level of 10-6. In this work, we propose a low-complexity coding scheme for non-binary LDPC code that bases on iterative IDRB-MLGD algorithm. The proposed work concatenates a Reed Solomon code with non-binary LDPC code which is decoded by IDRB-MLGD algorithm. By such concatenation, errors left by IDRB-MLGD algorithm are set into RS code blocks, which can be further reduced by these RS code blocks. Moreover, a low-complexity decoding algorithm is used to decode the RS code. The comparison results on decoding computational complexity indicate that concatenation only brings about trivial complexity increase. Simulation results show that this proposed concatenated coding scheme can trade off the performance and decoding computational complexity efficiently.

AB - Non-binary LDPC codes are flourishing in many areas for their excellent error correction performance in last decade. However, the bottleneck for NB-LDPC codes' implementation is the high decoding computational complexity. To seek for a low-complexity decoding algorithm, iterative double-reliability-based majority-logic decoding (IDRB-MLGD) algorithm has been proposed, which still suffers from relatively high error floor at BER level of 10-6. In this work, we propose a low-complexity coding scheme for non-binary LDPC code that bases on iterative IDRB-MLGD algorithm. The proposed work concatenates a Reed Solomon code with non-binary LDPC code which is decoded by IDRB-MLGD algorithm. By such concatenation, errors left by IDRB-MLGD algorithm are set into RS code blocks, which can be further reduced by these RS code blocks. Moreover, a low-complexity decoding algorithm is used to decode the RS code. The comparison results on decoding computational complexity indicate that concatenation only brings about trivial complexity increase. Simulation results show that this proposed concatenated coding scheme can trade off the performance and decoding computational complexity efficiently.

KW - concatenation

KW - majority-logic decoding

KW - non-binary LDPC code

KW - reliability-based

KW - RS code

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

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

U2 - 10.1109/ICICS.2013.6782971

DO - 10.1109/ICICS.2013.6782971

M3 - Conference contribution

AN - SCOPUS:84899074489

BT - ICICS 2013 - Conference Guide of the 9th International Conference on Information, Communications and Signal Processing

PB - IEEE Computer Society

ER -