Check-hybrid GLDPC codes without small trapping sets

Vida Ravanmehr, David Declercq, Bane V Vasic

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

1 Citation (Scopus)

Abstract

In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set to super checks corresponding to a shorter error-correcting component code. Specifically, we follow two main purposes to construct the check-hybrid codes: First, replacing single parity checks by super checks is done based on the knowledge of the trapping sets of the global LDPC code. We show that by converting some single checks to super checks in a trapping set, the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the rate-loss caused by replacing the super checks is reduced through finding the minimum number of such critical checks. We first present an algorithm to find possible critical checks in a trapping set. We then provide some upper bounds on the minimum number of such critical checks such that the decoder corrects all error patterns on certain trapping sets in the Tanner graph of the global LDPC code. We also provide a potential fixed set for a class of constructed check-hybrid codes.

Original languageEnglish (US)
Title of host publication2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings
PublisherIEEE Computer Society
DOIs
StatePublished - 2014
Event2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States
Duration: Feb 9 2014Feb 14 2014

Other

Other2014 IEEE Information Theory and Applications Workshop, ITA 2014
CountryUnited States
CitySan Diego, CA
Period2/9/142/14/14

Keywords

  • Check-hybrid GLDPC
  • Critical set
  • Low-density parity-check (LDPC) codes
  • Parallel Bit Flipping (PBF) algorithm
  • Splitting number
  • Trapping set

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Ravanmehr, V., Declercq, D., & Vasic, B. V. (2014). Check-hybrid GLDPC codes without small trapping sets. In 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings [6804215] IEEE Computer Society. https://doi.org/10.1109/ITA.2014.6804215

Check-hybrid GLDPC codes without small trapping sets. / Ravanmehr, Vida; Declercq, David; Vasic, Bane V.

2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings. IEEE Computer Society, 2014. 6804215.

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

Ravanmehr, V, Declercq, D & Vasic, BV 2014, Check-hybrid GLDPC codes without small trapping sets. in 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings., 6804215, IEEE Computer Society, 2014 IEEE Information Theory and Applications Workshop, ITA 2014, San Diego, CA, United States, 2/9/14. https://doi.org/10.1109/ITA.2014.6804215
Ravanmehr V, Declercq D, Vasic BV. Check-hybrid GLDPC codes without small trapping sets. In 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings. IEEE Computer Society. 2014. 6804215 https://doi.org/10.1109/ITA.2014.6804215
Ravanmehr, Vida ; Declercq, David ; Vasic, Bane V. / Check-hybrid GLDPC codes without small trapping sets. 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings. IEEE Computer Society, 2014.
@inproceedings{524df71bb1db439bb741ed3661252e6e,
title = "Check-hybrid GLDPC codes without small trapping sets",
abstract = "In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set to super checks corresponding to a shorter error-correcting component code. Specifically, we follow two main purposes to construct the check-hybrid codes: First, replacing single parity checks by super checks is done based on the knowledge of the trapping sets of the global LDPC code. We show that by converting some single checks to super checks in a trapping set, the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the rate-loss caused by replacing the super checks is reduced through finding the minimum number of such critical checks. We first present an algorithm to find possible critical checks in a trapping set. We then provide some upper bounds on the minimum number of such critical checks such that the decoder corrects all error patterns on certain trapping sets in the Tanner graph of the global LDPC code. We also provide a potential fixed set for a class of constructed check-hybrid codes.",
keywords = "Check-hybrid GLDPC, Critical set, Low-density parity-check (LDPC) codes, Parallel Bit Flipping (PBF) algorithm, Splitting number, Trapping set",
author = "Vida Ravanmehr and David Declercq and Vasic, {Bane V}",
year = "2014",
doi = "10.1109/ITA.2014.6804215",
language = "English (US)",
booktitle = "2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Check-hybrid GLDPC codes without small trapping sets

AU - Ravanmehr, Vida

AU - Declercq, David

AU - Vasic, Bane V

PY - 2014

Y1 - 2014

N2 - In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set to super checks corresponding to a shorter error-correcting component code. Specifically, we follow two main purposes to construct the check-hybrid codes: First, replacing single parity checks by super checks is done based on the knowledge of the trapping sets of the global LDPC code. We show that by converting some single checks to super checks in a trapping set, the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the rate-loss caused by replacing the super checks is reduced through finding the minimum number of such critical checks. We first present an algorithm to find possible critical checks in a trapping set. We then provide some upper bounds on the minimum number of such critical checks such that the decoder corrects all error patterns on certain trapping sets in the Tanner graph of the global LDPC code. We also provide a potential fixed set for a class of constructed check-hybrid codes.

AB - In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set to super checks corresponding to a shorter error-correcting component code. Specifically, we follow two main purposes to construct the check-hybrid codes: First, replacing single parity checks by super checks is done based on the knowledge of the trapping sets of the global LDPC code. We show that by converting some single checks to super checks in a trapping set, the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the rate-loss caused by replacing the super checks is reduced through finding the minimum number of such critical checks. We first present an algorithm to find possible critical checks in a trapping set. We then provide some upper bounds on the minimum number of such critical checks such that the decoder corrects all error patterns on certain trapping sets in the Tanner graph of the global LDPC code. We also provide a potential fixed set for a class of constructed check-hybrid codes.

KW - Check-hybrid GLDPC

KW - Critical set

KW - Low-density parity-check (LDPC) codes

KW - Parallel Bit Flipping (PBF) algorithm

KW - Splitting number

KW - Trapping set

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

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

U2 - 10.1109/ITA.2014.6804215

DO - 10.1109/ITA.2014.6804215

M3 - Conference contribution

BT - 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings

PB - IEEE Computer Society

ER -