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

IEEE Transactions on Communications

Volumn 54, Issue 1, 2006, Pages 71-81

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b University of California   (United States)

^c NASA GODDARD SPACE FLIGHT CENTER   (United States)

Author keywords

Array of circulants; Quasi cyclic (QC) low density parity check (LDCP) codes; Systematic circulant (SC) form

Indexed keywords

ARRAYS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; SHIFT REGISTERS; VECTORS;

ARRAY OF CIRCULANTS; ENCODING COMPLEXITY; PARALLEL ENCODING; QUASI-CYCLIC (QC) LOW-DENSITY PARITY-CHECK (LDPC) CODES; SYSTEMATIC-CIRCULANT (SC) FORM;

ENCODING (SYMBOLS);

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

References (25)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inf. Theory, vol. IT-8, no. 1, 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, no. 3, pp. 399-432, Mar. 1999.
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
5. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
6. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low density parity check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 9, pp. 533-547, Sep. 1981.
8. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Univ. Linkoping, Dept. Elect. Eng., Linkoping, Sweden, 1996.
9. F. R. Kschischang, B. J. Frey, and H. -A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
10. R. M. Tanner, "Spectral graphs for quasi-cyclic LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Washington, DC, Jun. 2001, p. 226.
11. K. Yu, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: A discovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 11, pp. 2711-2736, Nov. 2001.
12. S. J. Johnson and S. R. Weller, "Codes for iterative decoding from partial geometries," IEEE Trans. Commun., vol. 52, no. 2, pp. 236-247, Feb. 2003.
13. I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "Construction of low-density parity-check codes based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, no. 7, pp. 317-319, Jul. 2003.
14. 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, Jul. 2004.
15. B. Vasic and O. Milenkovic, "Combinatorial construction of low density parity check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
16. 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, no. 6, pp. 1269-1279, Jun. 2004.
17. 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, no. 6, pp. 1257-1268, Jun. 2004.
18. 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," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun.-Jul. 2004, p. 239.
19. L. Chen, L. Lan, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "An algebraic methode for constructing quasicyclic LDPC codes," in Proc. Int. Symp. Inf. Theory Appl., Parma, Italy, Oct. 10-13, 2004, pp. 535-539.
20. H. Tang, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 572-596, Feb. 2005.
21. J. Xu, L. Chen, L.-Q. Zeng, L. Lan, and S. Lin, "Construction of low-density parity-check codes by superposition," IEEE Rans. Commun., vol. 53, no. 2, pp. 243-251, Feb. 2005
22. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
23. W. W. Peterson and E. J. Weldon, Jr., Error Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
24. I. N. Iman and L. M. Lamont, "An algorithm using the Schur complement in inverting large matrices," in Proc. IEEE Southeast Conf. Energy Inf. Technol. Southeast, vol. 2, Apr. 9-12, 1989, pp. 421-426.
25. R. M. Gray, Toeplitz and Circulant Matrices: A Review. Stanford, CA: Stanford Univ., 2001.