Concatenated LDPC/trellis codes: Surpassing the symmetric information rate of channels with synchronization errors

Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a coding/decoding strategy that surpasses the symmetric information rate of a binary insertion/deletion (ID) channel and approaches the Markov capacity of the channel. The proposed codes comprise inner trellis codes and outer irregular low-density parity-check (LDPC) codes. The trellis codes are designed to mimic the transition probabilities of a Markov input process that achieves a high information rate, whereas the LDPC codes are designed to maximize an iterative decoding threshold in the superchannel (concatenation of the ID channels and trellis codes).

Original languageEnglish
Pages (from-to)1283-1291
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume103
Issue number11
DOIs
Publication statusPublished - 2020 Nov

Keywords

  • Generalized Blahut-Arimoto algorithm
  • Low-density parity-check (LDPC) codes
  • Markov capacity
  • Synchronization error
  • Trellis codes

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 'Concatenated LDPC/trellis codes: Surpassing the symmetric information rate of channels with synchronization errors'. Together they form a unique fingerprint.

Cite this