基于Kirkman三元系的LDPC码的性能限研究  

Research on performance limits of LDPC codes based on Kirkman triple systems

作　　者：郭东亮 卓颖 傅鑫博 GUO Dong-liang;ZHUO Ying;FU Xin-bo(School of Electronics and Communication Engineering,Sun Yat-sen University,Shenzhen 518107,China)

机构地区：[1]中山大学电子与通信工程学院,广东深圳518107

出　　处：《吉林师范大学学报（自然科学版）》2023年第3期124-129,共6页Journal of Jilin Normal University:Natural Science Edition

基　　金：国家自然科学基金项目(61901534);中山大学教改项目(教务〔2021〕93号,教务〔2022〕20号)。

摘　　要：研究了基于Kirkman三元系构造的LDPC码的性能限,通过分析Tanner图的拓扑结构并结合数学归纳法推导出为避免Tanner图给定环长所需的最小码长,利用该结论并结合Kirkman三元系的约束条件推导出围长的下界和最小码距,此外分析了码率,并提出了一种基于删除Kirkman三元系平行类的码率调整方法,仿真实验证明了所提出的码率调整方法的有效性.The performance limit of LDPC codes constructed based on Kirkman triple systems was studied.By analyzing the topological structure of Tanner graph and combining mathematical induction,the minimum code length required to avoid the given cycle length of Tanner graph was deduced.Using this conclusion and the constraints of Kirkman triple systems,the lower bound of girth and the minimum code distance were deduced.In addition,the code rate was analyzed,and a rate adjustment method based on deleting the parallel classes of Kirkman triple systems was proposed,Simulation results confirmed the effectiveness of the proposed rate adjustment method.

关 键 词：KIRKMAN三元系 LDPC码 TANNER图 

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