IEICE TRANSACTIONS on Fundamentals
Performance and Convergence Analysis of Tree-LDPC Codes on the Min-Sum Iterative Decoding Algorithm
Summary :
In this paper, the performance of Tree-LDPC code [1] is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor [3] which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.6 pp.1749-1750
- Publication Date
- 2006/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.6.1749
- Type of Manuscript
- Special Section LETTER (Special Section on Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2005))
- Category
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
Kwangseok NOH, Jun HEO, "Performance and Convergence Analysis of Tree-LDPC Codes on the Min-Sum Iterative Decoding Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 6, pp. 1749-1750, June 2006, doi: 10.1093/ietfec/e89-a.6.1749.
Abstract: In this paper, the performance of Tree-LDPC code [1] is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor [3] which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.6.1749/_p
Copy
@ARTICLE{e89-a_6_1749,
author={Kwangseok NOH, Jun HEO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance and Convergence Analysis of Tree-LDPC Codes on the Min-Sum Iterative Decoding Algorithm},
year={2006},
volume={E89-A},
number={6},
pages={1749-1750},
abstract={In this paper, the performance of Tree-LDPC code [1] is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor [3] which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm.},
keywords={},
doi={10.1093/ietfec/e89-a.6.1749},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - Performance and Convergence Analysis of Tree-LDPC Codes on the Min-Sum Iterative Decoding Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1749
EP - 1750
AU - Kwangseok NOH
AU - Jun HEO
PY - 2006
DO - 10.1093/ietfec/e89-a.6.1749
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2006
AB - In this paper, the performance of Tree-LDPC code [1] is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor [3] which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm.
ER -
English
