Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24300
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineeringen_US
dc.creatorMin, Yen_US
dc.creatorLau, FCMen_US
dc.creatorTse, CKen_US
dc.date.accessioned2014-12-19T04:14:17Z-
dc.date.available2014-12-19T04:14:17Z-
dc.identifier.isbn9781457721151en_US
dc.identifier.issn2165-4700en_US
dc.identifier.urihttp://hdl.handle.net/10397/24300-
dc.description2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012, Gothenburg, 27-31 August 2012en_US
dc.language.isoenen_US
dc.rights© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.rightsThe following publication Y. Min, F. C. M. Lau and C. K. Tse, "Generalized LDPC code with single-parity-check product constraints at super check nodes," 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012, pp. 165-169 is available at https://dx.doi.org/10.1109/ISTC.2012.6325220.en_US
dc.subjectGeneralized low-density parity-check codeen_US
dc.subjectsingle-parity-check product-codeen_US
dc.subjectturbo iterationen_US
dc.titleGeneralized LDPC code with single-parity-check product constraints at super check nodesen_US
dc.typeConference Paperen_US
dc.identifier.spage165en_US
dc.identifier.epage169en_US
dc.identifier.doi10.1109/ISTC.2012.6325220en_US
dcterms.abstractDue 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.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 27-31 Aug. 2012, 6325220, p. 165-169en_US
dcterms.issued2012-
dc.identifier.scopus2-s2.0-84870833676-
dc.relation.ispartofbookInternational Symposium on Turbo Codes and Iterative Information Processing, ISTCen_US
dc.identifier.rosgroupidr65750-
dc.description.ros2012-2013 > Academic research: refereed > Refereed conference paperen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0721-n22-
dc.description.fundingSourceRGCen_US
dc.description.fundingTextRGC: 519011Een_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
a0721-n22_2012ISTC.pdfPre-Published version229.33 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

107
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

70
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Apr 19, 2024

Google ScholarTM

Check

Altmetric


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