The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 바이너리 삽입/삭제(ID) 채널의 대칭 정보 속도를 뛰어넘고 채널의 마르코프 용량에 접근하는 코딩/디코딩 전략을 제안합니다. 제안된 코드는 내부 격자 코드와 외부 불규칙한 LDPC(저밀도 패리티 검사) 코드로 구성됩니다. 격자 코드는 높은 정보 속도를 달성하는 Markov 입력 프로세스의 전이 확률을 모방하도록 설계된 반면, LDPC 코드는 슈퍼채널(ID 채널과 격자 코드의 연결)에서 반복적 디코딩 임계값을 최대화하도록 설계되었습니다.
Ryo SHIBATA
Tokyo University of Science
Gou HOSOYA
Waseda University
Hiroyuki YASHIMA
Tokyo University of Science
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.
부
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
부
@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},}
부
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 -