西安电子科技大学学报（自然科学版）2017，Vol.44Issue(3)：31-35,42,6.DOI:10.3969/j.issn.1001-2400.2017.03.006
可分解的可分组设计构造的LDPC码
LDPC codes constructed from resolvable group divisible designs
摘要
Abstract
A new construction method for low-density parity-check (LDPC) codes is presented based on resolvable group divisible designs (RGDDs).The resulting LDPC codes are free of 4-cycle.With the use of RGDDs,a class of masking matrices is also constructed,and then many more quasi-cyclic (QC) LDPC codes are obtained by the masking technique.Numerical results show that the proposed LDPC codes with iterative decoding using the sum-product algorithm perform very well over the AWGN channel.Furthermore,the QC-LDPC codes constructed based on masking have a better BER/FER performance than the original ones.关键词
低密度校验码/围长/掩模/可分解的可分组设计Key words
LDPC codes/girth/masking/resolvable group divisible designs分类
信息技术与安全科学引用本文复制引用
孙成,徐恒舟,冯丹,白宝明,张玉龙..可分解的可分组设计构造的LDPC码[J].西安电子科技大学学报（自然科学版）,2017,44(3):31-35,42,6.基金项目
国家自然科学基金资助项目(61372074) （61372074）
国家高科技863计划重大资助项目(2015AA01A709) （2015AA01A709）
国家重点基础研究发展计划(“973”计划)资助项目(2012CB316103) （“973”计划）
