2019
DOI: 10.1109/lpt.2019.2927029
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of QC-LDPC Codes by Edge Exchange Method Based on ACE

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…In fact, there exist many cycles in an LDPC code with finite length. Hence, in order to avoid short cycles or obtain LDPC codes with large girth, many construction methods and techniques are proposed [25][26][27][28][29][30][31][32][33].…”
Section: : ð3þmentioning
confidence: 99%
See 1 more Smart Citation
“…In fact, there exist many cycles in an LDPC code with finite length. Hence, in order to avoid short cycles or obtain LDPC codes with large girth, many construction methods and techniques are proposed [25][26][27][28][29][30][31][32][33].…”
Section: : ð3þmentioning
confidence: 99%
“…Based on the prime field GF (31), we can construct an 8 × 16 array HðP 8×16,1 Þ of 31 × 31 CPMs in the form of (13) by choosing the 8 rows and 16 columns from the exponent matrix P in equation(12). The indices of the chosen 8 rows and 16 columns from P are {3, 4, 5, 10, 15, 17, 24, 28} and {1,4,5,6,7,8,9,10,11,15,16,19,26,28,29, 30}, respectively. The row and column selection method is based on the proposed method in…”
mentioning
confidence: 99%