Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks

Vida Ravanmehr, David Declercq, Bane V Vasic

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

2 Citations (Scopus)

Abstract

In this paper, we propose a new approach to constructing a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. This approach is based on converting selected checks of an LDPC code involving a trapping set to super checks corresponding to a shorter error correcting component code. In particular, we follow two goals in constructing the check-hybrid GLDPC codes: First, the super checks are replaced based on the knowledge of trapping sets of the global LDPC code. We show that by converting only some single checks to super checks the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the number of super checks required for eliminating certain trapping sets is minimized to reduce the rate-loss. We first give an algorithm to find a set of critical checks in a trapping set of an LDPC code and then we provide some upper bounds on the minimum number of critical checks needed to eliminate certain trapping sets in the parity-check matrix of an LDPC code. A possible fixed set for a class of check-hybrid codes is also given.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages701-705
Number of pages5
ISBN (Print)9781479951864
DOIs
StatePublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: Jun 29 2014Jul 4 2014

Other

Other2014 IEEE International Symposium on Information Theory, ISIT 2014
CountryUnited States
CityHonolulu, HI
Period6/29/147/4/14

Fingerprint

Low-density Parity-check (LDPC) Codes
Trapping
Elimination
LDPC Codes
Eliminate
Parity
Upper bound

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Ravanmehr, V., Declercq, D., & Vasic, B. V. (2014). Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks. In IEEE International Symposium on Information Theory - Proceedings (pp. 701-705). [6874923] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6874923

Check-hybrid GLDPC codes : Systematic elimination of trapping sets by super checks. / Ravanmehr, Vida; Declercq, David; Vasic, Bane V.

IEEE International Symposium on Information Theory - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. p. 701-705 6874923.

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

Ravanmehr, V, Declercq, D & Vasic, BV 2014, Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks. in IEEE International Symposium on Information Theory - Proceedings., 6874923, Institute of Electrical and Electronics Engineers Inc., pp. 701-705, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 6/29/14. https://doi.org/10.1109/ISIT.2014.6874923
Ravanmehr V, Declercq D, Vasic BV. Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks. In IEEE International Symposium on Information Theory - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2014. p. 701-705. 6874923 https://doi.org/10.1109/ISIT.2014.6874923
Ravanmehr, Vida ; Declercq, David ; Vasic, Bane V. / Check-hybrid GLDPC codes : Systematic elimination of trapping sets by super checks. IEEE International Symposium on Information Theory - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 701-705
@inproceedings{fcad83f2a3c8496eaa4c3079b37bc6fe,
title = "Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks",
abstract = "In this paper, we propose a new approach to constructing a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. This approach is based on converting selected checks of an LDPC code involving a trapping set to super checks corresponding to a shorter error correcting component code. In particular, we follow two goals in constructing the check-hybrid GLDPC codes: First, the super checks are replaced based on the knowledge of trapping sets of the global LDPC code. We show that by converting only some single checks to super checks the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the number of super checks required for eliminating certain trapping sets is minimized to reduce the rate-loss. We first give an algorithm to find a set of critical checks in a trapping set of an LDPC code and then we provide some upper bounds on the minimum number of critical checks needed to eliminate certain trapping sets in the parity-check matrix of an LDPC code. A possible fixed set for a class of check-hybrid codes is also given.",
author = "Vida Ravanmehr and David Declercq and Vasic, {Bane V}",
year = "2014",
doi = "10.1109/ISIT.2014.6874923",
language = "English (US)",
isbn = "9781479951864",
pages = "701--705",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Check-hybrid GLDPC codes

T2 - Systematic elimination of trapping sets by super checks

AU - Ravanmehr, Vida

AU - Declercq, David

AU - Vasic, Bane V

PY - 2014

Y1 - 2014

N2 - In this paper, we propose a new approach to constructing a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. This approach is based on converting selected checks of an LDPC code involving a trapping set to super checks corresponding to a shorter error correcting component code. In particular, we follow two goals in constructing the check-hybrid GLDPC codes: First, the super checks are replaced based on the knowledge of trapping sets of the global LDPC code. We show that by converting only some single checks to super checks the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the number of super checks required for eliminating certain trapping sets is minimized to reduce the rate-loss. We first give an algorithm to find a set of critical checks in a trapping set of an LDPC code and then we provide some upper bounds on the minimum number of critical checks needed to eliminate certain trapping sets in the parity-check matrix of an LDPC code. A possible fixed set for a class of check-hybrid codes is also given.

AB - In this paper, we propose a new approach to constructing a class of check-hybrid generalized low-density parity-check (GLDPC) codes which are free of small trapping sets. This approach is based on converting selected checks of an LDPC code involving a trapping set to super checks corresponding to a shorter error correcting component code. In particular, we follow two goals in constructing the check-hybrid GLDPC codes: First, the super checks are replaced based on the knowledge of trapping sets of the global LDPC code. We show that by converting only some single checks to super checks the decoder corrects the errors on a trapping set and hence eliminates the trapping set. Second, the number of super checks required for eliminating certain trapping sets is minimized to reduce the rate-loss. We first give an algorithm to find a set of critical checks in a trapping set of an LDPC code and then we provide some upper bounds on the minimum number of critical checks needed to eliminate certain trapping sets in the parity-check matrix of an LDPC code. A possible fixed set for a class of check-hybrid codes is also given.

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

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

U2 - 10.1109/ISIT.2014.6874923

DO - 10.1109/ISIT.2014.6874923

M3 - Conference contribution

AN - SCOPUS:84906535759

SN - 9781479951864

SP - 701

EP - 705

BT - IEEE International Symposium on Information Theory - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -