Improved PEG construction of large girth QC-LDPC codes

Madiagne Diouf; David Declercq; Marc Fossorier; Samuel Ouya; Bane V Vasic

doi:10.1109/ISTC.2016.7593094

Improved PEG construction of large girth QC-LDPC codes

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

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

Abstract

In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix p_min and error performance.

Original language	English (US)
Title of host publication	2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016
Publisher	IEEE Computer Society
Pages	146-150
Number of pages	5
Volume	2016-October
ISBN (Electronic)	9781509034017
DOIs	https://doi.org/10.1109/ISTC.2016.7593094
State	Published - Oct 17 2016
Event	9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 - Brest, France Duration: Sep 5 2016 → Sep 9 2016

Other

Other	9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016
Country	France
City	Brest
Period	9/5/16 → 9/9/16

Keywords

Circulant Permutation Matrix (CPM)
Girth
Low Density Parity Check (LDPC) codes
Progressive Edge-Growth (PEG)
Quasi-cyclic (QC)

ASJC Scopus subject areas

Computational Theory and Mathematics
Information Systems
Theoretical Computer Science

Access to Document

10.1109/ISTC.2016.7593094

Fingerprint Dive into the research topics of 'Improved PEG construction of large girth QC-LDPC codes'. Together they form a unique fingerprint.

Cite this

Improved PEG construction of large girth QC-LDPC codes. / Diouf, Madiagne; Declercq, David; Fossorier, Marc; Ouya, Samuel; Vasic, Bane V.

2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016. Vol. 2016-October IEEE Computer Society, 2016. p. 146-150 7593094.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Diouf, M, Declercq, D, Fossorier, M, Ouya, S & Vasic, BV 2016, Improved PEG construction of large girth QC-LDPC codes. in 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016. vol. 2016-October, 7593094, IEEE Computer Society, pp. 146-150, 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016, Brest, France, 9/5/16. https://doi.org/10.1109/ISTC.2016.7593094

@inproceedings{a632d4d78c7b4524b938fea7c81367f0,

title = "Improved PEG construction of large girth QC-LDPC codes",

abstract = "In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix pmin and error performance.",

keywords = "Circulant Permutation Matrix (CPM), Girth, Low Density Parity Check (LDPC) codes, Progressive Edge-Growth (PEG), Quasi-cyclic (QC)",

author = "Madiagne Diouf and David Declercq and Marc Fossorier and Samuel Ouya and Vasic, {Bane V}",

year = "2016",

month = oct,

day = "17",

doi = "10.1109/ISTC.2016.7593094",

language = "English (US)",

volume = "2016-October",

pages = "146--150",

booktitle = "2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016",

publisher = "IEEE Computer Society",

note = "9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 ; Conference date: 05-09-2016 Through 09-09-2016",

}

TY - GEN

T1 - Improved PEG construction of large girth QC-LDPC codes

AU - Diouf, Madiagne

AU - Declercq, David

AU - Fossorier, Marc

AU - Ouya, Samuel

AU - Vasic, Bane V

PY - 2016/10/17

Y1 - 2016/10/17

N2 - In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix pmin and error performance.

AB - In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only the candidates that ensure the maximization of local girth for a code of girth g ≥ 10 and thus avoid a posteriori verification after the creation of a new edge i.e. keep the predictive philosophy of the PEG algorithm. The proposed method is applicable to both regular and irregular codes and also protograph type-I codes. Simulation results are presented to demonstrate the efficiency of our method in terms of minimum circulant permutation matrix pmin and error performance.

KW - Circulant Permutation Matrix (CPM)

KW - Girth

KW - Low Density Parity Check (LDPC) codes

KW - Progressive Edge-Growth (PEG)

KW - Quasi-cyclic (QC)

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

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

U2 - 10.1109/ISTC.2016.7593094

DO - 10.1109/ISTC.2016.7593094

M3 - Conference contribution

AN - SCOPUS:84994417362

VL - 2016-October

SP - 146

EP - 150

BT - 2016 9th International Symposium on Turbo Codes and Iterative Information Processing: Paths to 5G and Beyond, ISTC 2016

PB - IEEE Computer Society

T2 - 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016

Y2 - 5 September 2016 through 9 September 2016

ER -