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
Nesta carta, analisamos a velocidade de convergência da decodificação em camadas de códigos de verificação de paridade de baixa densidade do tipo bloco e verificamos que a decodificação em camadas oferece velocidade de convergência mais rápida do que a decodificação sequencial com subconjuntos de nós de verificação selecionados aleatoriamente. Além disso, é mostrado que usar mais subconjuntos do que o grau máximo do nó variável não melhora a velocidade de convergência.
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
Min-Ho JANG, Beomkyu SHIN, Woo-Myoung PARK, Jong-Seon NO, Dong-Joon SHIN, "Convergence Speed Analysis of Layered Decoding of Block-Type LDPC Codes" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 7, pp. 2484-2487, July 2009, doi: 10.1587/transcom.E92.B.2484.
Abstract: In this letter, we analyze the convergence speed of layered decoding of block-type low-density parity-check codes and verify that the layered decoding gives faster convergence speed than the sequential decoding with randomly selected check node subsets. Also, it is shown that using more subsets than the maximum variable node degree does not improve the convergence speed.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2484/_p
Copiar
@ARTICLE{e92-b_7_2484,
author={Min-Ho JANG, Beomkyu SHIN, Woo-Myoung PARK, Jong-Seon NO, Dong-Joon SHIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Convergence Speed Analysis of Layered Decoding of Block-Type LDPC Codes},
year={2009},
volume={E92-B},
number={7},
pages={2484-2487},
abstract={In this letter, we analyze the convergence speed of layered decoding of block-type low-density parity-check codes and verify that the layered decoding gives faster convergence speed than the sequential decoding with randomly selected check node subsets. Also, it is shown that using more subsets than the maximum variable node degree does not improve the convergence speed.},
keywords={},
doi={10.1587/transcom.E92.B.2484},
ISSN={1745-1345},
month={July},}
Copiar
TY - JOUR
TI - Convergence Speed Analysis of Layered Decoding of Block-Type LDPC Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 2484
EP - 2487
AU - Min-Ho JANG
AU - Beomkyu SHIN
AU - Woo-Myoung PARK
AU - Jong-Seon NO
AU - Dong-Joon SHIN
PY - 2009
DO - 10.1587/transcom.E92.B.2484
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2009
AB - In this letter, we analyze the convergence speed of layered decoding of block-type low-density parity-check codes and verify that the layered decoding gives faster convergence speed than the sequential decoding with randomly selected check node subsets. Also, it is shown that using more subsets than the maximum variable node degree does not improve the convergence speed.
ER -