A PEG-like LDPC code design avoiding short Trapping Sets

被引：0

作者：

Diouf, Madiagne ^{[1
]}

Declercq, David ^{[1
]}

Ouya, Samuel ^{[2
]}

Vasic, Bane ^{[3
]}

机构：

[1] Univ Cergy Pontoise, CNRS UMR 8051, ENSEA, ETIS, F-95014 Cergy Pontoise, France

[2] Univ Cheikh Anta DIOP, LIRT, ESP, Dakar, Senegal

[3] Univ Arizona, Dept Elec & Comp Engn, Tucson, AZ 85721 USA

来源：

2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2015年

关键词：

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

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 d(v) = 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.

引用

下载

页码：1079 / 1083

页数：5

共 16 条

[1] PEG-Like Algorithm for LDPC Codes
Srirutchataboon, Gan
Bajpai, Ambar
Wuttisittikulkij, Lunchakorn
Kovintavewat, Piya
2014 INTERNATIONAL ELECTRICAL ENGINEERING CONGRESS (IEECON), 2014,
[2] PEG-Like Design of Binary QC-LDPC Codes Based on Detecting and Avoiding Generating Small Cycles
He, Xuan
Zhou, Liang
Du, Junyi
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (05) : 1845 - 1858
[3] Trapping Sets in Irregular LDPC Code Ensembles
Milenkovic, Olgica
Soljanin, Emina
Whiting, Philip
2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 1101 - 1106
[4] Rational Design of a Synthetic Peg-Like Polymer for Protein Stabilization
Delre, Christopher
Panganiban, Brian
Li, Tim
Huang, Charley
de la Cruz, Monica Olvera
Dennis, Patrick
Xu, Ting
BIOPHYSICAL JOURNAL, 2017, 112 (03) : 59A - 59A
[5] Avoiding Trapping Sets in SC-LDPC Codes under Windowed Decoding
Beemer, Allison
Kelley, Christine A.
PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 206 - 210
[6] Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles
Milenkovic, Olgica
Soljanin, Emina
Whiting, Philip
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (01) : 39 - 55
[7] Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles
Dehghan, Ali
Banihashemi, Amir H.
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1650 - 1654
[8] Error Floor Estimation of LDPC Decoders - A Code Independent Approach to Measuring the Harmfulness of Trapping Sets
Farsiabi, Ali
Banihashemi, Amir H.
IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (05) : 2667 - 2679
[9] Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles
Dehghan, Ali
Banihashemi, Amir H.
PROCEEDINGS OF 2018 IEEE 10TH INTERNATIONAL SYMPOSIUM ON TURBO CODES & ITERATIVE INFORMATION PROCESSING (ISTC), 2018,
[10] Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles
Dehghan, Ali
Banihasheini, Amir H.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (10) : 6022 - 6043

← 1 2 →