Browse > Article

On the Absorbing Sets of the Regular LDPC Codes with Variable Node Degree Three  

Lee, Ki-Jun (삼성전자 Device Solution 부문)
Chung, Ha-Bong (홍익대학교 전자공학과)
Jang, Hwan-Seok (홍익대학교 전자공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.34, no.10C, 2009 , pp. 937-945 More about this Journal
Abstract
In this paper, we investigate into the existence and various properties of absorbing sets in regular LDPC codes with variable node degree three. Also, we figure out the critical number of some absorbing sets that are believed to be the major cause of error floor in (3,5) Tanner LDPC codes.
Keywords
Absorbing Set; Tanner (3,5) LDPC Codes; Fully Absorbing Set; Critical Number;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Kim, J.-S. No, H. Chung, and D.J. Shin, 'On the girth of Tanner's (3,5) quasi-cyclic LDPC codes,' IEEE Trans. on Inform. Theory, Vol. 52, No. 4, pp. 1739-1744, Apr. 2006   DOI   ScienceOn
2 K. Lee, H. Chung, and H. Jang, 'Two-stage decoding in Gallager B algorithm of LDPC codes using redundant parity-check equations,' Proc. JCCI 2009, III-E-4, Kwangju, Korea, April 2009
3 T. Richardson, 'Error floors of LDPC codes', in Proc. 41st Annual Conference on Communication, Control and Computing, pp.1426-1435, Sep. 2003
4 S. Laendner and O. Milenkovic, 'Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes', In Proc. of Wireless Networks, Communication and Mobile Computing, Vol.1, pp. 630-635, Hawaii, USA, 2005
5 S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic 'Error floors of LDPC codes on the binary symmetric channel,' in Proc. of IEEE ICC 2006, Vol.3, pp. 1089-1094, June 2006
6 D. Mackay and M. Postol, 'Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes,' Electronic Notes in Theoretical Computer Science, Vol. 74, 2003
7 L. Dolecec, Z. Zhang, V. Anantharam, M. Wainwight, B. Nikolic, 'Analysis of absorbing sets for array-based LDPC codes,' in Proc. of ICC 2007, pp. 6261-6268, 24-28 June 2007
8 C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, 'Finite-length analysis of low-density parity-check codes on the binary erasure channel,' IEEE Trans. on Inform. Theory, Vol. 48, No. 6, pp. 1570-1579, June 2002   DOI   ScienceOn
9 C. Kelley and D. Sridhara, 'Pseudocodewords of Tanner graphs,' IEEE Trans. on Inform. Theory, Vol. 53, No. 11, pp. 4013-4038, Nov. 2007   DOI   ScienceOn
10 Z. Zhang, L. Dolec, B. Nikolic, V. Anantharam, and M. Wainwright, 'Investigation of error floors of structured low-density parity-check codes by hardware emulation,' in Proc. of GLOBECOM 2006, pp. 1-6, San Francisco, CA, Nov. 2006
11 S. Benedetto and G. Montorsi, 'Unveiling turbo codes: Some results on parallel concatenated coding schemes,' IEEE Trans. on Inform. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996   DOI   ScienceOn
12 P. Vontobel and R. Koetter, 'Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes,' submitted IEEE Trans. Inform. Theory, 2005