Performance and Convergence Analysis of Tree-LDPC Codes on the Min-Sum Iterative Decoding Algorithm(<Special Section>Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2005))

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, the performance of Tree-LDPC code 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.

• 社団法人電子情報通信学会の論文
• 2006-06-01

著者

• Heo Jun

  Korea Univ. Seoul Kor

• NOH Kwangseok

  Dept. of Electronics Engineering, NITRI, Konkuk Univ.

• HEO Jun

  Dept. of Electronics Engineering, NITRI, Konkuk Univ.

• Noh Kwangseok

  Dept. Of Electronics Engineering Nitri Konkuk Univ.

関連論文

• Performance and Convergence Analysis of Tree-LDPC Codes on the Min-Sum Iterative Decoding Algorithm(Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2005))

スポンサーリンク