A Low-Complexity Adaptive Extended Min-Sum Algorithm for Non-Binary LDPC Codes

Citations

SCOPUS

2

초록

The extended min-sum algorithm (EMS) for decoding non-binary low density parity check (NB-LDPC) codes reduces the decoding complexity by truncating the message vector by retaining only the most reliable symbols. However, the EMS algorithm does not consider that the noise of the received codeword is gradually reduced as the iteration count goes up. In this paper, we propose a low-complexity adaptive EMS algorithm, called threshold-based EMS (TB-EMS). The TB-EMS algorithm has a simple adaptive rule to calculate the new message vector length compared to the A-EMS. The proposed algorithm selects one of two message vector lengths. Experimental results show that the proposed algorithm reduces the decoding complexity with minimal performance degradation compared with the EMS algorithm. Further, the decoding performance of the TB-EMS is better than A-EMS.

키워드

Extended Min-Sum algorithmLow-complexity decodingMessage truncation ruleNon-Binary Low Density Parity Check codesDecodingIntelligent computingIterative methodsDecoding complexityDecoding performanceExtended min sumsIteration countLow density parity checkNon-binary LDPC codesPerformance degradationSimple adaptiveComputational complexity
제목
A Low-Complexity Adaptive Extended Min-Sum Algorithm for Non-Binary LDPC Codes
저자
Kim, Min-HoPark, Kyeong-BinChung, Ki Seok
DOI
10.1109/ICCIA49625.2020.00048
발행일
2020-06
유형
Conference Paper
저널명
Proceedings - 2020 5th International Conference on Computational Intelligence and Applications, ICCIA 2020
페이지
217 ~ 221