Abstract
Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by more general constraints, viz., constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we summarize some recent results on spatially coupled generalized low-density parity-check (SC-GLDPC) codes. Results are compared to GLDPC block codes and the advantages and disadvantages of SC-GLDPC codes are discussed.
Original language | English |
---|---|
Title of host publication | 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 |
Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
Volume | 2018-December |
ISBN (Electronic) | 9781538670484 |
DOIs | |
Publication status | Published - 2018 |
Event | 10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 - Hong Kong, China Duration: 2018 Dec 3 → 2018 Dec 7 |
Conference
Conference | 10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 |
---|---|
Country/Territory | China |
City | Hong Kong |
Period | 2018/12/03 → 2018/12/07 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering