Concerning the girth problem of Low-Density Parity-Check( LDPC) codes, a new rapid algorithm for detecting the girth of LDPC codes in combination with Dijkstra algorithm and the feature of Tanner graph was proposed, and the time complexity of this algorithms was lower. Compared with known algorithms, this algorithm not only can calculate rapidly, but also return the girth and edges only one time, thus avoiding redundant computation. At last, the simulation verifies the feasibility and efficiency of this new algorithm.%针对低密度奇偶校验码(LDPC)的围长计算复杂度较高的问题,结合Dijkstra算法及Tanner图的结构特点提出一种快速检测围长的新算法,该算法的时间复杂度较低.与目前的算法相比,该算法不仅计算速度快,且能一次性给出围长的大小及所经过的边,避免冗余计算.最后,通过实例仿真验证了该算法的可行性和高效性.
展开▼
