Please use this identifier to cite or link to this item:
Title: Generalized LDPC code with single-parity-check product constraints at super check nodes
Authors: Min, Y
Lau, FCM 
Tse, CK 
Issue Date: 2012
Source: International Symposium on Turbo Codes and Iterative Information Processing, ISTC, 2012, 6325220, p. 165-169
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.
Keywords: Generalized low-density parity-check code
single-parity-check product-code
turbo iteration
ISBN: 9781457721151
ISSN: 2165-4700
DOI: 10.1109/ISTC.2012.6325220
Description: 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012, Gothenburg, 27-31 August 2012
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 7, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 28, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.