PEG-like algorithm for LDPC codes
Gan Srirutchataboon, Ambar Bajpai, Lunchakorn Wuttisittikulkij, Piya Kovintavewat · 2014
Progressive Edge-Growth (PEG) algorithm is one of the promising methods to construct a parity-check matrix (or H matrix) with a large girth for low-density parity-check (LDPC) codes. However, generating a large H matrix based on a PEG algorithm usually requires a lot of computations because of its complexity. This paper proposes an alternative method based on a topology matrix to construct the H matrix, which has lower complexity than the PEG algorithm. We refer to the proposed method as a “PEG-like” algorithm. Results indicate that the proposed method can provide the same H matrix as the PEG algorithm does but with lower complexity.