PD-GLDPC Codes with Degree-1 Variable Nodes and Multi-Types of Component Codes
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

In this letter, we propose a new design method for protograph-based partially doped generalized low-density parity-check (PD-GLDPC) codes over the binary erasure channel (BEC). By extending the block-error threshold condition proposed by A. K. Pradhan <italic>et al</italic>. for conventional GLDPC codes, we optimize medium to high-rate PD-GLDPC codes with degree-1 variable nodes and multi-types of component codes (MCC). It is shown that the optimized PD-GLDPC codes outperform the conventional LDPC and GLDPC codes at the frame error rate 10-4 over the BEC while having comparable decoding complexity. IEEE

키워드

Block-error thresholdCodesComplexity theoryDecodingdegree-1 variable nodeDopingError analysisIndexeslow-density parity-check (LDPC) codemulti-types of component codes (MCC)Parity check codespartially doped generalized LDPC (PD-GLDPC) code
제목
PD-GLDPC Codes with Degree-1 Variable Nodes and Multi-Types of Component Codes
저자
Kim, Jae-WonKim, JaewhaKwak, Hee-YoulNo, Jong-Seon
DOI
10.1109/LCOMM.2024.3359155
발행일
2024-04
유형
Article
저널명
IEEE Communications Letters
28
4
페이지
1 ~ 1