检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:袁建国[1] 蒯家松 张帅康 YUAN Jianguo;KUAI Jiasong;ZHANG Shuaikang(Chongqing Key Laboratory of Photoelectronic Information Sensing and Transmitting Technology of ChongqingUniversity of Posts and Telecommunications,Chongqing 400065,P.R.China)
机构地区:[1]重庆邮电大学光电信息感测与传输技术重庆市重点实验室,重庆400065
出 处:《重庆邮电大学学报(自然科学版)》2023年第3期427-433,共7页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基 金:国家自然科学基金(61971079);重庆邮电大学大学生科研训练计划项目(A2021-68)。
摘 要:针对准循环低密度奇偶校验(quasi-cyclic low-density parity-check,QC-LDPC)码的短环结构会严重影响码字纠错性能的问题,基于Stanley序列(Stanley sequence,SS)提出一种围长至少为8的QC-LDPC码新颖构造方法。从Stanley序列中选取某些特定元素构成一个呈递增关系的集合,利用穷举算法搜索出满足无环4和环6条件的元素得到另一个递增集合,构造相应的指数矩阵,得到其奇偶校验矩阵。仿真结果表明,在误码率(bit error rate,BER)为10-6时,所构造的SS-QC-LDPC码与同码率码长的其他QC-LDPC码码型相比,其净编码增益均有一定提升,因而其纠错性能较好,且无错误平层现象。此外,该构造方法的计算复杂度较低。A novel construction method of the grith-8 regular quasi-cyclic low-density parity-check(QC-LDPC)code based on Stanley sequence(SS)is proposed to solve the problem that short girth structure will seriously affect the error-correction performance of the code-words.The method firstly constructs a shown increment correlation set by selecting some specific elements from Stanley sequence,and another increment set is obtained by using the exhaustive search algorithm to search for the elements that satisfy the conditions of no girth-4 and no girth-6.Then the corresponding exponent matrix is constructed.Finally,the parity-check matrix is obtained.Simulation results show that the net coding gain(NCG)of the SS-QC-LDPC code constructed by the proposed method is more than that of the other QC-LDPC codes with the same code-rate and code-length at the bit error rate(BER)of 10-6,so the constructed SS-QC-LDPC code has better error-correction performance and has no error floor phenomenon.In addition,the proposed construction method has low computational complexity.
关 键 词:准循环低密度奇偶校验码 Stanley序列 围长 净编码增益
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.194.168