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

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

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 et al. 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 threshold; Codes; Complexity theory; Decoding; degree-1 variable node; Doping; Error analysis; Indexes; low-density parity-check (LDPC) code; multi-types of component codes (MCC); Parity check codes; partially doped generalized LDPC (PD-GLDPC) code
제목
PD-GLDPC Codes with Degree-1 Variable Nodes and Multi-Types of Component Codes
저자
Kim, Jae-Won; Kim, Jaewha; Kwak, Hee-Youl; No, Jong-Seon
DOI
10.1109/LCOMM.2024.3359155
발행일
2024-04
유형
Article
저널명
IEEE Communications Letters
권
28
호
4
페이지
1 ~ 1