Design of variable-rate irregular LDPC codes with low error floor

IEEE International Conference on Communications

Volumn 1, Issue , 2005, Pages 647-651

  Dinoi, Libero ^a   Sottile, Francesco ^a   Benedetto, Sergio ^b  

^a ISTITUTO SUPERIORE MARIO BOELLA   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; ERROR DETECTION; LINEAR CONTROL SYSTEMS; REAL TIME SYSTEMS; SYSTEMS ANALYSIS;

CODEWORDS; DESIGN CRITERIA; ERROR FLOOR; LDPC CODES;

CODES (SYMBOLS);

EID: 24344498356     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. G. Gallager, Low density parity check codes, MIT Press, Cambridge, MA, 1963.
2. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes", IEEE Transactions on Information Theory, vol. 47, no. 2, Feb. 2001, pp. 619-637.
3. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results", IEEE Transactions on Information Theory, vol. 47, Nov. 2001, pp. 2711-2736.
4. J. Rosenthal, and P. O. Vontobel, "Constructions of LDPC Codes Using Ramanujan graphs and Ideas from Margulis", Proc. of the 38-th Allerton Conference on Communication, Control, and Computing, Monticello, Illinois (USA), Oct. 4-6 2000, pp. 248-257.
5. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth Tanner graphs", Proc. IEEE Global Telecommun. Conf., vol. 2, San Antonio, Texas (USA), November 2001, pp. 995-1001.
6. T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of Irregular LDPC Codes with Low Error Floors", Proc. IEEE International Conference on Communications, vol. 5, May 2003, pp. 3125-3129.
7. A. Ramamoorthy, and R. Wesel, "Construction of Short Block Length Irregular Low-Density Parity-Check Codes", Proc. IEEE International Conference on Communications, vol. 1, June 2004, pp. 410-414.
8. L. Ping, W. K. Leung, and N. Phamdo, "Low density parity check codes with semi-random parity check matrix", Electronics Letters, vol. 35, no. 1, Jan. 1999, pp. 38-39.
9. M. Yang, W. E. Ryan, and Y. Li, "Design of Efficiently Encodable Moderate-Length High-Rate Irregular LDPC Codes", IEEE Trans. on Comm., vol. 52, no. 4, April 2004, pp. 564-571.
10. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices", IEEE Transactions on Information Theory, vol. 45, Mar. 1999, pp. 399-431.
11. 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 Transactions on Information Theory, vol. 48, no. 6, June 2002, pp. 1570-1579.
12. D. MacKay, and M. S. Postol, "Weaknesses of Margulis and RamanujanMargulis Low-Density Parity-Check Codes", Electronic Notes in Theoretical Computer Science, vol. 74, 2003.
13. R. Koetter, and P. O. Vontobel, "Graph-covers and iterative decoding of finite length codes", Proc. 3rd International Symposium on Turbo Codes and Related Topics, Brest, France, 2003, pp. 75-82.
14. B. J. Frey, R. Koetter, and A. Vardy, "Signal-Space Characterization of Iterative Decoding", IEEE Transactions on Information Theory, vol. 47, no. 2, Feb. 2001, pp. 766-781.
15. S. H. Lee, W. H. Lee, S. J. Bae, S. I. Lee, and E. K. Joo, "Bit probability transition characteristics of LDPC code", 10th International Conference on Telecommunications, Tahiti, French Polynesia, Feb.-Mar. 2003, pp. 553-557.
16. S. Dolinar, and D. Divsalar, "Weight distribution for Turbo Codes Using Random and Non random Permutations", TDA Progress Report 42-122, August 15 1995.
17. J. Li, and K. Narayanan, "Rate-compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Scheme in Packet Data Communications", Int. Conf. on Comm. Internet and Info. Tech., Nov. 2002.
18. X.-Y. Hu, M. P. C. Fossorier, and E. Eleftheriou, "On the computation of the Minimum Distance of Low-Density Parity-Check Codes", Proc. IEEE International Conference on Communications, vol. 2, June 2004, pp. 767-771.