IEICE TRANSACTIONS on Fundamentals
Concatenated LDPC/Trellis Codes: Surpassing the Symmetric Information Rate of Channels with Synchronization Errors
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).
- Publication
- IEICE TRANSACTIONS on Fundamentals 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
Authors
Ryo SHIBATA
Tokyo University of Science
Gou HOSOYA
Waseda University
Hiroyuki YASHIMA
Tokyo University of Science
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA, "Concatenated LDPC/Trellis Codes: Surpassing the Symmetric Information Rate of Channels with Synchronization Errors" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 11, pp. 1283-1291, November 2020, doi: 10.1587/transfun.2020EAP1019.
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).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAP1019/_p
Copy
@ARTICLE{e103-a_11_1283,
author={Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Concatenated LDPC/Trellis Codes: Surpassing the Symmetric Information Rate of Channels with Synchronization Errors},
year={2020},
volume={E103-A},
number={11},
pages={1283-1291},
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).},
keywords={},
doi={10.1587/transfun.2020EAP1019},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Concatenated LDPC/Trellis Codes: Surpassing the Symmetric Information Rate of Channels with Synchronization Errors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1283
EP - 1291
AU - Ryo SHIBATA
AU - Gou HOSOYA
AU - Hiroyuki YASHIMA
PY - 2020
DO - 10.1587/transfun.2020EAP1019
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2020
AB - 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).
ER -
English
