Constructions of QC LDPC codes based on integer sequences  

作　　者：ZHANG LiJun LI Bing CHENG LeeLung 

机构地区：[1]School of Electronic and Information Engineering,Beijing Jiaotong University [2]Integrated Circuit Design Center,Space Star Technology Co.,Ltd,China Academy of Space Technology [3]Department of Electronic Engineering,City University of Hong Kong

出　　处：《Science China(Information Sciences)》2014年第6期36-49,共14页中国科学（信息科学）（英文版）

基　　金：supported by Fundamental Research Funds for the Central Universities(Grant No.2011JBZ003);National Natural Science Foundation of China(Grant Nos.61172022,61271199)

摘　　要：Based on difference sequence and Hoey sequence,three types of（2,F）and（3,F）quasi cyclic（QC）low-density parity-check（LDPC）codes are constructed.All 4-cycles and even 6-cycles are removed in the Tanner graph,and the girth is not less than six.The decoding complexity as well as extension to irregular case is analyzed.Simulation results show that in AWGN and Rayleigh fading channels,the codes can achieve the same error performance as their counterpart PEG codes,and outperform the corresponding MacKay codes and array codes.Based on difference sequence and Hoey sequence,three types of（2,F）and（3,F）quasi cyclic（QC）low-density parity-check（LDPC）codes are constructed.All 4-cycles and even 6-cycles are removed in the Tanner graph,and the girth is not less than six.The decoding complexity as well as extension to irregular case is analyzed.Simulation results show that in AWGN and Rayleigh fading channels,the codes can achieve the same error performance as their counterpart PEG codes,and outperform the corresponding MacKay codes and array codes.

关 键 词：quasi cyclic codes low-density parity-check codes integer sequences difference sequences Hoey sequence 

分 类 号：TN911.22[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]