Performance and Convergence Analysis of Tree-LDPC codes on the Min-Sum Iterative Decoding Algorithm 


Vol. 31,  No. 1, pp. 20-25, Jan.  2006


PDF Full-Text
  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 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. The Tree-LDPC decoder is implemented on a FPGA chip with a small interleaver size.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Noh, J. Heo, K. Chung, "Performance and Convergence Analysis of Tree-LDPC codes on the Min-Sum Iterative Decoding Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 1, pp. 20-25, 2006. DOI: .

[ACM Style]

Kwang-seok Noh, Jun Heo, and Kyuhyuk Chung. 2006. Performance and Convergence Analysis of Tree-LDPC codes on the Min-Sum Iterative Decoding Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 31, 1, (2006), 20-25. DOI: .

[KICS Style]

Kwang-seok Noh, Jun Heo, Kyuhyuk Chung, "Performance and Convergence Analysis of Tree-LDPC codes on the Min-Sum Iterative Decoding Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 1, pp. 20-25, 1. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880