TY - JOUR
T1 - Design and construction of irregular LDPC codes for channels with synchronization errors
T2 - New aspect of degree profiles
AU - Shibata, Ryo
AU - Hosoya, Gou
AU - Yashima, Hiroyuki
N1 - Funding Information:
This work was supported by JSPS KAKENHI Grant Numbers JP17K06443 and JP19K04400. The authors would like to thank the reviewers for their constructive comments that have helped improving the overall quality of the paper.
Publisher Copyright:
Copyright © 2020 The Institute of Electronics, Information and Communication Engineers
PY - 2020/10/1
Y1 - 2020/10/1
N2 - Over the past two decades, irregular low-density parity-check (LDPC) codes have not been able to decode information corrupted by insertion and deletion (ID) errors without markers. In this paper, we bring to light the existence of irregular LDPC codes that approach the symmetric information rates (SIR) of the channel with ID errors, even without markers. These codes have peculiar shapes in their check-node degree distributions. Specifically, the check-node degrees are scattered and there are degree-2 check nodes. We propose a code construction method based on the progressive edge-growth algorithm tailored for the scattered check-node degree distributions, which enables the SIR-approaching codes to progress in the finite-length regime. Moreover, the SIR-approaching codes demonstrate asymptotic and finite-length performance that outperform the existing counterparts, namely, concatenated coding of irregular LDPC codes with markers and spatially coupled LDPC codes.
AB - Over the past two decades, irregular low-density parity-check (LDPC) codes have not been able to decode information corrupted by insertion and deletion (ID) errors without markers. In this paper, we bring to light the existence of irregular LDPC codes that approach the symmetric information rates (SIR) of the channel with ID errors, even without markers. These codes have peculiar shapes in their check-node degree distributions. Specifically, the check-node degrees are scattered and there are degree-2 check nodes. We propose a code construction method based on the progressive edge-growth algorithm tailored for the scattered check-node degree distributions, which enables the SIR-approaching codes to progress in the finite-length regime. Moreover, the SIR-approaching codes demonstrate asymptotic and finite-length performance that outperform the existing counterparts, namely, concatenated coding of irregular LDPC codes with markers and spatially coupled LDPC codes.
KW - Code construction
KW - Code design
KW - Low-density parity-check (LDPC) codes
KW - Synchronization error
UR - http://www.scopus.com/inward/record.url?scp=85094156274&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85094156274&partnerID=8YFLogxK
U2 - 10.1587/transfun.2020EAP1004
DO - 10.1587/transfun.2020EAP1004
M3 - Article
AN - SCOPUS:85094156274
SN - 0916-8508
VL - E103A
SP - 1237
EP - 1247
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IS - 10
ER -