Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth  

作　　者：REN PinYi YUAN Qiang WANG Rui CAI Jun 

机构地区：[1]School of Electronic Engineering, Xi ' an Jiaotong University, Xi ' an 710049, China [2]Wuhan Ordnance Noncommissioned Officers Academy, Wuhan 430075, China [3]Department of Electrical & Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 5V6, Canada

出　　处：《Science China(Information Sciences)》2011年第2期371-380,共10页中国科学（信息科学）（英文版）

基　　金：supported by the National Natural Science Foundation of China (Grant No. 60832007);National Hi-Tech Research and Development Program of China (Grant No. 2006AA01Z262)

摘　　要：In this paper, a novel method for constructing quasi-cyclic LDPC codes with low complexity is proposed. By choosing each circulant permutation matrix sequentially, the proposed method ensures that the current circulant permutation matrix forms no cycles of length smaller than g with the existent circulant permutation matrices. The construction complexity of the proposed algorithm is much lower than that of the random construction. Simulation results show that the proposed QC-LDPC codes can outperform both the random regular LDPC codes with short to moderate block lengths, and the proposed construction method LDPC codes based on the finite geometries in terms of bit-error-rate （BER）.In this paper, a novel method for constructing quasi-cyclic LDPC codes with low complexity is proposed. By choosing each circulant permutation matrix sequentially, the proposed method ensures that the current circulant permutation matrix forms no cycles of length smaller than g with the existent circulant permutation matrices. The construction complexity of the proposed algorithm is much lower than that of the random construction. Simulation results show that the proposed QC-LDPC codes can outperform both the random regular LDPC codes with short to moderate block lengths, and the proposed construction method LDPC codes based on the finite geometries in terms of bit-error-rate （BER）.

关 键 词：quasi-cyclic （QC） LDPC （low-density parity-check） codes circulant permutation matrix GIRTH 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] TN911.22[自动化与计算机技术—计算机科学与技术]