IEEE Communications Letters
Lookahead Bit Flipping Decoding for Low-Density Parity-Check Codes
Suhun Kwak, In‐Cheol Park
Abstract
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.