电子科技大学学报2016，Vol.45Issue(2)：174-178,184,6.DOI:10.3969/j.issn.1001-0548.2016.03.003
基于卢卡斯数列的大围长QC-LDPC码构造方法
Construction Method of Large Girth QC-LDPC Codes Based on Lucas Sequences
摘要
Abstract
This paper proposes a construction method of regular (j,k) Lucas quasi-cyclic low-density parity-check (L-QC-LDPC) codes with girth at least eight based on the Lucas sequence. By this method, the girth of L-QC-LDPC codes is large, which can effectively eliminate short cycles. Besides,lower bound of circulant permutation submatrix dimensionpis allowed continuous values. In addition, it can save the storage space in terms of hardware implementation which reduces the cost and complexity of hardware realization correspondingly. Simulation results show that the L-QC-LDPC codes have net coding gain (NCG) of about 2dB and 0.8dB compared with one-coincidence sequence quasi-cyclic LDPC (OCS-LDPC) codes and deterministic codes, respectively, at code rate of 1/2, code length of 1302 and bit error rate (BER) of 10−6. At the same condition,the performance of L-QC-LDPC codes is slightly better than that of the quadratic function LDPC (QF-LDPC) codes, which has an NCG improvement of around 0.1dB. Meanwhile, at code rate of 1/2,similar code length and BER of 10-6, the NCG of L-QC-LDPC codesoutweigh about 0.5dB compared with that of QC-LDPC codes based on cyclic subgroups of finite fields.关键词
大围长/卢卡斯数列/净编码增益/准循环低密度奇偶校验码Key words
large girth/Lucas sequence/net code gain(NCG)/quasi-cyclic low-density parity-check code分类
信息技术与安全科学引用本文复制引用
黄胜,庞晓磊,贾雪婷,袁建国..基于卢卡斯数列的大围长QC-LDPC码构造方法[J].电子科技大学学报,2016,45(2):174-178,184,6.基金项目
国家自然科学基金(61371096,61171158，61275077)；重庆市自然科学基金(cstc2013jcyjA40052，cstc2012jjA40060)；重庆市教委科学技术研究项目(KJ130515) （61371096,61171158，61275077）
