递归构造低密度校验(LDPC)码的方法  

Recursive construction of LDPC codes

作　　者：刘斌彬[1] 白栋[2] 梅顺良[1] 

机构地区：[1]清华大学电子工程系,北京100084 [2]北京大学电子学系,北京100871

出　　处：《清华大学学报（自然科学版）》2007年第10期1638-1641,共4页Journal of Tsinghua University(Science and Technology)

摘　　要：针对Tanner图中圈的增加会影响码的性能的问题,提出了一种递归构造低密度校验(LDPC)码的方法。该方法利用一个短的LDPC码的校验矩阵作为其母矩阵,在此基础上采用循环置换矩阵构造一个长的LDPC码。通过对循环转置矩阵的参数进行约束,可以保证所构造的长码的Tanner图中指定长度的圈的个数等于或者小于其短码,且可以构造规则或者非规则的LDPC码。仿真结果表明,采用该方法构造的LDPC码具有较低的误码平台,其性能与好的随机LDPC码几乎相同。To reduce the cycles in the Tanner graph which may affect the code performance, a recursive method to construct low-density parity-check （LDPC） codes was proposed. The method used a parity-check matrix of a short LDPC code as its mother matrix upon which a long code was constructed with circulant permutation matrices. By choosing the circulant permutation matrix parameters properly, the number of cycles having a given length in the Tanner graph of the constructed long codes were equal to or less than that of the short code. Either regular or irregular LDPC codes were constructed. Simulation results show that the LDPC codes constructed by this method have very low error-floor and almost no performance degradation due to their special structure as compared with random LDPC codes.

关 键 词：低密度校验(LDPC)码 构造 循环置换矩阵 圈 

分 类 号：TN911.22[电子电信—通信与信息系统]