Concatenated LDPC/Trellis Codes: Surpassing the Symmetric Information Rate of Channels with Synchronization Errors

Ryo SHIBATA  Gou HOSOYA  Hiroyuki YASHIMA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E103-A   No.11   pp.1283-1291
Publication Date: 2020/11/01
Publicized: 2020/09/03
Online ISSN: 1745-1337
DOI: 10.1587/transfun.2020EAP1019
Type of Manuscript: PAPER
Category: Coding Theory
Keyword: 
synchronization error,  generalized Blahut-Arimoto algorithm,  Markov capacity,  low-density parity-check (LDPC) codes,  trellis codes,  

Full Text: PDF(966.7KB)>>
Buy this Article




Summary: 
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).