The Effect of PEG-Lifting Order on the Performance of Protograph GLDPC Codes

Generalized low density parity check (GLDPC) codes can be constructed by replacing some single parity check (SPC) nodes in LDPC codes with generalized constraint (GC) nodes. GC nodes are defined by component codes whose minimum distance is larger than that of SPC nodes. Therefore, the variable nodes...

Full description

Saved in:
Bibliographic Details
Published in2022 27th Asia Pacific Conference on Communications (APCC) pp. 315 - 316
Main Authors Yun, Dae-Young, Kim, Jae-Won, No, Jong-Seon
Format Conference Proceeding
LanguageEnglish
Published IEEE 19.10.2022
Subjects
Asia
Gaussian noise
Generalized low density parity check (GLDPC) codes
low density parity check (LDPC) codes
Parity check codes
Performance gain
progressive edge growth (PEG) algorithm
protograph
Online AccessGet full text

Cover

More Information
Summary:Generalized low density parity check (GLDPC) codes can be constructed by replacing some single parity check (SPC) nodes in LDPC codes with generalized constraint (GC) nodes. GC nodes are defined by component codes whose minimum distance is larger than that of SPC nodes. Therefore, the variable nodes (VNs) connected to GC nodes, which are called doped VNs, are more protected than the undoped VNs. Due to this effect, we observe that the doped VNs are more robust to local cycles. The distribution of local cycles is affected by the processing VN order of the progressive edge growth (PEG) algorithm, where the latter processed (lifted) VNs tend to have more local cycles. Based on the property of doped VNs and the PEG algorithm, we show that a tangible performance gain is achieved by placing the doped VNs in the latter order of the PEG algorithm compared to the former order. The performance gain is shown with a well known GLDPC code in the literature and over both the binary erasure channel and addictive white Gaussian noise channel.
DOI:10.1109/APCC55198.2022.9943671