Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution

IEEE International Conference on Communications

Volumn 1, Issue , 2005, Pages 642-646

  Richter, G ^a   Schmidt, G ^a   Bossert, M ^a   Costa, E ^b  

^a UNIVERSITY OF ULM   (Germany)

^b SIEMENS AG   (Germany)

Author keywords

Belief propagation; Complexity reduction; Density evolution; Iterative decoding; LDPC codes

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; ITERATIVE METHODS; OPTIMIZATION;

BELIEF PROPAGATION; COMPLEXITY REDUCTION; DENSITY EVOLUTION; ITERATIVE DECODING; LDPC CODES;

DECODING;

EID: 24644500312     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. G. Gallager. Low-Density Parity-Check Codes. M.I.T. Press, Cambridge, 1963.
2. D. J. C. MacKay and R. M. Neal. Near shannon limit performance of low-density parity-check codes. Electron. Lett., 32:1645-1646, August 1996.
3. N. Wiberg. Codes and Decoding on General Graphs. PhD thesis, Linkoping University, Sweden, 1996.
4. D. J. C. MacKay, S. T. Wilson, and M. C. Davey. Comparison of constructions of irregular codes. 36th Allerton Conference Communications, Control, and Computing, September 1998.
5. T. J. Richardson, M. A. Shokrollahi, and R. Urbanke. Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory, 47(2):617-637, February 2001.
6. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory, 47(2): 585-598, February 2001.
7. 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 Communication Letters, 5:58-60, February 2001.
8. C. Jones, E. Valles, M. Smith, and J. Villasensor. Approximate-min constraint node updating for Idpc code decoding. In MilCom 2003, Boston, MA, October 2003.
9. E. Eleftheriou, T. Mittelholzer, and A. Dholakia. Reduced-complexity decoding algorithm for low-density parity-check codes. Electron. Lett., 37:102-104, January 2001.
10. J. Chen, A. Dholaki, E. Elftheriou, M. Fossorier, and X. Y. Hu. Near optimal reduced-complexity decoding algorithms for LDPC codes. In IEEE Intern. Symposium on Inf. Theory, page 455, July 2002.
11. T. Clevorn and P. Vary. Low-complexity belief propagation decoding by approximations with lookup-tables. In 5th International ITG Conference on Source and Channel Coding, pages 211-215, Erlangen, Germany, January 2004.
12. R. M. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inf. Theory, 17-27:533-547, September 1981.
13. J. Hagenauer, E. Offer, and L. Papke. Iterative decoding of binary block and convolutional codes. IEEE Trans. Inf. Theory, 42(2):429-445, March 1996.
14. X. Y. Hu, E. Eleftheriou, and D. M. Arnold. Regular and irregular progressive edge-growth tanner graphs. Submitted to IEEE Trans. on Inf. Theory, 2003.