An improvement of the PEG algorithm for LDPC codes in the waterfall region

EUROCON 2005 - The International Conference on Computer as a Tool

Volumn II, Issue , 2005, Pages 1044-1047

  Richter, G ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; ERROR ANALYSIS; GRAPH THEORY;

ERROR FLOORS; LOW-DENSITY PARITY-CHECK (LDPC); PERFORMANCE LOSS;

ALGORITHMS;

EID: 33947330955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/eurcon.2005.1630128     Document Type: Conference Paper

References (17)

1. C. Berrou, A. Glavieux, and P. Thitimajshima. Near shannon limit error-correcting coding and decoding: Turbo-codes(1). IEEE International Conference on Communications, pages 1064-1070, 1993.
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, Linköping University, Sweden, 1996.
4. R. G. Gallager. Low-Density Parity-Check Codes. M.I.T. Press, Cambridge, 1963.
5. 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.
6. 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.
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. X. Y. Hu, E. Eleftheriou, and D. M. Arnold. Regular and irregular progressive edge-growth tanner graphs. IEEE Trans. Inf. Theory, 51(1):386 398, January 2005.
9. T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel. Selective avoidance of cycles in irregular LDPC code construction. IEEE Trans. Inf. Theory, 51(1):386 398, January 2004.
10. R. M. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inf. Theory, IT-27:533 547, September 1981.
11. 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.
12. D. J. MacKay, S.T. Wilson, and M. C. Davey. Comparison of constructions of irregular gallager codes. IEEE Trans. Commun., 47(10):1449 1454, October 1999.
13. K. Kasai, T. Shibuya, and K. Sakaniwa. Detailedly represented irrehular low-density parity-check codes. IEICE Trans. Fundamentals, E86-A(10):2435 2444, October 2003.
14. T. Richardson and R. Urbanke. Multi-edge type LDPC codes. Unpublished.
15. J. Zhang and M. P. C. Fossorier. Shuffled iterative decoding. IEEE Trans. Commun., pages 209 213, February 2005.
16. G.Richter, G. Schmidt, M. Bossert, and E. Costa. Optimization of a reduced-complexity decoding algorithm for LDPC codesby density evolution. In IEEE International Conference on Communications, Seoul, Korea, May 2005.
17. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Trans. Inf. Theory, 47(2):569 584, February 2001.