Construction of low-density parity-check codes by superposition

IEEE Transactions on Communications

Volumn 53, Issue 2, 2005, Pages 243-251

  Xu, Jun ^a,b   Chen, Lei ^a   Zeng, Lingqi ^a   Lan, Lan ^a   Lin, Shu ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MARVELL SEMICONDUCTOR INC   (United States)

Author keywords

Quasi cyclic low density parity check (LDPC) codes; Reed Solomon (RS) codes; Superposition

Indexed keywords

BINARY CODES; DECODING; ERROR ANALYSIS; GRAPHIC METHODS; ITERATIVE METHODS; MATRIX ALGEBRA;

BINARY REGULAR CODE; ITERATIVE DECODING; LOW DENSITY PARITY CHECK (LDPC) CODES; QUASI CYCLIC LOW DENSITY PARITY CHECK CODES; REED-SOLOMON (RS) CODES; SUPERPOSITION;

SIGNAL ENCODING;

EID: 15544386457     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.841966     Document Type: Article

References (28)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay and R. M. Neal, "Near-Shannon-limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, pp. 399-432, Mar. 1999.
4. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, pp. 619-637, Feb. 2001.
5. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 599-618, Feb. 2001.
6. S. Y. Chung, G. D. Forney, T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, pp. 58-60, Feb. 2001.
7. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and more," IEEE Trans. Inf. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
8. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 38th Allerton Conf. Commun., Control, Comput., Monticello, IL, Oct. 2000, pp. 248-257.
9. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. 6th Int. Symp. Commun. Theory, Applicat., Ambleside, U.K., Jul. 2001, pp. 365-370.
10. S. Lin, J. Xu, I. Djurdjevic, and H. Tang, "Hybrid construction of LDPC codes," in Proc. 40th Annu. Allerton Conf. Commun., Control, Comput. Monticello, IL, Oct. 2002, pp. 1149-1158.
11. J. Kim, U. N. Peled, I. Perepelitsa, and V. Pless, "Explicit construction of families of LDPC codes with girth at least six," in Proc. 40th Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, Oct. 2002, pp. 1024-1031.
12. S. J. Johnson and S. R. Weller, "A family of irregular LDPC codes with low encoding complexity," IEEE Commun. Lett., vol. 7, pp. 79-81, Feb. 2003.
13. I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "Construction of low-density parity-check code based on Reed-Solomon code with two information symbols," IEEE Commun. Lett., vol. 7, pp. 317-319, Jul. 2003.
14. J. Xu and S. Lin, "A combinatoric superposition method for constructing low-density parity-check codes," in Proc. Int. Symp. Inf. Theory, vol. 30, Yokohama, Japan, Jun.-Jul. 2003.
15. J. M. F. Moura, J. Lu, and H. Zhang, "Structured low-density parity-check code," IEEE Signal Process. Mag., vol. 21, pp. 42-55, Jan. 2004.
16. L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near-Shannon quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, pp. 1038-1042, Jul. 2004.
17. H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager and circulant low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 50, pp. 1269-1279, Jun. 2004.
18. B. Vasic and O. Milenkovic, "Combinatorial construction of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory vol. 50, pp. 1156-1176, Jun. 2004.
19. B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, "Construction of low-density parity-check codes based on balanced incomplete block designs," IEEE Trans. Inf. Theory, vol. 50, pp. 1257-1268, Jun. 2004.
20. N. Miladinovic and M. Fossorier, "Systematic recursive construction of LDPC codes," IEEE Commun. Lett., vol. 8, pp. 302-304, May 2004.
21. Z. W. Li, L. Chen, and S. Lin, "Efficient encoding of quasi-cyclic LDPC codes," IEEE Trans. Commun., submitted for publication.
22. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
23. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
24. J. A. Bondy and U. S. R. Murty, Graph Theory With Applications. London, U.K.: MacMillan, 1976.
25. D. B. West, Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2001.
26. P. Elias, "Error-free coding," IRE Trans. Inf. Theory, vol. IT-4, pp. 29-30, Sep. 1954.
27. H. Mann, Analysis and Design of Experiments. New York: Dover, 1949.
28. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. IEEE Int. Symp. Inf. Theory, Washington, DC, Jun. 2001, p. 4.