A degree-matched check node approximation for LDPC decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Howard, Sheryl L ^a   Schlegel, Christian ^a   Gaudet, Vincent C ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING;

ASYMPTOTIC EXPRESSIONS; CHECK NODE DEGREE; CORRECTION FACTORS; DECODING ALGORITHM; LOW-DENSITY PARITY-CHECK (LDPC) CODES; SUM-PRODUCT ALGORITHM; SUM-PRODUCT DECODING; VERY LOW COMPLEXITY;

APPROXIMATION ALGORITHMS;

EID: 85114301347     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523516     Document Type: Conference Paper

References (11)

1. R. G. Gallager,”Low-density parity-check codes”, IRE Trans. Inform. Theory, vol. 8, pp. 21-28, Jan. 1962.
2. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufman, San Mateo, CA, 1988.
3. N. Wiberg, Codes and Decoding on General Graphs. PhD thesis, Linköping University, Linköping, Sweden, 1996.
4. A. Anastasopoulos,”A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution”, IEEE GLOBECOM'01, Vol. 2, pp. 1021-1025, Nov. 25-29, 2001.
5. rd Int. Sym. on Turbo Codes (ISTC 03), pp. 451-454, Brest, France, 1-5 Sept. 2003.
6. G. Battail and H. M. S. El-Sherbini,”Coding for radio channels”, Ann. Télécommun., vol. 37, pp. 75-96, Jan./Feb. 1982.
7. E. Eleftheriou, T. Mittelholzer and A. Dholakia,”Reduced-complexity decoding algorithm for low-density parity-check codes”, IEEE Electronic Letters, vol. 37, no. 2, pp. 102-104, Jan. 2001.
8. A. J. Blanksby and C. J. Howland,”A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder”, IEEE Journal Solid-State Circuits, vol. 37, no. 2, pp. 404-412, March 2002.
9. M. P. C. Fossorier, M. Mihaljevic and I. Imai,”Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation”, IEEE Trans. Commun., pp. 673-680, May 1999.
10. J. Hagenauer, E. Offer and L. Papke,”Iterative Decoding of Binary Block and Convolutional Codes”, IEEE Trans. on Inform. Theory, vol. 42, pp. 429-445, March 1996.
11. R. Hu, J. Li and E. Kurtas,”Quantization and Quantization Sensitivity of Soft-Output Product Codes for Fast-Speed Applications”, Proc. of IEEE Sarnoff Sym., Princeton, NJ, March 2004.