A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn 2, Issue , 2004, Pages 1990-1994

  Li, Zongwang ^a   Kumar, B V K Vijaya ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOW DENSITY PARITY CHECK CODES (LDPC); NODES; PARITY CHECK MATRIX; PROGRESSIVE EDGE GROWTH (PEG);

BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; MATRIX ALGEBRA; PARAMETER ESTIMATION; RANDOM PROCESSES; SET THEORY;

BLOCK CODES;

EID: 21644439335     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-18, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters, vol. 32, No. 18, pp 1645-1646, 1996.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
4. T. J. Richardson, M. A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular lod-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
5. S. Y. Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Letters, vol. 5, pp. 58-60, Feb. 2001.
6. Y. Kou, S. Lin, M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," Information Theory, IEEE Transactions on, Volume: 47 Issue: 7, Page(s): 2711-2736, Nov. 2001
7. S. Lin, L. Chen, J. Xu and I. Djurdjevic, "Near Shannon limit quasi-cyclic low-density parity-check codes," IEEE Global Telecommunications Conference, 2003, Vol. 4, pp. 2030 - 2035, 1-5 December 2003.
8. J. L. Fan, "Array codes as low-desity parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, Sept. 4-7, 2000, pp. 543-546.
9. H. Song, J. Liu and B.V.K.Vijava Kumar, "Low complexity LDPC codes for partial response channels," IEEE Global Telecommunications Conference, 2002, Vol. 2, pp. 1294 - 1299, 17-21 November 2002.
10. S. J. Johnson, S. R. Weller, "Quasi-cyclic LDPC codes from difference families", 3rd Australian Communications Theory Workshop, Canberra, February 4-5, 2002.
11. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
12. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Progressive Edge-Growth Tanner Graphs," IEEE Global Telecommunications Conference 2001, vol. 2, pp. 9951001, 25-29 November, 2001.