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

8 Citations (Scopus)

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
StatePublished - 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

LDPC Codes
Trapping
Girth
Cost functions
Quasi-cyclic Codes
Cost Function
Assignment
Graph in graph theory
Vertex of a graph
Design

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

A PEG-like LDPC code design avoiding short trapping sets. / Diouf, Madiagne; Declercq, David; Ouya, Samuel; Vasic, Bane V.

IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 1079-1083 7282621.

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

Diouf, M, Declercq, D, Ouya, S & Vasic, BV 2015, A PEG-like LDPC code design avoiding short trapping sets. in IEEE International Symposium on Information Theory - Proceedings. vol. 2015-June, 7282621, Institute of Electrical and Electronics Engineers Inc., pp. 1079-1083, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282621
Diouf M, Declercq D, Ouya S, Vasic BV. A PEG-like LDPC code design avoiding short trapping sets. In IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June. Institute of Electrical and Electronics Engineers Inc. 2015. p. 1079-1083. 7282621 https://doi.org/10.1109/ISIT.2015.7282621
Diouf, Madiagne ; Declercq, David ; Ouya, Samuel ; Vasic, Bane V. / A PEG-like LDPC code design avoiding short trapping sets. IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. pp. 1079-1083
@inproceedings{b1adff91b1e0485a86a776ba08a22773,
title = "A PEG-like LDPC code design avoiding short trapping sets",
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.",
keywords = "Error floor, Low Density Parity Check (LDPC) codes, Progressive Edge-Growth (PEG), Tanner graphs, Trapping sets",
author = "Madiagne Diouf and David Declercq and Samuel Ouya and Vasic, {Bane V}",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7282621",
language = "English (US)",
isbn = "9781467377041",
volume = "2015-June",
pages = "1079--1083",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A PEG-like LDPC code design avoiding short trapping sets

AU - Diouf, Madiagne

AU - Declercq, David

AU - Ouya, Samuel

AU - Vasic, Bane V

PY - 2015/9/28

Y1 - 2015/9/28

N2 - 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.

AB - 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.

KW - Error floor

KW - Low Density Parity Check (LDPC) codes

KW - Progressive Edge-Growth (PEG)

KW - Tanner graphs

KW - Trapping sets

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

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

U2 - 10.1109/ISIT.2015.7282621

DO - 10.1109/ISIT.2015.7282621

M3 - Conference contribution

AN - SCOPUS:84969785171

SN - 9781467377041

VL - 2015-June

SP - 1079

EP - 1083

BT - IEEE International Symposium on Information Theory - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -