Parallel Weighted Bit-Flipping Decoding
- 20 August 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 11 (8), 671-673
- https://doi.org/10.1109/lcomm.2007.070269
Abstract
A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding.Keywords
This publication has 6 references indexed in Scilit:
- 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
- A Modified Weighted Bit-Flipping Decoding of Low-Density Parity-Check CodesIEEE Communications Letters, 2004
- Improving Belief Propagation on Graphs With CyclesIEEE Communications Letters, 2004
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Expander codesIEEE Transactions on Information Theory, 1996