Improved weighted bit-flipping algorithm for decoding LDPC Codes
- 1 January 2005
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Communications
- Vol. 152 (6), 919-922
- https://doi.org/10.1049/ip-com:20045118
Abstract
The paper presents an improvement of the weighted bit-flipping (WBF) decoding algorithm for LDPC codes proposed by Liu and Pados (2003). Simulation results show that the improved WBF algorithm provides about 0.25 dB coding gain over the Liu–Pados WBF algorithm. Also included in the paper is a simplified loop-detection algorithm, which is much easier to implement than the one proposed by Liu and Pados. The proposed WBF algorithm is particularly effective for decoding LDPC codes whose parity check matrices have large row/column weights such as finite geometry LDPC codes.Keywords
This publication has 5 references indexed in Scilit:
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density parity check codesElectronics Letters, 1996