Construction of non-binary quasi-cyclic LDPC codes based on PEG algorithm
Yuzhen Huang, Yunpeng Cheng, Yuming Zhang, Han Han · 2010
Progressive-edge-growth (PEG) algorithm is known to construct binary low-density parity-check codes at finite block lengths with very good performance. In this paper, we propose a simple method to construct quasi-cyclic extended non-binary LDPC codes based on PEG algorithm. Simulation results show that the quasi-cyclic extended non-binary LDPC codes have almost the same good error correcting performance as the non-binary LDPC codes randomly generated by PEG algorithm.