Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have