Selection-based Low-cost Check Node Operation for Extended Min-Sum Algorithm

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

키워드

Non-binary Low-density Parity CheckExtended Min-sum AlgorithmHardware OptimizationNONBINARYCODES
제목
Selection-based Low-cost Check Node Operation for Extended Min-Sum Algorithm
저자
Park, KyeongbinChung, Ki-Seok
DOI
10.3837/tiis.2021.02.006
발행일
2021-02
유형
Article
저널명
KSII Transactions on Internet and Information Systems
15
2
페이지
485 ~ 499

파일 다운로드