A class of quasi-cyclic LDPC codes from B2 （mod m） sequences

作     者：ZHANG GuoHua & WANG XinMei State Key Laboratory of Integrated Service Network,Xidian University,Xi’an 710071,China 

作者机构：State Key Laboratory of Integrated Service Network Xidian University Xi’an China 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2011年第54卷第8期

页      面：1645-1653页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程] 

基　　金：supported by the National Basic Research Program of China(Grant No.2010CB328300) the National Natural Science Foundation of China(Grant Nos.61001130,61001131) the“111”Project(GrantNo.B08038) 

主　　题：channel coding LDPC code B2 (mod m) sequencegirth 

摘      要：A new class of binary low-density parity-check (LDPC) codes is proposed based on B 2 (mod m) sequences. The parity-check matrix of such a code has a column weight of three and a row weight of an arbitrary integer,and a quasi-cyclic *** parity-check matrix also has a girth at least 8,and corresponds to a code with minimal distance at least *** m is prime,an 8-cycles reduction method is presented to completely avoid the two types of 8-cycles within the total four types existed in the Tanner *** results show that,for a prime integer m,the new LDPC code outperforms the random (quasi-) regular counterpart generated by the PEG ***,a heuristic algorithm based on a strategy called neighboring extension search is presented to search for the B 2 (mod m) sequences whose lengths approach or meet the upper bound.