The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes
In this paper, we propose the cycle-concentrating progressive edge growth (CC-PEG) algorithm for lifting protograph generalized low-density parity-check (GLDPC) codes. In GLDPC codes, <italic>undoped variable nodes</italic> (VNs) that are not connected to generalized constraint (GC) node...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10146256/ |
| _version_ | 1797803147785142272 |
|---|---|
| author | Dae-Young Yun Jae-Won Kim Hee-Youl Kwak Jong-Seon No |
| author_facet | Dae-Young Yun Jae-Won Kim Hee-Youl Kwak Jong-Seon No |
| author_sort | Dae-Young Yun |
| collection | DOAJ |
| description | In this paper, we propose the cycle-concentrating progressive edge growth (CC-PEG) algorithm for lifting protograph generalized low-density parity-check (GLDPC) codes. In GLDPC codes, <italic>undoped variable nodes</italic> (VNs) that are not connected to generalized constraint (GC) nodes are more vulnerable to channel errors than <italic>doped VNs</italic> protected by GC nodes. We observe that among GLDPC codes sharing the same protograph structure, codes with fewer local cycles at undoped VNs have better decoding performances. Inspired by this observation, the CC-PEG algorithm is proposed to concentrate local cycles at doped VNs and avoid local cycles at vulnerable undoped VNs during the lifting process. Specifically, the CC-PEG algorithm first collects edges that result in the maximum <italic>undoped girth</italic>, defined as the length of the shortest cycle containing undoped VNs. Following this, the CC-PEG algorithm selects the edge with the lowest <italic>concentrated cycle metric</italic>. Consequently, the lifted codes exhibit asymmetric cycle distributions concentrated around robust doped VNs. Simulation results for various protographs show that the CC-PEG algorithm achieves a performance gain of up to 20 times lower frame error rate compared to conventional lifting algorithms. |
| first_indexed | 2024-03-13T05:16:28Z |
| format | Article |
| id | doaj.art-c0cfe465b95840f18d309313ad837f8d |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-03-13T05:16:28Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-c0cfe465b95840f18d309313ad837f8d2023-06-15T23:00:50ZengIEEEIEEE Access2169-35362023-01-0111572855729410.1109/ACCESS.2023.328431410146256The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC CodesDae-Young Yun0https://orcid.org/0000-0003-2697-6338Jae-Won Kim1https://orcid.org/0000-0003-1608-5849Hee-Youl Kwak2https://orcid.org/0000-0002-4381-1968Jong-Seon No3https://orcid.org/0000-0002-3946-0958Department of Electrical and Computer Engineering, Seoul National University, Seoul, South KoreaDepartment of Electronic Engineering, Engineering Research Institute (ERI), Gyeongsang National University, Jinju, South KoreaDepartment of Electrical Engineering, University of Ulsan, Ulsan, South KoreaDepartment of Electrical and Computer Engineering, Seoul National University, Seoul, South KoreaIn this paper, we propose the cycle-concentrating progressive edge growth (CC-PEG) algorithm for lifting protograph generalized low-density parity-check (GLDPC) codes. In GLDPC codes, <italic>undoped variable nodes</italic> (VNs) that are not connected to generalized constraint (GC) nodes are more vulnerable to channel errors than <italic>doped VNs</italic> protected by GC nodes. We observe that among GLDPC codes sharing the same protograph structure, codes with fewer local cycles at undoped VNs have better decoding performances. Inspired by this observation, the CC-PEG algorithm is proposed to concentrate local cycles at doped VNs and avoid local cycles at vulnerable undoped VNs during the lifting process. Specifically, the CC-PEG algorithm first collects edges that result in the maximum <italic>undoped girth</italic>, defined as the length of the shortest cycle containing undoped VNs. Following this, the CC-PEG algorithm selects the edge with the lowest <italic>concentrated cycle metric</italic>. Consequently, the lifted codes exhibit asymmetric cycle distributions concentrated around robust doped VNs. Simulation results for various protographs show that the CC-PEG algorithm achieves a performance gain of up to 20 times lower frame error rate compared to conventional lifting algorithms.https://ieeexplore.ieee.org/document/10146256/Generalized low-density parity-check (GLDPC) codesprogressive edge growth (PEG) algorithmprotographquasi-cyclic LDPC (QC-LDPC) codes |
| spellingShingle | Dae-Young Yun Jae-Won Kim Hee-Youl Kwak Jong-Seon No The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes IEEE Access Generalized low-density parity-check (GLDPC) codes progressive edge growth (PEG) algorithm protograph quasi-cyclic LDPC (QC-LDPC) codes |
| title | The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes |
| title_full | The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes |
| title_fullStr | The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes |
| title_full_unstemmed | The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes |
| title_short | The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes |
| title_sort | cycle concentrating peg algorithm for protograph generalized ldpc codes |
| topic | Generalized low-density parity-check (GLDPC) codes progressive edge growth (PEG) algorithm protograph quasi-cyclic LDPC (QC-LDPC) codes |
| url | https://ieeexplore.ieee.org/document/10146256/ |
| work_keys_str_mv | AT daeyoungyun thecycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT jaewonkim thecycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT heeyoulkwak thecycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT jongseonno thecycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT daeyoungyun cycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT jaewonkim cycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT heeyoulkwak cycleconcentratingpegalgorithmforprotographgeneralizedldpccodes AT jongseonno cycleconcentratingpegalgorithmforprotographgeneralizedldpccodes |