Eliminating small stopping sets in irregular low-density parity-check codes

IEEE Communications Letters

Volumn 13, Issue 6, 2009, Pages 435-437

  Jiao, Xiaopeng ^a   Mu, Jianjun ^a   Song, Jing ^a   Zhou, Lihua ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Error floor; Low density parity check (LDPC) codes; Stopping sets

Indexed keywords

CHECK NODES; ERROR FLOOR; ERROR-FLOOR REGION; FRAME ERROR RATE; IRREGULAR LOW-DENSITY PARITY-CHECK CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; SIMULATION RESULT; STOPPING SET; STOPPING SETS;

FLOORS;

CODES (SYMBOLS);

EID: 67650693088     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2009.090009     Document Type: Article

References (16)

1. 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. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
2. D. J. C. MacKay and M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, vol. 74, 2003.
3. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Commun., Contr. Comput., 2003.
4. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory vol. 51, no. 1, pp. 386-398, Jan. 2005.
5. T. Tian, C. Jones, J. Villasenor, and R. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1247, Aug. 2004.
6. A. Ramamoorthy and R. Wesel, "Construction of short block length irregular low-density parity-check codes," in Proc. IEEE Intern. Conf. Commun., Paris, France, June 2004, pp. 410-414.
7. C. C. Wang, "Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble," in Proc. IEEE Inf. Theory Workshop, Chengdu, China, Oct. 2006, pp. 86-90.
8. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 922-932, Mar. 2006.
9. J. Han and P. Siegel, "Improved upper bounds on stopping redundancy," IEEE Trans. Inform. Theory, vol. 53, no. 1, pp. 90-104, Jan. 2007.
10. G. Richter, "Finding small stopping sets in the Tanner graphs of LDPC codes," in Proc. 4th Intern. Symp. Turbo Codes and Related Topics Munich, Germany, Apr. 2006.
11. Y. Han and W. E. Ryan, "LDPC decoder strategies for achieving low error floors," in Proc. 2008 Inf. Theory and Applications Workshop. [Online]. Available: http://ita.ucsd.edu/workshop/08/files/paper/paper_218.pdf
12. E. Rosnes and Ø. Ytrehus, "An algorithm to find all small-size stopping sets of low-density parity-check matrices," in Proc. IEEE Intern. Symp. Inf. Theory, Nice, France, June 2007, pp. 2936-2940.
13. G. Richter, "Puncturing, mapping, and design of low-density parity-check codes," Ph.D. dissertation, Ulm University, Ulm, Germany, 2007.
14. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
15. D. J. C. MacKay, Encyclopedia of Sparse Graph Codes. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/data.html
16. X. Y. Hu, "Source code for approximating the MinDist problem of LDPC codes: Error-correcting codes." [Online]H Available: http://www/ inference.phy.cam.ac.uk/mackay/MINDIST_ECC.html