Abstract: A decoding method of low-density parity-check (LDPC) codes based on partial average residual belief propagation includes the following steps: S1: calculating a size of a cluster ? in a protograph based on a code length m and a code rate of a target codeword; S2: pre-computing an edge residual rci?vj corresponding to each edge from a variable node to a check node in a check matrix H; S3: calculating, based on ?, a partial average residual (PAR) value corresponding to each cluster in the check matrix H; S4: sorting m/? clusters in descending order of corresponding PAR values, and updating an edge with a largest edge residual in each cluster; S5: updating edge information mci?vi from a check node ci to a variable node vj, and then updating a log-likelihood ratio (LLR) value L(vj) of the variable node vj; and S6: after the updating, making a decoding decision.

Abstract: A decoding method of low-density parity-check (LDPC) codes based on partial average residual belief propagation includes the following steps: S1: calculating a size of a cluster ? in a protograph based on a code length m and a code rate of a target codeword; S2: pre-computing an edge residual rci?vj corresponding to each edge from a variable node to a check node in a check matrix H; S3: calculating, based on ?, a partial average residual (PAR) value corresponding to each cluster in the check matrix H; S4: sorting m/? clusters in descending order of corresponding PAR values, and updating an edge with a largest edge residual in each cluster; S5: updating edge information mc?vi from a check node ci to a variable node vj, and then updating a log-likelihood ratio (LLR) value L(vj) of the variable node vj; and S6: after the updating, making a decoding decision.