The modification on the improved progressive-edge-growth (IPEG) algorithm is introduced in this paper, and the simulation of this algorithm is given based on the analysis of the algorithm. The advancements of the algorithm is increasing the connectivity of variable nodes using extrinsic message degree of variable nodes, which results in reducing the small stopping sets. Through computer simulation, the result shows that the codes constructed by the proposed algorithm have lower error floor than those constructed by the original IPEG algorithm%本文在对改进的IPEG算法分析的基础上,给出了这种算法的一种仿真实现.该算法的优点是增加了信息节点的连通性,从而减少了小停止集.仿真结果表明,与用IPEG算法相比较,利用此种方法构造的LDPC码具有更低的错误平层.
展开▼
