Generalized LDPC code with single-parity-check product constraints at super check nodes

Y. Min, Chung Ming Lau, Chi Kong Tse

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

3 Citations (Scopus)

Abstract

Due to the more complex constraints, generalized low-density parity-check (GLDPC) codes can achieve better error performance but require much higher decoding complexities compared with the standard LDPC codes. In this paper, single-parity-check product-codes (SPC-PCs) are considered as the constituent codes in the super check nodes of a GLDPC code. Moreover, turbo iterations are used in decoding the SPC-PCs. The error performance and the decoder complexity of the proposed GLDPC code are compared with other LDPC code and GLDPC code.
Original languageEnglish
Title of host publication2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012
Pages165-169
Number of pages5
DOIs
Publication statusPublished - 14 Dec 2012
Event2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012 - Gothenburg, Sweden
Duration: 27 Aug 201231 Aug 2012

Conference

Conference2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012
Country/TerritorySweden
CityGothenburg
Period27/08/1231/08/12

Keywords

  • Generalized low-density parity-check code
  • single-parity-check product-code
  • turbo iteration

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this