Design and construction of irregular LDPC codes for channels with synchronization errors: New aspect of degree profiles

Ryo Shibata*, Gou Hosoya, Hiroyuki Yashima

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1237-1247
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE103A
Issue number10
DOIs
Publication statusPublished - 2020 Oct 1

Keywords

  • Code construction
  • Code design
  • Low-density parity-check (LDPC) codes
  • Synchronization error

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Design and construction of irregular LDPC codes for channels with synchronization errors: New aspect of degree profiles'. Together they form a unique fingerprint.

Cite this