Irregular Repeat-Accumulate (IRA) codes, introduced by Jin et al., have a linear-time encoding algorithm and their decoding performance is comparable to that of irregular low-density parity-check (LDPC) codes. Meanwhile the authors have introduced detailedly represented irregular LDPC code ensembles specified with joint degree distributions between variable nodes and check nodes. In this paper, by using density evolution method [7],[8], we optimize IRA codes specified with joint degree distributions. Resulting codes have higher thresholds than Jin's IRA codes.
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
Kenta KASAI, Shinya MIYAMOTO, Tomoharu SHIBUYA, Kohichi SAKANIWA, "Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 11, pp. 3351-3354, November 2006, doi: 10.1093/ietfec/e89-a.11.3351.
Abstract: Irregular Repeat-Accumulate (IRA) codes, introduced by Jin et al., have a linear-time encoding algorithm and their decoding performance is comparable to that of irregular low-density parity-check (LDPC) codes. Meanwhile the authors have introduced detailedly represented irregular LDPC code ensembles specified with joint degree distributions between variable nodes and check nodes. In this paper, by using density evolution method [7],[8], we optimize IRA codes specified with joint degree distributions. Resulting codes have higher thresholds than Jin's IRA codes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.11.3351/_p
Copy
@ARTICLE{e89-a_11_3351,
author={Kenta KASAI, Shinya MIYAMOTO, Tomoharu SHIBUYA, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions},
year={2006},
volume={E89-A},
number={11},
pages={3351-3354},
abstract={Irregular Repeat-Accumulate (IRA) codes, introduced by Jin et al., have a linear-time encoding algorithm and their decoding performance is comparable to that of irregular low-density parity-check (LDPC) codes. Meanwhile the authors have introduced detailedly represented irregular LDPC code ensembles specified with joint degree distributions between variable nodes and check nodes. In this paper, by using density evolution method [7],[8], we optimize IRA codes specified with joint degree distributions. Resulting codes have higher thresholds than Jin's IRA codes.},
keywords={},
doi={10.1093/ietfec/e89-a.11.3351},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3351
EP - 3354
AU - Kenta KASAI
AU - Shinya MIYAMOTO
AU - Tomoharu SHIBUYA
AU - Kohichi SAKANIWA
PY - 2006
DO - 10.1093/ietfec/e89-a.11.3351
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2006
AB - Irregular Repeat-Accumulate (IRA) codes, introduced by Jin et al., have a linear-time encoding algorithm and their decoding performance is comparable to that of irregular low-density parity-check (LDPC) codes. Meanwhile the authors have introduced detailedly represented irregular LDPC code ensembles specified with joint degree distributions between variable nodes and check nodes. In this paper, by using density evolution method [7],[8], we optimize IRA codes specified with joint degree distributions. Resulting codes have higher thresholds than Jin's IRA codes.
ER -