Browse > Article

A Modified Sum-Product Algorithm for Error Floor Reduction in LDPC Codes  

Yu, Seog-Kun (경북대학교 IT대학 전자공학부)
Kang, Seog-Geun (경상대학교 전기전자공학부)
Joo, Eon-Kyeong (경북대학교 IT대학 전자공학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.35, no.5C, 2010 , pp. 423-431 More about this Journal
Abstract
In this paper, a modified sum-product algorithm to correct bit errors captured within the trapping sets, which are produced in decoding of low-density parity-check (LDPC) codes, is proposed. Unlike the original sum-product algorithm, the proposed decoding method consists of two stages. Whether the main cause of decoding failure is the trapping sets or not is determined at the first stage. And the bit errors within the trapping sets are corrected at the second stage. In the modified algorithm, the set of failed check nodes and the transition patterns of hard-decision bits are exploited to search variable nodes in the trapping sets. After inverting information of the variable nodes, the sum-product algorithm is carried out to correct the bit errors. As a result of simulation, the proposed algorithm shows continuously improved error performance with increase in the signal-to-noise ratio. It is, therefore, considered that the modified sum-product algorithm significantly reduces or possibly eliminates the error floor in LDPC codes.
Keywords
LDPC Code; Modified Sum-Product Algorithm; Error Floor; Trapping Set;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, Vol.27, No.5, pp.533-547, Sep., 1981.   DOI
2 X. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graph," IEEE Trans. Inform. Theory, Vol.51, No.1, pp.336-398, Jan., 2005.
3 Y. Zhang and W. Ryan, "Toward low LDPC-code floors: A case study," IEEE Trans. Commun., Vol.57, No.6, pp.1566-1573, June, 2009.   DOI
4 E. Cavus and B. Daneshrad, "A performance improvement and error floor avoidance technique for belief propagation decoding of LDPC codes," Proc. IEEE PIMRC 2005, Berlin, Germany, Vol.4, pp.2386-2390, Sep., 2005.
5 Y. Han and W. Ryan, "Low-floor decoders for LDPC codes," IEEE Trans. Commun., Vol.57, No.6, pp.1663-1673, June, 2009.   DOI
6 H. S. Park, LDPC Decoding Schemes with Post-Processing for Lowering Error Floors, M. S. Thesis, Seoul National University, Feb., 2009.
7 J. Lin, Z. Wang, L. Li, J. Sha, and M. Gao, "Efficient shuffle network architecture and application for WiMAX LDPC decoders," IEEE Trans. Circuits Syst. II, Exp. Briefs, Vol.56, No.3, pp.215-219, Mar., 2009.
8 C. Di, D. Proietti, E. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, Vol.48, No.6, pp.1570-1579, June, 2002.   DOI   ScienceOn
9 T. Richardson, "Error floors of LDPC codes," Proc. 41st Allerton Commun. Contr. Comput. Monticello, IL, pp.1426-1435, Oct., 2003.
10 C. A. Cole, S. G. Wilson, E. K. Hall, and T. R. Giallorenzi, "Analysis and design of moderate length regular LDPC codes with low error floors," Proc. IEEE Inform. Sci. Syst. 2006, Charlottesville, VA, pp.823-828, Mar., 2006.
11 ETSI TS 102 377 V1.1.1, Digital Video Broadcasting (DVB); DVB-H Implementation Guidelines, ETSI, Feb., 2005.
12 M. Ivkovic, S. K. Chilappagari, and B. Vasic, "Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers," IEEE Trans. Inform. Theory, Vol.54, No.8, pp.3763-3768, Aug., 2008.   DOI
13 R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, Vol.8, No.1, pp.21-28, Jan., 1962.   DOI   ScienceOn
14 D. J. C. Mackay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., Vol.32, No.18, pp.1645-1646, Aug., 1996.