Generalized LDPC Code With Single-Parity-Check Product Constraints At Super Check Nodes

Y. Min, F. C. M. Lau, C. K. Tse

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

4 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. © 2012 IEEE.
Original languageEnglish
Title of host publication2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)
Pages165-169
ISBN (Electronic)9781457721137
DOIs
Publication statusPublished - Aug 2012
Externally publishedYes
Event7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2012) - Gothenburg, Sweden
Duration: 27 Aug 201231 Aug 2012

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

Conference7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2012)
PlaceSweden
CityGothenburg
Period27/08/1231/08/12

Research Keywords

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

Fingerprint

Dive into the research topics of 'Generalized LDPC Code With Single-Parity-Check Product Constraints At Super Check Nodes'. Together they form a unique fingerprint.

Cite this