Construction of near-optimum burst erasure correcting low-density parity-check codes

IEEE Transactions on Communications

Volumn 57, Issue 5, 2009, Pages 1320-1328

  Paolini, Enrico ^a   Chiani, Marco ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Burst erasure channel; Iterative decoding; LDPC codes

Indexed keywords

BURST ERASURE CHANNEL; DESIGN METHOD; EFFECTIVE TOOL; ERASURE CHANNELS; ERASURE CORRECTING; ITERATIVE CORRECTIONS; LDPC CODES; LOCAL ANALYSIS; LOW-DENSITY PARITY-CHECK CODES; MATRIX; MATRIX OPTIMIZATION; NUMERICAL RESULTS; STOPPING SET;

ALGORITHMS; CHANNEL CODING; CODES (SYMBOLS); CODING ERRORS;

ITERATIVE DECODING;

EID: 66849128055     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.05.070047     Document Type: Article

References (33)

1. R. Gallager, Low-Density Parity-Check Codes. Cambridge, Massachusetts: M.I.T. Press, 1963.
2. M. Yang and W. Ryan, "Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel," IEEE Trans. Magn., vol. 40, no. 2, pp. 507-512, Mar. 2004.
3. F. Peng, M. Yang, and W. Ryan, "Simplified eIRA code design and performance analysis for correlated Rayleigh fading channels," IEEE Trans. Wireless Commun., vol. 5, no. 4, pp. 720-725, Apr. 2006.
4. G. P. Calzolari, M. Chiani, F. Chiaraluce, R. Garello, and E. Paolini, "Channel coding for future space missions: new requirements and trends," Proc. IEEE, vol. 95, no. 11, pp. 2157-2170, Nov. 2007.
5. E. Paolini, M. Chiani, and G. P. Calzolari, "Long erasure correcting codes: The new frontier for zero-loss in space applications?" in Proc. AIAA International Conf. Space Operations, June 2006.
6. T. Wadayama, "Ensemble analysis on minimum span of stopping sets," in Proc. Inform. Theory Applications Workshop, Feb. 2006.
7. Y. Y. Tai, L. Zeng, L. Lan, S. Song, S. Lin, and K. Abdel-Ghaffar, "Algebraic construction of quasi-cyclic LDPC codes - part II: for AWGN and binary random and burst erasure channels," Applied Algebra, Algebraic Algorithms Error-Correcing Codes, Lecture Notes Computer Science, vol. 3857/2006, pp. 265-274, Feb. 2006.
8. Y. Y. Tai, L. Lan, L. Zeng, S. Lin, and K. Abdel-Ghaffar, "Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels," IEEE Trans. Commun., vol. 54, no. 10, pp. 1765-1774, Oct. 2006.
9. D. Divsalar, S. Dolinar, and C. Jones, "Protograph LDPC codes over burst erasure channels," in Proc. IEEE Military Commun. Conf., Oct. 2006, pp. 1-7.
10. E. Paolini and M. Chiani, "Improved low-density parity-check codes for burst erasure channels," in Proc. IEEE International Conf. Commun., June 2006, vol. 3, pp. 1183-1188.
11. G. Hosoya, H. Yagi, T. Matsushima, and S. Hirasawa, "Performance of low-density parity-check codes for burst erasure channels," in Proc. International Symposium Inform. Theory Applications, Nov. 2006.
12. G. Hosoya, H. Yagi, T. Matsushima, and S. Hirasawa, "A modofication method for constructing low-density parity-check codes for burst erasures," IEICE Trans. Fundamentals, vol. E89-A, no. 10, pp. 2501-2509, Oct. 2006.
13. T. Wadayama, "Greedy construction of LDPC codes for burst erasure channel," IEICE Tech. Report, vol. 104, no. 302, pp. 35-40, Sept. 2004.
14. S. Johnson and T. Pollock, "LDPC codes for the classic bursty channel," in Proc. International Symposium Inform. Theory Applications, Aug. 2004, pp. 184-189.
15. M. Fossorier, "Universal burst error correction," in Proc. IEEE International Symposium Inform. Theory, Jan. 2006, pp. 1969-1973.
16. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
17. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," IEEE Trans. Inform. Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004.
18. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
19. C. Di, D. Proietti, I. Telatar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
20. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd International Symposium Turbo Codes Related Topics, Sep. 2000, pp. 1-8.
21. M. Yang, Y. Li, and W. Ryan, "Design of efficiently encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun., vol. 52, no. 4, pp. 564-571, Apr. 2004.
22. Y. Zhang, W. Ryan, and Y. Li, "Structured eIRA codes with low floors," in Proc. IEEE International Symposium Inform. Theory, Sep. 2005, pp. 174-178.
23. G. Liva, E. Paolini, and M. Chiani, "Simple reconfigurable low-density parity-check codes," IEEE Commun. Lett., vol. 9, no. 3, pp. 258-260, Mar. 2005.
24. H. Xiao and A. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," IEEE Commun. Lett., vol. 8, no. 12, pp. 715-717, Dec. 2004.
25. Z. Chen and S. Bates, "Construction of low-density parity-check convolutional codes through progressive edge-growth," IEEE Commun. Lett., vol. 9, no. 12, pp. 1058-1060, Dec. 2005.
26. X. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
27. D. Divsalar, C. Jones, S. Dolinar, and J. Thorpe, "Protograph based LDPC codes with minimum distance linearly growing with block size," in Proc. IEEE Global Telecommun. Conf., vol. 3, Nov./Dec. 2005.
28. D. Divsalar, S. Dolinar, and C. Jones, "Low-rate LDPC codes with simple protograph structure," in Proc. IEEE International Symposium Inform. Theory, Sept. 2005, pp. 1622-1626.
29. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
30. S. Lin, H. Tang, and Y. Kou, "On a class of finite geometry low density parity check codes," in Proc. IEEE International Symposium Inform. Theory, June 2001.
31. G. A. Margulis, "Explicit constructions of graphs without short cycles and low density codes," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
32. D. MacKay and M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes Theoretical Computer Science, vol. 74, pp. 97-104, 2003.
33. D. MacKay, "Encyclopedia of sparse graph codes." Online. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/data.html