Hard-Decision Decoding Algorithms for LDPC Codes Based on Matching Pursuit

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 28; číslo 3; s. 454 - 457
Hlavní autoři: Guo, Jianzhong, Li, Ruoxi, Zhang, Yuan, Chen, Jing, Kong, Dejin, Wu, Yan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
BER
binary matching pursuit (BMP)
Decoding
Error correcting codes
hard decision decoding
Iterative decoding
LDPC
Matched pursuit
Matching
Matching pursuit algorithms
Optimization
Reliability
Signal to noise ratio
Simulation
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2023.3340560