一种LDPC码校验矩阵消短环算法

LDPC码是一种逼近香农限、易实现和系统复杂度低的优秀的线性纠错码。本文中提到的LDPC码中的0-1矩阵问题就是:对给定的校验矩阵H(0-1矩阵),找到一个同阶的最好的循环置换扩张矩阵E以及适当最小正整数q,使得校验矩阵H中的所有短环(长度为4或不超过6)被消去,也即对应的E中整数的正负和不为q的倍数。最后实现了该算法。

An Algorithm of the Short Cycle in Check Matrix of LDPC be Eliminated

LDPC code which is near to the Shannon limit is an excellent linear error-correcting code,with the characteristics of easy implementation and low complexity.In the paper the problem of the 0-1 matrix in the LDPC code is to find the best same order loop permutation expansion matrix E,and the appropriately smallest positive integer q,for a given check-matrix H(i.e.0-1matrix) to make all the short cycles(length 4 or less than 6) in check-matrix H be eliminated,where the sum of positive and negative integers in matrix E is not a multiple of q.Finally this algorithm is implemented.