Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel
Abstract
Most existing works on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assume that the degree distributions of the two ends of a randomly selected edge are independent. In the paper, we take one step further and consider ensembles of LDPC codes with degree-degree correlations. For this, we propose two methods to construct an ensemble of degree-degree correlated LDPC codes. We then derive a system of density evolution equations for such degree-degree correlated LDPC codes over a binary erasure channel (BEC). By conducting extensive numerical experiments, we show how the degree-degree correlation affects the performance of LDPC codes. Our numerical results show that LDPC codes with negative degree-degree correlation could improve the maximum tolerable erasure probability. Moreover, increasing the negative degree-degree correlation could lead to better unequal error protection (UEP) design.
Cite
@article{arxiv.2211.07085,
title = {Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel},
author = {Hsiao-Wen Yu and Cheng-En Lee and Ruhui Zhang and Cheng-Shang Chang and Duan-Shin Lee},
journal= {arXiv preprint arXiv:2211.07085},
year = {2023}
}
Comments
accepted by the 2023 IEEE International Symposium on Information Theory (ISIT)