.png){kind=icon}
.png){kind=icon}
Return
Hard-Decision Decoding Algorithms for LDPC Codes Based on Matching Pursuit
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2023.3340560.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter presents a novel binary matching pursuit (BMP) algorithm for the decoding of hard-decision low-density parity-check (LDPC) codes. The traditional matching pursuit algorithm over GF(2) is susceptible to mismatching and cause a chain of errors. To overcome this problem, two strategies are proposed, one is to introduce a kind of new matching reliability, and the other is to adopt a scheme of multiple decoding modules. Simulation results show that the proposed algorithm not only greatly outperforms the bit-flipping (BF) algorithm, but also outperforms the hybrid soft-decision algorithm such as weighted BF algorithm in error performance, and has the advantage of low complexity.
Keywords:
LDPC
hard decision decoding
binary matching pursuit (BMP)
iterative decoding
BER
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W