
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

An Efficient Weighted BitFlipping Algorithm for Decoding LDPC Codes Based on LogLikelihood Ratio of Bit Error Probability
TsoCho CHEN ErlHuei LU ChiaJung LI KuoTsang HUANG
Publication
IEICE TRANSACTIONS on Communications
Vol.E100B
No.12
pp.20952103 Publication Date: 2017/12/01
Online ISSN: 17451345
DOI: 10.1587/transcom.2016EBP3376
Type of Manuscript: PAPER Category: Fundamental Theories for Communications Keyword: lowdensity paritycheck codes, weighted bitflipping, multiple bitflipping, decoding algorithm, loglikelihood ratio, convergence speed,
Full Text: PDF(1.5MB) >>Buy this Article
Summary:
In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding lowdensity paritycheck (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bitflipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bitflipping or single bitflipping in each iteration according to the loglikelihood 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 bitflipping (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.

