Convergence Speed Analysis of Layered Decoding of Block-Type LDPC Codes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.7 pp.2484-2487
- Publication Date
- 2009/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.2484
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories for Communications
Authors
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
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
Copy
@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},}
Copy
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 -
English
