A PEG-like LDPC code design avoiding short trapping sets

Madiagne Diouf, David Declercq, Samuel Ouya, Bane V Vasic

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

12 Scopus citations

Abstract

In this paper, we propose a predictive method to construct regular column-weight-three LDPC codes with girth g = 8 so that their Tanner graphs contain a minimum number of small trapping sets. Our construction is based on improvements of the Progressive Edge-Growth (PEG) algorithm. We first show how to detect the smallest trapping sets (5; 3) and (6; 4) in the computation tree spread from variable nodes during the edge assignment. A precise and rigorous characterization of trapping sets (5; 3) and (6; 4) are given, and we then derive a modification of the Randomized Progressive Edge-Growth (RandPEG) algorithm [1] to take into account a new cost function that allows to build regular column-weight dv = 3, girth 8 LDPC codes free of (5,3) and with a minimization of (6,4). We present the construction and the performance results in the context of quasi-cyclic LDPC (QC-LDPC) codes.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1079-1083
Number of pages5
Volume2015-June
ISBN (Print)9781467377041
DOIs
Publication statusPublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

    Fingerprint

Keywords

  • Error floor
  • Low Density Parity Check (LDPC) codes
  • Progressive Edge-Growth (PEG)
  • Tanner graphs
  • Trapping sets

ASJC Scopus subject areas

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

Cite this

Diouf, M., Declercq, D., Ouya, S., & Vasic, B. V. (2015). A PEG-like LDPC code design avoiding short trapping sets. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2015-June, pp. 1079-1083). [7282621] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282621