상세정보
학술지
Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes
- 발행일
- 202302
- 출처
- ETRI Journal, v.45 no.1, pp.7-17
- ISSN
- 1225-6463
- 출판사
- 한국전자통신연구원 (ETRI)
- 협약과제
- 21HH1800, [통합과제] 초고주파 이동통신 무선백홀 전문연구실, 고영조
- 초록
- 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.
- KSP 제안 키워드
- Advanced television systems committee(ATSC), Importance Sampling, Low density parity check (LDPC) code, NP-hard, Search Algorithm(GSA), Search Space, Tanner graph, Time efficiency, computation time, raptor-like, rate performance
본 저작물은 공공누리 제4유형 : 출처표시 + 상업적 이용금지 + 변경금지 조건에 따라 이용할 수 있습니다.
