Decoding method of LDPC codes based on partial average residual belief propagation

A decoding method of low-density parity-check (LDPC) codes based on partial average residual belief propagation (PARBP) executed in a computer system, the computer system comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor is operable to execute the computer program so as to implement the decoding method of LDPC codes based on PARBP, wherein the decoding method comprises the following steps:

• S1:
• calculating a cluster size π of a base matrix 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, wherein the check matrix H is obtained by lifting the base matrix based on a structural characteristic of the protograph;
• S3:
• calculating, based on π, a partial average residual (PAR) value corresponding to each cluster of m/π clusters in the check matrix H;
• S4:
• sorting the m/π clusters in descending order of corresponding PAR values, and updating an edge with a largest edge residual in each cluster of the m/π clusters;
• S5:
• updating edge information mci→vj 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;
• and if the decoding decision is successful or a maximum number of iterations is reached, ending the decoding;
• or if the decoding decision is unsuccessful and the maximum number of iterations is not reached, going to step S2 to continue decoding;
• wherein a formula for calculating the cluster size π in the protograph in step S1 is as follows:
• π=m÷bv
• wherein bv is a number of variable nodes in the base matrix and m denotes the code length.