An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability

Tso-Cho CHEN  Erl-Huei LU  Chia-Jung LI  Kuo-Tsang HUANG  

Publication
IEICE TRANSACTIONS on Communications   Vol.E100-B   No.12   pp.2095-2103
Publication Date: 2017/12/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2016EBP3376
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
Keyword: 
low-density parity-check codes,  weighted bit-flipping,  multiple bit-flipping,  decoding algorithm,  log-likelihood ratio,  convergence speed,  

Full Text: PDF(1.5MB)
>>Buy this Article

Summary: 
In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.