基于二分图低密度奇偶校验码围长计算方法  

An Algorithm for Checking Girth of Low Density Parity Check Codes in Bipartite Graphs

作　　者：张志亮[1] 刘英[1] 周红[1] 

机构地区：[1]四川大学锦城学院,四川成都611731

出　　处：《信息与电子工程》2009年第2期119-122,共4页information and electronic engineering

摘　　要：对于任意给定的低密度奇偶校验(LDPC)码,快速计算其围长具有重要意义。通过对基于二分图LDPC码围长计算方法进行研究,提出了一种快速计算围长并能给出各校验节点(或信息节点)上经过的最短环个数的算法。通过MATLAB仿真测试表明,该算法对于PEGReg504x1008这样大规模的LDPC码H矩阵,只需2.876s即可计算出该码的围长和各校验节点上经过的最短环个数,更说明该算法具有快速计算围长的能力。The girth is an indication of the quality of Low Density Parity Check（LDPC） Codes. For any given LDPC Codes, quickly checking their girths is of some important significance. An algorithm for quickly checking the girth of LDPC Codes in bipartite graphs is presented. This algorithm can also give out the numbers of the shortest cycles passing through the given check node （or bit node）. The testing result of this algorithm implemented in MATLAB shows that, even for large-scale Hmatrix of LDPC Codes like PEGReg504x1008, it takes only 2.876 s for the algorithm to finish checking.

关 键 词：低密度奇偶校验码 围长 二分图 病态路径 

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