Relation Between GCD Constraint and Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight

被引：10

作者：

Zhang, Guohua ^{[1
]}

Hu, Yulin ^{[2
]}

Fang, Yi ^{[3
]}

Ren, Defeng ^{[1
]}

机构：

[1] Xian Univ Posts & Telecommun, Sch Commun & Informat Engn, Xian 710121, Peoples R China

[2] Wuhan Univ, Sch Elect Informat, Wuhan 430072, Peoples R China

[3] Guangdong Univ Technol, Sch Informat Engn, Guangzhou 510006, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2021年 / 25卷 / 09期

关键词：

Circulant permutation matrix (CPM); girth; low-density parity-check (LDPC) codes; quasi-cyclic (QC);

D O I：

10.1109/LCOMM.2021.3096386

中图分类号：

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

学科分类号：

0809 ;

摘要：

The greatest-common-divisor (GCD) method is a general framework employing a set of simple inequalities (called GCD constraint) to guarantee girth eight for a class of (J, L) quasi-cyclic (QC) low-density parity-check (LDPC) codes. However, an important problem, i.e., whether the GCD constraint is necessary for this class of codes to have girth eight, remains open. In this letter, the question is answered affirmatively, following which a novel algorithm aiming to find the shortest codes with girth eight in such a class is proposed. Besides, a close connection is established between the GCD method and the base expansion method, which are both applicable for any J and any L.

引用

页码：2820 / 2823

页数：4

共 14 条

[1]

Battaglioni M., 2018, P IEEE 29 ANN INT S, P1

[2] Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth [J].

Bocharova, Irina E. ;

Hug, Florian ;

Johannesson, Rolf ;

Kudryashov, Boris D. ;

Satyukov, Roman V. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (04) :2265-2279

[3] Physical-Layer Network Coding: An Efficient Technique for Wireless Communications [J].

Chen, Pingping ;

Xie, Zhaopeng ;

Fang, Yi ;

Chen, Zhifeng ;

Mumtaz, Shahid ;

Rodrigues, Joel J. P. C. .

IEEE NETWORK, 2020, 34 (02) :270-276

[4] Explicit APM-LDPC Codes With Girths 6, 8, and 10 [J].

Gholami, Mohammad ;

Alinia, Masoumeh .

IEEE SIGNAL PROCESSING LETTERS, 2017, 24 (06) :741-745

[5] On the Class of High-Rate QC-LDPC Codes With Girth 8 From Sequences Satisfied in GCD Condition [J].

Majdzade, Marjan ;

Gholami, Mohammad .

IEEE COMMUNICATIONS LETTERS, 2020, 24 (07) :1391-1394

[6] Designing Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes With Large Girth [J].

Mo, Shiyuan ;

Chen, Li ;

Costello, Daniel J., Jr. ;

Mitchell, David G. M. ;

Smarandache, Roxana ;

Qiu, Jie .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (09) :5326-5337

[7] Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes [J].

Sadeghi, Mohammad-Reza ;

Amirzade, Farzane .

IEEE COMMUNICATIONS LETTERS, 2020, 24 (04) :711-715

[8] Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes With Large Girth [J].

Tadayon, Mohammad H. ;

Tasdighi, Alireza ;

Battaglioni, Massimo ;

Baldi, Marco ;

Chiaraluce, Franco .

IEEE COMMUNICATIONS LETTERS, 2018, 22 (06) :1156-1159

[9]

Tanner R. M., 2001, P INT S COMM THEOR A, P1

[10] High-rate girth-eight low-density parity-check codes on rectangular integer lattices [J].

Vasic, B ;

Pedagani, K ;

Ivkovic, M .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (08) :1248-1252

← 1 2 →