Lookahead Bit Flipping Decoding for Low-Density Parity-Check Codes
IEEE Communications Letters · 2026 · 30 · 2929-2933
DOI: 10.1109/lcomm.2026.3722765 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Communications Letters, 2026. Verfasst von Suhun Kwak und 1 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben.
Abstract (Originalsprache)
This letter proposes a novel hard-decision decoding algorithm for low-density parity-check (LDPC) codes, called lookahead bit flipping (LBF). Unlike the conventional bit flipping algorithm that determines a variable node (VN) to be flipped based solely on the current syndrome values, the proposed method virtually flips a sequence of VNs to select the optimal VN sequence by evaluating the syndrome values resulting from the sequence. This approach demonstrates improved error-correction performance compared to existing hard-decision algorithms. Furthermore, a normalized evaluation is employed to reflect the structural characteristics of LDPC parity-check matrices. In addition, a hybrid decoding scheme is introduced to combine the proposed LBF with the conventional bit flipping, enabling a significant reduction in decoding time while preserving the performance gains of LBF.
Zitieren
APA
Kwak, S., & Park, I. (2026). Lookahead Bit Flipping Decoding for Low-Density Parity-Check Codes. IEEE Communications Letters, 30, 2929-2933. https://doi.org/10.1109/lcomm.2026.3722765
Vancouver
Kwak S, Park I. Lookahead Bit Flipping Decoding for Low-Density Parity-Check Codes. IEEE Communications Letters. 2026;30:2929-2933. doi:10.1109/lcomm.2026.3722765
BibTeX
@article{Kwak2026,
author = {Kwak, Suhun and Park, In-Cheol},
title = {Lookahead Bit Flipping Decoding for Low-Density Parity-Check Codes},
journal = {IEEE Communications Letters},
year = {2026},
volume = {30},
pages = {2929--2933},
doi = {10.1109/lcomm.2026.3722765}
}
EUVIMED