论文部分内容阅读
为了解决多进制低密度奇偶校验(LDPC)码的通用编码,从Tanner图结构出发,利用下三角和上三角(LU)分解进行编码的算法,以保证矩阵稀疏性为目标,详细推导了与分析行主元策略、行列主元策略和行列相乘主元策略等主元选取策略,并对所提算法进行了仿真.测试结果表明,相比于现有LDPC码LU分解编码方法,新算法能将矩阵稠密度降低一半以上,为多进制LDPC码通用编码算法的应用奠定了基础.
In order to solve the universal encoding of multi-LDPC codes, this paper starts from the Tanner graph structure, and uses the algorithm of lower triangular and upper triangular (LU) decomposition to encode. In order to ensure the matrix sparsity, And the analysis of the principal component strategy, the principal component strategy of ranks and the principal component strategy of ranks matrix multiplication, and the simulation results show that compared with the existing LDPC code LU decomposition coding method, the new The algorithm can reduce the density of the matrix by more than half, laying a foundation for the application of universal encoding algorithm of multi-LDPC codes.