Towards Understanding Weighted Bit-Flipping Decoding
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE International Symposium on Information Theory
- p. 1666-1670
- https://doi.org/10.1109/isit.2007.4557461
Abstract
A natural relationship between weighted bit-flipping (WBF) decoding and message-passing decoding is explored. This understanding can help us develop a dual WBF decoding algorithm from one type of message-passing decoding algorithm and vice versa. For min-sum decoding, one can find that its dual WBF algorithm is the algorithm proposed by Jiang et al. For belief-propagation (BP) decoding, we propose a new WBF algorithm and show its performance advantage. For some high-rate low-density parity-check (LDPC) codes of large row weight, it is shown that the WBF algorithm proposed by Liu and Pados performs extraordinarily well. However, its dual message- passing decoding does not work well. Furthermore, we propose a parallel implementation framework for various WBF algorithms. Compared to serial implementations, various WBF algorithms in their parallel form converge significantly faster and often perform better.Keywords
This publication has 14 references indexed in Scilit:
- Parallel Weighted Bit-Flipping DecodingIEEE Communications Letters, 2007
- Fast Weighted Bit-Flipping Decoding of Finite-Geometry LDPC CodesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- An improvement on the modified weighted bit flipping decoding algorithm for LDPC codesIEEE Communications Letters, 2005
- A Decoding Algorithm for Finite-Geometry LDPC CodesIEEE Transactions on Communications, 2005
- Improved weighted bit-flipping algorithm for decoding LDPC CodesIEE Proceedings - Communications, 2005
- Implementation-efficient reliability ratio based weighted bit-flipping decoding for LDPC codesElectronics Letters, 2005
- Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Improving Belief Propagation on Graphs With CyclesIEEE Communications Letters, 2004
- Near optimum universal belief propagation based decoding of low-density parity check codesIEEE Transactions on Communications, 2002
- Expander codesIEEE Transactions on Information Theory, 1996