A Method of Restructuring LDPC Parity-Check Matrix
Bao Xi · 2016
To solve the problem of restructuring sparse parity-check matrix in low-density parity-check(LDPC) recognition processing, three algorithms are proposed. Through analyzing and comparing the LDPC recognition model with the tradition coding recognition models, the former one is defined as a problem of finding a group sparse-base which spans the dual-space of the coding. Then, by making the weight of check-vector as the optimized object, the 2-order linear transformation algorithm, p-order linear transformation algorithm, and linear relationship exhaustive searching algorithm are proposed to restructure sparse parity-check matrix of a LDPC code with suitable code length in an error free environment. The result of simulations show that these algorithms fit most of LDPC standards, including 802.16 e, 802.11 n, DVB-S2, GJB7296, GB20600 and so on.