Large-girth LDPC codes based on graphical models

IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

Volumn 2004-January, Issue , 2004, Pages 100-104

  Zhang, Haotian ^a   Moura, José M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; GRAPHIC METHODS; SIGNAL PROCESSING; WIRELESS TELECOMMUNICATION SYSTEMS;

AWGN CHANNEL; CODE RATES; DECODING PERFORMANCE; GRAPHICAL MODEL; LDPC CODES;

CODES (SYMBOLS);

EID: 84944673133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPAWC.2003.1318930     Document Type: Conference Paper

References (7)

1. R. G. Gallager, Low-Density Parity Check Codes, MIT Press, Cambridge, MA, 1963.
2. D. J. C. Mackay and R. M. Neal, "Good codes based on very sparse matrices, " in Cryptography and Coding, 5th IMA Conference, in Lecture Notes in Computer Science, C. Boyd, Ed., 1995, vol. 1025, pp. 110-111.
3. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb 2001.
4. R. J. McEIiece, D. J. C. Mackay, and J. F. Cheng, "Turbo decoding as an instance of Pearl's "belief propagation" algorithm, " IEEE J. Selected Areas Common., vol. 16, no. 2, pp. 140-152, Feb 1998.
5. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs?, " IEEE Tans. Inform. Theory, vol. 45, no. 6, pp. 2173-2181, Sep 1999.
6. H. Song, J. Liu, and B. V. K. Vijaya Kumar, "Low complexity LDPC codes for magnetic recording, " in IEEE Giobecom 2002, Taipei, Taiwan, R.O.C., Nov 2002.
7. D. J, C. Mackay, "Good error-correcting codes based on very sparse matrices, " IEEE Trans, inform. Theory, vol. 45, no. 2, pp. 399-431, March 1999.