.png){kind=icon}
.png){kind=icon}
Return
Fully Absorbing Set Enumerators for Protograph-Based LDPC Code Ensembles
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3208771.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The average finite-length (elementary) fully absorbing set enumerators for binary protograph-based low-density parity-check (LDPC) code ensembles are derived. The method relies on generating functions, and it provides an efficient mean to obtain the normalized logarithmic asymptotic distribution of (elementary) fully absorbing sets. Using these results, the asymptotic distribution of (elementary) fully absorbing sets is evaluated for some protograph-based LDPC code ensembles. Numerical results show how the distributions can be used to estimate the error floor performance of protograph LDPC codes.
Keywords:
Fully absorbing sets
protograph-based LDPC codes
asymptotic enumeration
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W