• 한국통신학회논문지
• /
• 제34권10C호
• /
• pp.937-945
• /
• 2009

본 논문에서는 변수노드의 차수가 3인 정칙 LDPC 부호의 absorbing 집합(AS)에 대한 여러 가지 성질을 알아본다. Girth가 인 경우, 가장 작은 absorbing 집합은 AS임을 보였고, 인 경우 이 AS가 가장 작은 fully absorbing 집합임을 증명하였다. 또한 (3,5) Tanner LDPC 부호에서 오류 마루의 주원인으로 꼽히는 몇몇 absorbing 집합의 critical number를 유도하였다.

• ETRI Journal
• /
• 제45권1호
• /
• pp.7-17
• /
• 2023

The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.