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
N1 - Funding Information:
Bane Vasi? acknowledges support off NSF under grants CCF-1314147 and ECCS-1500170.
Publisher Copyright:
© 2016 IEEE.
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
T3 - International Symposium on Turbo Codes and Iterative Information Processing, ISTC
SP - 146
EP - 150
BT - 2016 9th International Symposium on Turbo Codes and Iterative Information Processing
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 -