A construction algorithm with optimized shift value of circulant permutation matrix for QC-LDPC codes

被引：0

作者：

Zheng, Jian ^{[1
,2
]}

Bie, Hong-Xia ^{[1
]}

Lei, Chun-Yang ^{[1
]}

Zhang, Xue-Kun ^{[1
]}

Fang, Ming ^{[1
]}

机构：

[1] School of Information and Communication Engineering, Beijing University of Posts and Telecommunications

[2] Department of Medical Information Engineering, Zunyi Medical College

来源：

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | 2014年 / 37卷 / 01期

关键词：

Girth; Optimized shift value of circulant permutation matrix; Quasi-cyclic low-density parity check codes; The relationship between the basis matrix and the check matrix;

D O I：

10.13190/j.jbupt.2014.01.004

中图分类号：

学科分类号：

摘要：

A construction algorithm with optimized shift value of circulant permutation matrix for quasi-cyclic low-density parity check (QC-LDPC) codes was presented. Through analyzing the cycle relationships between the basis matrix and the check matrix, the number of short cycles was reduced and the girth of check matrix in QC-LDPC code was maximized. The simulation results show that the girth of QC-LDPC codes constructed by proposed algorithm could at least extend to 6 or 8, while the number of short cycles was decreased significantly. In the end, the bit error rate performance was effectively improved.

引用

页码：16 / 19

页数：3

共 10 条

[1]

Huang L., Wang Y., Gong P., An improved construction method of QC-LDPC codes based on the PEG algorithm, PACCS 2011, pp. 1-4, (2011)

[2]

Fan Z., Zhang W., Liu X., Et al., An improved algorithm for constructing QC-LDPC codes based on the PEG algorithm, ChinaCOM 2009, pp. 1-4, (2009)

[3]

Hu X., Eleftheriou E., Arnold D.M., Regular and irregular progressive edge-growth tanner graphs, IEEE Transactions on Information Theory, 51, 2, pp. 386-398, (2005)

[4]

He H., Xu Y., Cai Y., Irregular quasi-cyclic LDPC codes design with generalized ACE constraint, 2009 International Conference on Communications and Mobile Computing, pp. 196-199, (2009)

[5]

Li J., Di N., Yang M., Et al., Construction of quasi cyclic LDPC with ACE constraint, WCNIS 2010, pp. 90-93, (2010)

[6]

Xiao H., Banihashemi A.H., Improved progressive-edge-growth (PEG) construction of irregular LDPC codes, IEEE Communications Letters, 8, 12, pp. 715-717, (2004)

[7]

Myung S., Yang K., Kim J., Quasi-cyclic LDPC code construction with low error floor based on the IPEG algorithm, IEEE Communications Letters, 11, 7, pp. 607-609, (2007)

[8]

Tian T., Jones C., Villasenor J.D., Et al., Selective avoidance of cycles in irregular LDPC code construction, IEEE Transactions on Communications, 52, 8, pp. 1242-1247, (2004)

[9]

Fossorier M.P.C., Quasi cyclic low-density parity-check codes from circulant permutation matrices, IEEE Transactions on Information Theory, 50, 8, pp. 1788-1793, (2004)

[10]

Kong L., Yang X., Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC, Journal of Systems Engineering and Electronic, 21, 1, pp. 134-137, (2010)

← 1 →