计算机应用研究2018，Vol.35Issue(1)：199-203,207,6.DOI:10.3969/j.issn.1001-3695.2018.01.042
大列重低复杂度的QC-LDPC码构造
Construction of large column weight QC-LDPC codes with low complexity
摘要
Abstract
For the issue of inflexible parameters with respect to the small column weight and code rate of the parity check matrix in the quasi-cyclic low-density parity-check(QC-LDPC) codes,this paper presented a construction method with large column weight and deterministic structure.By making use of the feature that common difference between the elements in the exponent matrix,this method constructed a parity check matrix that the girth was eight,with the structure of quasi cyclic.On this basis,the above method combined with the quasi dual-diagonal structure to construct the QC-LDPC codes,which not only maintained the girth of the QC-LDPC codes with incapable decrease,but also had double peculiarities with lower encoding complexity due to the property of fast encoding.Over an additive white Gauss noise (AWGN) channel and under the belief propagation(BP) decoding algorithm,the simulation results show that the SNR of the proposed QC-LDPC codes is better than the codes constructed based on the greatest common divisor(GCD) algorithm close to 0.5 dB at the BER performance of 10-6,compared with the classcal progressive edge growth (PEG) algorithm in random construction method,the codes get an improvement of O.2 dB at the BER of 10-5.关键词
列重/围长/低复杂度/准循环低密度奇偶校验码Key words
column weight/girth/low complexity/quasi-cyclic low-density parity-check(QC-LDPC) codes分类
信息技术与安全科学引用本文复制引用
赵辉,郭振勇,彭海英..大列重低复杂度的QC-LDPC码构造[J].计算机应用研究,2018,35(1):199-203,207,6.基金项目
国家自然科学基金资助项目(61271261) （61271261）
重庆市科委自然科学基金资助项目(CSTC2012jjA40048) （CSTC2012jjA40048）
