Accumulate Repeat Accumulate Check Accumulate Codes

Ki Jun Jeon, Kwang Soon Kim

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, a novel accumulate-repeat-accumulate-check-accumulate (ARACA) code is proposed as a subclass of protograph-based low-density parity-check (LDPC) codes. The key feature of the proposed ARACA code is represented by the outer connection doping in the protograph. This feature can provide the linear minimum distance growth (LMDG) property at a good iterative decoding threshold while maintaining an efficient encoder structure. The effect of the outer connection doping on the typical minimum distance, the iterative decoding threshold, and the LMDG property is discussed and analyzed by comparing case examples and using the asymptotic protograph ensemble weight enumerator. Some good ARACA code protographs are provided for a wide range of code rates. In addition, an efficient and universal encoding procedure and the corresponding encoder structure are provided for them. The performance of the proposed ARACA code is evaluated and compared with well-known good LDPC codes. The simulation results confirm the superiority of the proposed ARACA codes in terms of encoding complexity and frame error rate performance, especially at low-rates in an ultra-reliable regime.

Original languageEnglish
Article number7973156
Pages (from-to)4585-4599
Number of pages15
JournalIEEE Transactions on Communications
Volume65
Issue number11
DOIs
Publication statusPublished - 2017 Nov 1

Fingerprint

Iterative decoding
Doping (additives)

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{b7df8d793cf941849064b2ff6e95111d,
title = "Accumulate Repeat Accumulate Check Accumulate Codes",
abstract = "In this paper, a novel accumulate-repeat-accumulate-check-accumulate (ARACA) code is proposed as a subclass of protograph-based low-density parity-check (LDPC) codes. The key feature of the proposed ARACA code is represented by the outer connection doping in the protograph. This feature can provide the linear minimum distance growth (LMDG) property at a good iterative decoding threshold while maintaining an efficient encoder structure. The effect of the outer connection doping on the typical minimum distance, the iterative decoding threshold, and the LMDG property is discussed and analyzed by comparing case examples and using the asymptotic protograph ensemble weight enumerator. Some good ARACA code protographs are provided for a wide range of code rates. In addition, an efficient and universal encoding procedure and the corresponding encoder structure are provided for them. The performance of the proposed ARACA code is evaluated and compared with well-known good LDPC codes. The simulation results confirm the superiority of the proposed ARACA codes in terms of encoding complexity and frame error rate performance, especially at low-rates in an ultra-reliable regime.",
author = "Jeon, {Ki Jun} and Kim, {Kwang Soon}",
year = "2017",
month = "11",
day = "1",
doi = "10.1109/TCOMM.2017.2725276",
language = "English",
volume = "65",
pages = "4585--4599",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

Accumulate Repeat Accumulate Check Accumulate Codes. / Jeon, Ki Jun; Kim, Kwang Soon.

In: IEEE Transactions on Communications, Vol. 65, No. 11, 7973156, 01.11.2017, p. 4585-4599.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Accumulate Repeat Accumulate Check Accumulate Codes

AU - Jeon, Ki Jun

AU - Kim, Kwang Soon

PY - 2017/11/1

Y1 - 2017/11/1

N2 - In this paper, a novel accumulate-repeat-accumulate-check-accumulate (ARACA) code is proposed as a subclass of protograph-based low-density parity-check (LDPC) codes. The key feature of the proposed ARACA code is represented by the outer connection doping in the protograph. This feature can provide the linear minimum distance growth (LMDG) property at a good iterative decoding threshold while maintaining an efficient encoder structure. The effect of the outer connection doping on the typical minimum distance, the iterative decoding threshold, and the LMDG property is discussed and analyzed by comparing case examples and using the asymptotic protograph ensemble weight enumerator. Some good ARACA code protographs are provided for a wide range of code rates. In addition, an efficient and universal encoding procedure and the corresponding encoder structure are provided for them. The performance of the proposed ARACA code is evaluated and compared with well-known good LDPC codes. The simulation results confirm the superiority of the proposed ARACA codes in terms of encoding complexity and frame error rate performance, especially at low-rates in an ultra-reliable regime.

AB - In this paper, a novel accumulate-repeat-accumulate-check-accumulate (ARACA) code is proposed as a subclass of protograph-based low-density parity-check (LDPC) codes. The key feature of the proposed ARACA code is represented by the outer connection doping in the protograph. This feature can provide the linear minimum distance growth (LMDG) property at a good iterative decoding threshold while maintaining an efficient encoder structure. The effect of the outer connection doping on the typical minimum distance, the iterative decoding threshold, and the LMDG property is discussed and analyzed by comparing case examples and using the asymptotic protograph ensemble weight enumerator. Some good ARACA code protographs are provided for a wide range of code rates. In addition, an efficient and universal encoding procedure and the corresponding encoder structure are provided for them. The performance of the proposed ARACA code is evaluated and compared with well-known good LDPC codes. The simulation results confirm the superiority of the proposed ARACA codes in terms of encoding complexity and frame error rate performance, especially at low-rates in an ultra-reliable regime.

UR - http://www.scopus.com/inward/record.url?scp=85023622831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023622831&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2017.2725276

DO - 10.1109/TCOMM.2017.2725276

M3 - Article

AN - SCOPUS:85023622831

VL - 65

SP - 4585

EP - 4599

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 11

M1 - 7973156

ER -