Browse > Article
http://dx.doi.org/10.4218/etrij.14.0213.0046

Lowering Error Floor of LDPC Codes Using an Improved Parallel WBF Algorithm  

Ma, Kexiang (State Key Laboratory of Integrated Service Networks, Xidian University)
Li, Yongzhao (State Key Laboratory of Integrated Service Networks, Xidian University)
Zhu, Caizhi (State Key Laboratory of Integrated Service Networks, Xidian University)
Zhang, Hailin (State Key Laboratory of Integrated Service Networks, Xidian University)
Zhang, Yuming (State Key Laboratory of Integrated Service Networks, Xidian University)
Publication Information
ETRI Journal / v.36, no.1, 2014 , pp. 171-174 More about this Journal
Abstract
In weighted bit-flipping-based algorithms for low-density parity-check (LDPC) codes, due to the existence of overconfident incorrectly received bits, the metric values of the corresponding bits will always be wrong in the decoding process. Since these bits cannot be flipped, decoding failure results. To solve this problem, an improved parallel weighted bit flipping algorithm is proposed. Specifically, a reliability-saturation strategy is adopted to increase the flipping probability of the overconfident incorrectly received bits. Simulation results show that the error floor of LDPC codes is greatly lowered.
Keywords
LDPC; WBF; error floor; reliability-saturation strategy;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D.J. MacKay, Encyclopedia of Sparse Graph Codes, database, The Inference Group. http://www.inference.phy.cam.ac.uk/ mackay/codes/data.html
2 D.J.C. MacKay and R.M. Neal, "Near Shannon Limit Performance of Low Density Parity Check Codes," Electron. Lett., vol. 33, Mar. 1997, pp. 457-458.   DOI   ScienceOn
3 Z. Li et al., "Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes," IEEE Trans. Commun., vol. 54, Jan. 2006, pp. 71-81.   DOI
4 C. Xiaoheng et al., "Memory System Optimization for FPGABased Implementation of Quasi-Cyclic LDPC Codes Decoders," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 58, Jan. 2011, pp. 98-111.   DOI
5 Y. Kou, S. Lin, and M.P.C. Fossorier, "Low-Density Parity- Check Codes Based on Finite Geometries: A Rediscovery and New Results," IEEE Trans. Inf. Theory, vol. 47, Nov. 2001, pp. 2711-2736.   DOI   ScienceOn
6 J. Zhang and M.P.C. Fossorier, "A Modified Weighted Bit- Flipping Decoding of Low Density Parity-Check Codes," IEEE Commun. Lett., vol. 8, Mar. 2004, pp. 165-167.   DOI
7 M. Jiang et al., "An Improvement on the Modified Weighted Bit Flipping Decoding Algorithm for LDPC Codes," IEEE Commun. Lett., vol. 9, Sept. 2005, pp. 814-816.   DOI   ScienceOn
8 X. Wu, C. Zhao, and X. You, "Parallel Weighted Bit-Flipping Decoding," IEEE Commun. Lett., vol. 11, Aug. 2007, pp. 671- 673.   DOI
9 X. Wu et al., "New Insights into Weighted Bit-Flipping Decoding," IEEE Commun. Lett., vol. 57, Aug. 2009, pp. 2177- 2180.   DOI
10 B.P. Smith and F.R. Kschischang, "Future Prospects for FEC in Fiber-Optic Communications," IEEE J. Sel. Topics Quantum Electron., vol. 16, Sept.-Oct. 2010, pp. 1245-1257.   DOI
11 T.M.N. Ngatched, F. Takawira, and M. Bossert, "An Improved Decoding Algorithm for Finite-Geometry LDPC Codes," IEEE Trans. Commun., vol. 57, no. 2, Feb. 2009, pp. 302-306.   DOI
12 N. Miladinovic and M.P.C. Fossorier, "Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes," IEEE Trans. Inf. Theory, vol. 51, Apr. 2005, pp. 1594-1606.   DOI
13 X. Hu, E. Eleftheriou, and D.M. Arnold, "Regular and Irregular Progressive Edge-Growth Tanner Graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, Jan. 2005, pp. 386-398.   DOI   ScienceOn
14 R. Gallager, "Low-Density Parity-Check Codes," IRE Trans. Inf. Theory, vol. 8, Jan. 1962, pp. 21-28.   DOI   ScienceOn