论文部分内容阅读
针对Tanner图中圈的增加会影响码的性能的问题,提出了一种递归构造低密度校验(LDPC)码的方法。该方法利用一个短的LDPC码的校验矩阵作为其母矩阵,在此基础上采用循环置换矩阵构造一个长的LDPC码。通过对循环转置矩阵的参数进行约束,可以保证所构造的长码的Tanner图中指定长度的圈的个数等于或者小于其短码,且可以构造规则或者非规则的LDPC码。仿真结果表明,采用该方法构造的LDPC码具有较低的误码平台,其性能与好的随机LDPC码几乎相同。
Aiming at the problem that the increase of the circle in the Tanner graph will affect the performance of the code, a recursive method of constructing low density parity check (LDPC) code is proposed. This method uses a short parity check matrix of LDPC codes as its mother matrix, and constructs a long LDPC code based on cyclic permutation matrix. By constraining the parameters of the cyclic transpose matrix, it is guaranteed that the number of designated length circles in the constructed Tanner graph of the long code is equal to or smaller than the short code, and regular or irregular LDPC codes can be constructed. The simulation results show that the LDPC code constructed by this method has a lower error code platform and its performance is almost the same as the good random LDPC code.