Performance and convergence analysis of tree-LDPC codes on the min-sum iterative decoding algorithm

Kwangseok Noh, Jun Heo

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)1749-1750
Number of pages2
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE89-A
Issue number6
DOIs
Publication statusPublished - 2006 Jun

Keywords

  • Density evolution
  • Implementation
  • Iterative decoding
  • Scaling factor
  • Tree-LDPC codes

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Performance and convergence analysis of tree-LDPC codes on the min-sum iterative decoding algorithm'. Together they form a unique fingerprint.

Cite this