PEG based Construction of Irregular QC-LDPC Codes by jointly Optimizing the Girth and the Number and ACE of Short cycles

被引：0

作者：

Wang, Dongdong ^{[1
,2
,3
]}

Guo, Yantao ^{[1
,2
]}

Wang, Zhihui ^{[3
]}

Wang, Liqian ^{[3
]}

Chen, Xue ^{[3
]}

机构：

[1] China Elect Technol Grp Corp, Res Inst 54, Shijiazhuang 050081, Hebei, Peoples R China

[2] Sci & Technol Commun Networks Lab, Shijiazhuang 050081, Hebei, Peoples R China

[3] Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China

来源：

2019 18TH INTERNATIONAL CONFERENCE ON OPTICAL COMMUNICATIONS AND NETWORKS (ICOCN) | 2019年

关键词：

Irregular quasi-cyclic (QC) LDPC codes; Masking; Progressive Edge Growth (PEG); Girth; Approximate Cycle Extrinsic Message Degree (ACE);

D O I：

10.1109/icocn.2019.8934212

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this paper, we consider the construction of irregular QC-LDPC codes by jointly optimizing the girth, the number and approximate cycle extrinsic message degree (ACE) of short cycles to further improve the error-floor performance of irregular QC-LDPC codes with given degree distributions. By selecting the best edges, each of which must make the cycles consisting of the current variable node have the best lower bound of ACE or the minimum number of cycles with ACE lower bound, for each variable node via the progressive Edge growth (PEG) approaches, irregular QC-LDPC codes with better tradeoff between girth, the shortest cycle number and ACE could be constructed. Simulation results show that the proposed codes achieve better error-floor performance compared with the codes using the same degree distributions constructed by the recent proposed methods.

引用

页数：3

共 11 条

[1]

Chang D., 2011, P OFC NFOEC

[2] Next Generation FEC for High-Capacity Communication in Optical Transport Networks [J].

Djordjevic, Ivan B. ;

Arabaci, Murat ;

Minkov, Lyubomir L. .

JOURNAL OF LIGHTWAVE TECHNOLOGY, 2009, 27 (16) :3518-3530

[3] Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization [J].

Han, Guojun ;

Guan, Yong Liang ;

Kong, Lingjun .

IEEE COMMUNICATIONS LETTERS, 2014, 18 (02) :348-351

[4]

Li Jiang, 2015, 2015 IEEE International Test Conference (ITC), P1, DOI 10.1109/TEST.2015.7342423

[5] Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme [J].

Li, Juane ;

Liu, Keke ;

Lin, Shu ;

Abdel-Ghaffar, Khaled .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (08) :2626-2637

[6]

Ryan W., 2009, Channel Codes: Classical and Modern

[7] Design of low-density parity-check codes for modulation and detection [J].

ten Brink, S ;

Kramer, G ;

Ashikhmin, A .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (04) :670-678

[8] Construction of QC-LDPC Codes Based on Pre-Masking and Local Optimal Searching [J].

Wang, Dongdong ;

Wang, Liqian ;

Chen, Xue ;

Fei, Aimei ;

Ju, Chen ;

Wang, Zhirong .

IEEE COMMUNICATIONS LETTERS, 2018, 22 (06) :1148-1151

[9] Construction of Quasi-Cyclic LDPC Codes via Masking With Successive Cycle Elimination [J].

Xu, Hengzhou ;

Feng, Dan ;

Luo, Rui ;

Bai, Baoming .

IEEE COMMUNICATIONS LETTERS, 2016, 20 (12) :2370-2373

[10] Superposition Construction of Q-Ary LDPC Codes by Jointly Optimizing Girth and Number of Shortest Cycles [J].

Xu, Hengzhou ;

Bai, Baoming .

IEEE COMMUNICATIONS LETTERS, 2016, 20 (07) :1285-1288

← 1 2 →