Construction of Quasi-Cyclic LDPC Codes with Diagonal Structure of Parity-Check Matrices

被引：0

作者：

Xu, Hengzhou ^{[1
,2
]}

Li, Huaan ^{[2
]}

Zhu, Min ^{[2
]}

Zhang, Bo ^{[1
]}

Bai, Baoming ^{[2
]}

机构：

[1] Zhoukou Normal Univ, Sch Network Engn, Zhoukou 466001, Peoples R China

[2] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China

来源：

COMMUNICATIONS AND NETWORKING, CHINACOM 2017, PT I | 2018年 / 236卷

基金：

中国国家自然科学基金;

关键词：

LDPC code; Diagonal matrix; Prime field; Masking; Girth; BINARY;

D O I：

10.1007/978-3-319-78130-3_48

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Quasi-cyclic (QC) LDPC codes whose parity-check matrices have diagonal structure play an important role in channel coding of 5G communications. In this paper, we study an algebraic-based method for constructing QC LDPC codes with diagonal structure of parity-check matrices. We first analyze the cycle structure of this class of QC LDPC codes and then divide the diagonal parity-check matrix into two parts, i.e., the diagonal matrix and the non-diagonal matrix. By employing the masking technique, we design the non-diagonal matrix based on prime field and QC LDPC codes with diagonal structure of parity-check matrices are proposed. Numerical results show that the constructed QC LDPC codes perform much better than the WiMAX-LDPC codes.

引用

页码：460 / 469

页数：10

共 27 条

[11] LOW-DENSITY PARITY-CHECK CODES
GALLAGER, RG
[J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01): : 21 - &
[12] Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
Huang, Qin
Diao, Qiuju
Lin, Shu
Abdel-Ghaffar, Khaled
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) : 2648 - 2671
[13] New construction of quasi-cyclic LDPC codes based on special classes of BIBD's for the AWGN and binary erasure channels
Lan, Lan
Tai, Ying Yu
Lin, Shu
Memari, Behshad
Honary, Bahram
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (01) : 39 - 48
[14] Li JE, 2014, IEEE INT SYMP INFO, P2454, DOI 10.1109/ISIT.2014.6875275
[15] Near Shannon limit performance of low density parity check codes
MacKay, DJC
Neal, RM
[J]. ELECTRONICS LETTERS, 1996, 32 (18) : 1645 - 1646
[16] Good error-correcting codes based on very sparse matrices
MacKay, DJC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) : 399 - 431
[17] Low density parity check codes with semi-random parity check matrix
Ping, L
Leung, WK
Phamdo, N
[J]. ELECTRONICS LETTERS, 1999, 35 (01) : 38 - 39
[18] Sun C, 2016, INT SYM TURBO CODES, P271, DOI 10.1109/ISTC.2016.7593119
[19] A RECURSIVE APPROACH TO LOW COMPLEXITY CODES
TANNER, RM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (05) : 533 - 547
[20] Efficient Search of Girth-Optimal QC-LDPC Codes
Tasdighi, Alireza
Banihashemi, Amir H.
Sadeghi, Mohammad-Reza
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 1552 - 1564

← 1 2 3 →