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

doi:10.1587/transcom.2016EBP3376

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

Full Text Views

0

Share
Cite this

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E100-B No.12 pp.2095-2103

Publication Date: 2017/12/01

Publicized: 2017/05/29

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2016EBP3376

Type of Manuscript: PAPER

Category: Fundamental Theories for Communications

Authors

Tso-Cho CHEN
  China University of Science and Technology
Erl-Huei LU
  Chang Gung University
Chia-Jung LI
  Chang Gung University
Kuo-Tsang HUANG
  Chang Gung University

Keyword

low-density parity-check codes, weighted bit-flipping, multiple bit-flipping, decoding algorithm, log-likelihood ratio, convergence speed

Cite this

Copy

Tso-Cho CHEN, Erl-Huei LU, Chia-Jung LI, Kuo-Tsang HUANG, "An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability" in IEICE TRANSACTIONS on Communications, vol. E100-B, no. 12, pp. 2095-2103, December 2017, doi: 10.1587/transcom.2016EBP3376.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3376/_p

Copy

@ARTICLE{e100-b_12_2095,
author={Tso-Cho CHEN, Erl-Huei LU, Chia-Jung LI, Kuo-Tsang HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability},
year={2017},
volume={E100-B},
number={12},
pages={2095-2103},
abstract={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.},
keywords={},
doi={10.1587/transcom.2016EBP3376},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability
T2 - IEICE TRANSACTIONS on Communications
SP - 2095
EP - 2103
AU - Tso-Cho CHEN
AU - Erl-Huei LU
AU - Chia-Jung LI
AU - Kuo-Tsang HUANG
PY - 2017
DO - 10.1587/transcom.2016EBP3376
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2017
AB - 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.
ER -