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

LDPC Codes
Information Transfer
Chart
Redundancy
Verify
Prediction
Simulation

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

EXIT chart analysis for split-LDPC codes. / Xie, Kai; Wang, Li; Shamir, Gil I.; Boutros, Joseph.

Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 567-571 4036026.

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

Xie, K, Wang, L, Shamir, GI & Boutros, J 2006, EXIT chart analysis for split-LDPC codes. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036026, pp. 567-571, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 9/7/06. https://doi.org/10.1109/ISIT.2006.261780
Xie K, Wang L, Shamir GI, Boutros J. EXIT chart analysis for split-LDPC codes. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 567-571. 4036026 https://doi.org/10.1109/ISIT.2006.261780
Xie, Kai ; Wang, Li ; Shamir, Gil I. ; Boutros, Joseph. / EXIT chart analysis for split-LDPC codes. Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. pp. 567-571
@inproceedings{4b9a0ce1b5384142ac63be1667566a0c,
title = "EXIT chart analysis for split-LDPC codes",
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.",
author = "Kai Xie and Li Wang and Shamir, {Gil I.} and Joseph Boutros",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ISIT.2006.261780",
language = "English",
isbn = "1424405041",
pages = "567--571",
booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

}

TY - GEN

T1 - EXIT chart analysis for split-LDPC codes

AU - Xie, Kai

AU - Wang, Li

AU - Shamir, Gil I.

AU - Boutros, Joseph

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=39049106599&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39049106599&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2006.261780

DO - 10.1109/ISIT.2006.261780

M3 - Conference contribution

SN - 1424405041

SN - 9781424405046

SP - 567

EP - 571

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

ER -