Fully Absorbing Set Enumerators for Protograph-Based LDPC Code Ensembles

doi:10.1109/LCOMM.2022.3208771

Fully Absorbing Set Enumerators for Protograph-Based LDPC Code Ensembles

2022-12-01

0

PRE

AI

DOI：10.1109/LCOMM.2022.3208771

原文链接

原文求助

摘要

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.

Keyword:

Fully absorbing sets

protograph-based LDPC codes

asymptotic enumeration

Fully Absorbing Set Enumerators for Protograph-Based LDPC Code Ensembles

摘要

期刊

机构