New insights into weighted bit-flipping decoding

Authors:
Xiaofu Wu;Cong Ling;Ming Jiang;Enyang Xu;Chunming Zhao;Xiaohu You
Affiliations:
National Communications Research Laboratory, Southeast University, Nanjing and Nanjing Institute of Communications Engineering, Nanjing, China;Department of Electrical and Electronic Engineering, Imperial College London, London, United Kingdom;National Communications Research Laboratory, Southeast University, Nanjing, China;Department of Electrical and Computer Engineering, University of California, Davis, CA and National Mobile Commun. Research Lab, Southeast University, Nanjing;National Communications Research Laboratory, Southeast University, Nanjing, China;National Communications Research Laboratory, Southeast University, Nanjing, China
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 3
Cited 0

Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

A natural relationship between weighted bit-flipping (WBF) decoding and belief-propagation-like (BP-like) decoding is explored. This understanding can help us develop WBF algorithms from BP-like algorithms. For min-sum decoding, one can find that its WBF algorithm is the algorithm proposed by Jiang et al. For BP decoding, we propose a new WBF algorithm and show its performance advantage. The proposed WBF algorithms are parallelized to achieve rapid convergence. Two efficient simulation-based procedures are proposed for the optimization of the associated thresholds.