Modified CC-PEG Algorithm for Protograph-Based QC-LDPC Codes Over Non-Uniform Channel
Open Access
- 20 November 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 173660-173669
Abstract
In this paper, we propose the modified cycle-concentrating progressive-edge-growth (CC-PEG) algorithm for lifting protograph-based quasi-cyclic low-density parity-check (QC-LDPC) codes over the non-uniform additive white Gaussian noise (AWGN) channel. By introducing various selection criteria for shift values based on the non-uniform channel characteristics, we improve the decoding performances of lifted LDPC codes. From numerous simulation results, we demonstrate that each selection criterion is effective for the performance improvement and the modified CC-PEG algorithm outperforms the conventional lifting methods over the non-uniform AWGN channel. Furthermore, we analyze these simulation results based on some metrics such as the girth, number of cycles, and approximate cycle extrinsic message degree (ACE).Keywords
Funding Information
- Ministry of Science and ICT, South Korea (IITP-2024-RS-2022-00156409)
This publication has 16 references indexed in Scilit:
- The Effect of PEG-Lifting Order on the Performance of Protograph GLDPC Codes2022
- Construction of Protograph-Based Partially Doped Generalized LDPC CodesIEEE Access, 2022
- Design of Binary LDPC Codes With Parallel Vector Message PassingIEEE Transactions on Communications, 2017
- A PEG Construction of Finite-Length LDPC Codes with Low Error FloorIEEE Communications Letters, 2012
- LDPC code design considerations for non-uniform channelsIEEE Transactions on Communications, 2010
- Low-Complexity High-Speed Decoder Design for Quasi-Cyclic LDPC CodesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2007
- Efficient encoding of quasi-cyclic low-density parity-check codesIEEE Transactions on Communications, 2006
- Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC CodesIEEE Communications Letters, 2004
- Selective Avoidance of Cycles in Irregular LDPC Code ConstructionIEEE Transactions on Communications, 2004
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004