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

Y. Min; Chung Ming Lau; Chi Kong Tse

doi:10.1109/ISTC.2012.6325220

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

Y. Min
, Chung Ming Lau
, Chi Kong Tse

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

5 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 language	English
Title of host publication	2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012
Pages	165-169
Number of pages	5
DOIs	https://doi.org/10.1109/ISTC.2012.6325220
Publication status	Published - 14 Dec 2012
Event	2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012 - Gothenburg, Sweden Duration: 27 Aug 2012 → 31 Aug 2012

Conference

Conference	2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012
Country/Territory	Sweden
City	Gothenburg
Period	27/08/12 → 31/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

More information

10.1109/ISTC.2012.6325220

http://hdl.handle.net/10397/24300

Cite this

@inproceedings{41dc3830030b458c81d72fbd58aeed0d,

title = "Generalized LDPC code with single-parity-check product constraints at super check nodes",

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",

author = "Y. Min and Lau, \{Chung Ming\} and Tse, \{Chi Kong\}",

year = "2012",

month = dec,

day = "14",

doi = "10.1109/ISTC.2012.6325220",

language = "English",

isbn = "9781457721151",

pages = "165--169",

booktitle = "2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012",

note = "2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012 ; Conference date: 27-08-2012 Through 31-08-2012",

}

Min, Y, Lau, CM & Tse, CK 2012, Generalized LDPC code with single-parity-check product constraints at super check nodes. in 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012., 6325220, pp. 165-169, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012, Gothenburg, Sweden, 27/08/12. https://doi.org/10.1109/ISTC.2012.6325220

Generalized LDPC code with single-parity-check product constraints at super check nodes. / Min, Y.; Lau, Chung Ming; Tse, Chi Kong.
2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012. 2012. p. 165-169 6325220.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

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

AU - Min, Y.

AU - Lau, Chung Ming

AU - Tse, Chi Kong

PY - 2012/12/14

Y1 - 2012/12/14

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

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

KW - Generalized low-density parity-check code

KW - single-parity-check product-code

KW - turbo iteration

UR - https://www.scopus.com/pages/publications/84870833676

U2 - 10.1109/ISTC.2012.6325220

DO - 10.1109/ISTC.2012.6325220

M3 - Conference article published in proceeding or book

SN - 9781457721151

SP - 165

EP - 169

BT - 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012

T2 - 2012 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012

Y2 - 27 August 2012 through 31 August 2012

ER -

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

Abstract

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this