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
N1 - Publisher Copyright:
© 2015 IEEE.
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
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1079
EP - 1083
BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Symposium on Information Theory, ISIT 2015
Y2 - 14 June 2015 through 19 June 2015
ER -