Efficient encoding of quasi-cyclic low-density parity-check codes

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2005, Pages 1205-1210

  Li, Zongwang ^a   Chen, Lei ^b   Zeng, Lingqi ^b   Lin, Shu ^b   Fong, Wai ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Davis   (United States)

^c NASA GODDARD SPACE FLIGHT CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING CIRCUITS; ENCODING COMPLEXITY; PARALLEL ENCODING;

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); SHIFT REGISTERS;

CODES (SYMBOLS);

EID: 33846564478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1577844     Document Type: Conference Paper

References (13)

1. L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near Shannon limit quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 7, pp. 1038-1042, July 2004.
2. 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. Inform. Theory, vol. 50, no. 6, pp 1269-1279, June 2004.
3. L. Chen, I. Djurdjevic, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Construction of QC-LDPC codes based on the minimum-weight codewords of RS codes," Proc. IEEE Int. Symp. Inform. Theory, pp. 239, Chicago, IL, June 27-July 2, 2004.
4. L. Chen, L. Lan, I. Djurdjevic, S. Lin, K. Abdel-Ghaffar, "An algebraic methode for constructing quasi-cyclic LDPC codes," Proc. Int. Symp. Inform. Theory and Its Applications, ISITA2004, pp. 535-539, Parma, Italy, Oct. 10-13, 2004.
5. J. Xu, L. Chen, L. -Q. Zeng, L. Lan, and S. Lin, "Construction of low-density parity-check codes by superposition," IEEE Trans. Commun., vol.53, no. 2, Feb. 2005.
6. R. M. Tanner, "Spectral graphs for quasi-cyclic LDPC codes," Proc. IEEE int. Symp. on Inform. Theory, p. 226, Washington D.C., June 24-29, 2001.
7. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
8. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept. 1981.
9. K. Yu, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: a discovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
10. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd edition, Prentice Hall, Upper Saddle River, NJ., 2004.
11. I. N. Iman and L. M. Lamont, "An algorithm using the Schur complement in inverting large matrices," Proceedings of the IEEE Southeast Conference on Energy and Information Technologies in the Southeast, vol. 2, pp. 421-426, April 9-12, 1989.
12. R. M. Gray, "Toeplitz and circulant matrices: a review," Information System Laboratory, Department of Electrical Engineering, Stanford University, 2001.
13. D. E. Hocevar, "Efficient encoding for a family of quasi-cyclic LDPC codes," GLOBECOM '03, vol.7, pp. 3996 - 4000, 1-5 Dec. 2003.