Accumulate Repeat Accumulate Check Accumulate Codes

Ki Jun Jeon; Kwang Soon Kim

doi:10.1109/TCOMM.2017.2725276

Accumulate Repeat Accumulate Check Accumulate Codes

Ki Jun Jeon, Kwang Soon Kim

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English
Article number	7973156
Pages (from-to)	4585-4599
Number of pages	15
Journal	IEEE Transactions on Communications
Volume	65
Issue number	11
DOIs	https://doi.org/10.1109/TCOMM.2017.2725276
Publication status	Published - 2017 Nov

Bibliographical note

Funding Information:
Manuscript received March 3, 2017; revised June 6, 2017; accepted June 27, 2017. Date of publication July 11, 2017; date of current version November 15, 2017. This work was supported in part by Institute of Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) [2015-0-00300, Multiple Access Technique with Ultra-Low Latency and High Efficiency for Tactile Internet Services in IoT Environments] and in part by Basic Science Research Program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (NRF-2014R1A2A2A01007254). The associate editor coordinating the review of this paper and approving it for publication was L. Dolecek. (Corresponding author: Kwang Soon Kim.) The authors are with the Department of Electrical and Electronic Engineering, Yonsei University, 50 Yonsei-ro, Seodaemun-gu, Seoul 120-749, South Korea (e-mail:ks.kim@yonsei.ac.kr).

Publisher Copyright:
© 1972-2012 IEEE.

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/TCOMM.2017.2725276

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}",

note = "Funding Information: Manuscript received March 3, 2017; revised June 6, 2017; accepted June 27, 2017. Date of publication July 11, 2017; date of current version November 15, 2017. This work was supported in part by Institute of Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) [2015-0-00300, Multiple Access Technique with Ultra-Low Latency and High Efficiency for Tactile Internet Services in IoT Environments] and in part by Basic Science Research Program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (NRF-2014R1A2A2A01007254). The associate editor coordinating the review of this paper and approving it for publication was L. Dolecek. (Corresponding author: Kwang Soon Kim.) The authors are with the Department of Electrical and Electronic Engineering, Yonsei University, 50 Yonsei-ro, Seodaemun-gu, Seoul 120-749, South Korea (e-mail:ks.kim@yonsei.ac.kr). Publisher Copyright: {\textcopyright} 1972-2012 IEEE.",

year = "2017",

month = nov,

doi = "10.1109/TCOMM.2017.2725276",

language = "English",

volume = "65",

pages = "4585--4599",

journal = "IEEE Transactions on Communications",

issn = "1558-0857",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "11",

}

TY - JOUR

T1 - Accumulate Repeat Accumulate Check Accumulate Codes

AU - Jeon, Ki Jun

AU - Kim, Kwang Soon

N1 - Funding Information: Manuscript received March 3, 2017; revised June 6, 2017; accepted June 27, 2017. Date of publication July 11, 2017; date of current version November 15, 2017. This work was supported in part by Institute of Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) [2015-0-00300, Multiple Access Technique with Ultra-Low Latency and High Efficiency for Tactile Internet Services in IoT Environments] and in part by Basic Science Research Program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (NRF-2014R1A2A2A01007254). The associate editor coordinating the review of this paper and approving it for publication was L. Dolecek. (Corresponding author: Kwang Soon Kim.) The authors are with the Department of Electrical and Electronic Engineering, Yonsei University, 50 Yonsei-ro, Seodaemun-gu, Seoul 120-749, South Korea (e-mail:ks.kim@yonsei.ac.kr). Publisher Copyright: © 1972-2012 IEEE.

PY - 2017/11

Y1 - 2017/11

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

SN - 1558-0857

VL - 65

SP - 4585

EP - 4599

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 11

M1 - 7973156

ER -

Accumulate Repeat Accumulate Check Accumulate Codes

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this