Optimized asymptotic puncturing distributions for different LDPC code constructions

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 831-835

  Richter, G ^a   Stiglmayr, S ^a   Bossert, M ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PUNCTURING DISTRIBUTIONS; LDPC CODES; LOW-DENSITY PARITYCHECK CODES;

ASYMPTOTIC ANALYSIS; DISTRIBUTION FUNCTIONS; OPTIMIZATION;

CODES (SYMBOLS);

EID: 39049095777     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261730     Document Type: Conference Paper

References (15)

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, Linköping 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 capacityapproaching 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. J. Ha, J. Kim, and S. W. McLaughlin. Rate-compatible puncturing of low-density parity-check codes. IEEE Trans. Inf. Theory, IT-50(1):2824-2836, November 2004.
9. R. M. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inf. Theory, IT-27:533-547, September 1981.
10. 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.
11. K. Kasai, T. Shibuya, and K. Sakaniwa. Detailedly represented irregular low-density parity-check codes. IEICE Trans. Fundamentals, E86A(10):2435-2444, October 2003.
12. J. Thorpe. Low-density parity-check (LDPC) codes constructed from protographs. IPN Progress Report 42-154, JPL, August 2003.
13. T. Richardson and R. Urbanke. Multi-edge type LDPC codes. Unpublished.
14. 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.
15. X. Hu. Low-Delay Low-Complexity Error-Correcting Codes on Sparse Graphs. PhD thesis, University of Lausanne, Swiss, September 2002.