基于子集矩阵的LDLC短环消除方法  

Subset-Matrix Based on Short Loop Remove Method for LDLC

作　　者：朱联祥[1] 李想[1] 

机构地区：[1]重庆邮电大学信号与信息处理重庆市重点实验室,重庆400065

出　　处：《电视技术》2014年第3期131-134,166,共5页Video Engineering

摘　　要：为了高效地译码,需要构造没有短环的LDLC(Low Density Lattice Codes)校验矩阵。应用一种基于子集矩阵的方法,在子集矩阵中去除4环及6环,然后结合Tanner图,得到需要的校验矩阵。利用子集矩阵,计算复杂度与码长无关并且没有新的短环生成,使用该方法可以灵活地构造各种码长的LDLC码。仿真结果表明,在高斯白噪声信道下,与只去除了4环的LDLC码相比,应用该方法去除了6环以后,译码性能具有较大提高。In order to decode efficiently, a LDLC （Low Density Lattice Codes） check matrix without short loops needs to be constructed. In this paper, a method based on subset-matrix is applied that all 4-loops and 6-loops are removed in subset-matrix, and after combining with Tanner graph, the nee- ded LDLC check matrix can be got. By using subset-matrlx, computation complexity has nothing to do with the code length and no new short loop is gen- erated, and the LDLC codes with variable code length can be constructed by using this method. Simulation result in AWGN channel shows that, by ap- plying this method removing all 6-loops, the performance in decoding is much better compared with the LDLC code with no 4-loop.

关 键 词：低密度格码 子集矩阵 短环 TANNER图 译码 

分 类 号：TN911.22[电子电信—通信与信息系统]