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
Nas últimas duas décadas, os códigos irregulares de verificação de paridade de baixa densidade (LDPC) não foram capazes de decodificar informações corrompidas por erros de inserção e exclusão (ID) sem marcadores. Neste artigo, trazemos à luz a existência de códigos LDPC irregulares que se aproximam das taxas de informação simétrica (SIR) do canal com erros de ID, mesmo sem marcadores. Esses códigos têm formas peculiares em suas distribuições de graus de nós de verificação. Especificamente, os graus do nó de verificação estão dispersos e há nós de verificação de grau 2. Propomos um método de construção de código baseado no algoritmo de crescimento progressivo de bordas adaptado para as distribuições de graus de nós de verificação dispersos, que permite que os códigos de aproximação SIR progridam no regime de comprimento finito. Além disso, os códigos de abordagem SIR demonstram desempenho assintótico e de comprimento finito que superam os equivalentes existentes, nomeadamente, codificação concatenada de códigos LDPC irregulares com marcadores e códigos LDPC acoplados espacialmente.
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.
Copiar
Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA, "Design and Construction of Irregular LDPC Codes for Channels with Synchronization Errors: New Aspect of Degree Profiles" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 10, pp. 1237-1247, October 2020, doi: 10.1587/transfun.2020EAP1004.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAP1004/_p
Copiar
@ARTICLE{e103-a_10_1237,
author={Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Design and Construction of Irregular LDPC Codes for Channels with Synchronization Errors: New Aspect of Degree Profiles},
year={2020},
volume={E103-A},
number={10},
pages={1237-1247},
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.},
keywords={},
doi={10.1587/transfun.2020EAP1004},
ISSN={1745-1337},
month={October},}
Copiar
TY - JOUR
TI - Design and Construction of Irregular LDPC Codes for Channels with Synchronization Errors: New Aspect of Degree Profiles
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1237
EP - 1247
AU - Ryo SHIBATA
AU - Gou HOSOYA
AU - Hiroyuki YASHIMA
PY - 2020
DO - 10.1587/transfun.2020EAP1004
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2020
AB - 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.
ER -