通过推广Yang,Liu和Shi给出的从基矩阵到校验矩阵的环扩展约束条件,提出了一种大围长准循环LDPC码的构造算法.该算法改善了环消除算法的局部围长分布,获得了更好的纠错性能.仿真结果表明,在80次迭代置信传播译码下,采用本算法构造的1/2码率非规则LDPC码在Eb/N0为1.5 dB时,误码率为2×10^-6.
A novel construction algorithm for quasi-cyclic low-density parity-check codes is proposed,with which we can obtain the improved girth of the corresponding Tanner graph by generalizing Yang et al.'s constraint for any cycle detected in the base matrix to detect and break the cycles in the parity check matrix.Compared with the existing cycle elimination(CE) algorithm,a better error performance can be achieved and cycle-8 free.Simulation results show that the proposed algorithm for constructing the irregular LDPC code of rate 1/2 achieves the performance of codeword error rate of 2×10^-6at Eb/N0=1.5dB with 80 iterations by the belief-propagation decoding algorithm.