EXIT chart analysis for split-LDPC codes

Kai Xie, Li Wang, Gil I. Shamir, Joseph Boutros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Nonsystematic channel codes are superior to systematic codes in the presence of source redundancy. We study the performance of split-LDPC codes (we recently proposed), which are based on splitting redundant data bits into coded bits. We propose a novel method to build extrinsic information transfer (EXIT) chart to approximate the thresholds of such codes. EXIT charts provide a fast and close to accurate prediction of the thresholds of split-LDPC codes for nonuniform sources. The thresholds approximated by fast EXIT chart analysis are very close to those obtained by density evolution (DE) analysis that we recently proposed for split-LDPC codes. The EXIT chart analysis can thus be used to efficiently search for good split-LDPC codes. Simulations verify good performance close to the approximate thresholds predicted by the EXIT charts.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages567-571
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Other

Other2006 IEEE International Symposium on Information Theory, ISIT 2006
CountryUnited States
CitySeattle, WA
Period9/7/0614/7/06

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Xie, K., Wang, L., Shamir, G. I., & Boutros, J. (2006). EXIT chart analysis for split-LDPC codes. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 (pp. 567-571). [4036026] https://doi.org/10.1109/ISIT.2006.261780