论文部分内容阅读
提出基于链表的低密度校验(LDPC)码循环检测算法,通过将LDPC码校验矩阵中的非零元素逐层展开,得到具有层次结构的链表。比较链表中每一层的节点和上层的节点,可以得到矩阵中的全部循环。记录检测到的循环,能够得到矩阵中各种长度循环的准确数目,进而得到矩阵的周长(最短循环长度)。给出了算法的详细流程,并分析了实现复杂度。仿真结果表明,该算法可以有效的检测出矩阵中各种长度循环的准确数目,对LDPC码校验矩阵的设计和性能估计具有重要的指导意义。
A low-density parity-check (LDPC) code cycle detection algorithm based on linked list is proposed. The linked list with hierarchical structure is obtained by layer-by-layer expansion of non-zero elements in LDPC code parity check matrix. Comparing the nodes in each level and the nodes in the upper level can get all the loops in the matrix. Record the detected cycle, can get the exact number of cycles of various lengths in the matrix, and then get the perimeter of the matrix (the shortest cycle length). The detailed flow of the algorithm is given and the realization complexity is analyzed. The simulation results show that the algorithm can effectively detect the exact number of loops of various lengths in the matrix and is of great guiding significance for the design and performance estimation of LDPC code check matrix.