Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, one has a uniform degree distribution and the other a non-uniform one over a BEC (Binary Erasure Channel) and a BSC (Binary Symmetric Channel) thorough DE (Density Evolution). We then derive sufficient conditions on the erasure probability of a BEC and the error probability of a BSC, under which the LDPC code ensembles with uniform degree distributions outperform those with non-uniform degree distributions.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shinya MIYAMOTO, Kenta KASAI, Kohichi SAKANIWA, "Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 2, pp. 531-534, February 2007, doi: 10.1093/ietfec/e90-a.2.531.
Abstract: Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, one has a uniform degree distribution and the other a non-uniform one over a BEC (Binary Erasure Channel) and a BSC (Binary Symmetric Channel) thorough DE (Density Evolution). We then derive sufficient conditions on the erasure probability of a BEC and the error probability of a BSC, under which the LDPC code ensembles with uniform degree distributions outperform those with non-uniform degree distributions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.2.531/_p
Copy
@ARTICLE{e90-a_2_531,
author={Shinya MIYAMOTO, Kenta KASAI, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code},
year={2007},
volume={E90-A},
number={2},
pages={531-534},
abstract={Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, one has a uniform degree distribution and the other a non-uniform one over a BEC (Binary Erasure Channel) and a BSC (Binary Symmetric Channel) thorough DE (Density Evolution). We then derive sufficient conditions on the erasure probability of a BEC and the error probability of a BSC, under which the LDPC code ensembles with uniform degree distributions outperform those with non-uniform degree distributions.},
keywords={},
doi={10.1093/ietfec/e90-a.2.531},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 531
EP - 534
AU - Shinya MIYAMOTO
AU - Kenta KASAI
AU - Kohichi SAKANIWA
PY - 2007
DO - 10.1093/ietfec/e90-a.2.531
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2007
AB - Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, one has a uniform degree distribution and the other a non-uniform one over a BEC (Binary Erasure Channel) and a BSC (Binary Symmetric Channel) thorough DE (Density Evolution). We then derive sufficient conditions on the erasure probability of a BEC and the error probability of a BSC, under which the LDPC code ensembles with uniform degree distributions outperform those with non-uniform degree distributions.
ER -