Skip to main content
SpringerLink
Log in

On the Burst Erasure Efficiency of Array LDPC Codes

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper a family of LDPC codes based on the shortened and superposed array LDPC codes is proposed for burst erasure channels. The design of constructions is based on identifying and analyzing cycles corresponding to consecutive columns in parity check matrices. The burst erasure capability of the codes, represented by \(L_{max}\), can be determined by finding such cycles. Our constructions are categorized into four classes that one of them is a burstMDS code with efficiency equal to 1. By considering a single burst erasure-correcting over burst erasure channels, the simulation results show that our constructed codes can be competed with well-known LDPC codes in comparable rates, lengths and efficiencies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Richardson, T. J., & Urbanke, R. L. (2001). Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory, 47(2), 619–637.

    Article  MathSciNet  MATH  Google Scholar 

  2. Chilappagari, S. K., Nguyen, D. V., Vasic, B., & Marcellin, M. W. (2010). On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes. IEEE Transactions on Information Theory, 56(4), 1600–1611.

    Article  MathSciNet  Google Scholar 

  3. Hosoya, G., Yagi, H., Matsushima, T., & Hirasawa, S. (2006). A modification method for constructing low-density parity-check codes for burst erasures. IEICE transactions on fundamentals of electronics, communications and computer sciences, E89–A(10), 2501–2509.

    Article  Google Scholar 

  4. Di, C., Proietti, D., Telatar, I. E., Richardson, T. J., & Urbanke, R. L. (2002). Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Transactions on Information Theory, 48(6), 1570–1579.

    Article  MathSciNet  Google Scholar 

  5. Johanson, S. (2009). Burst erasure correcting LDPC codes. IEEE Transactions on Communication, 57(3), 641–652.

    Article  Google Scholar 

  6. Esmaeili, M., Tadayon, M. H., & Gulliver, T. A. (2011). More on the stopping and minimum distances of array codes. IEEE Transactions on Communication, 59(3), 750–757.

    Article  Google Scholar 

  7. Esmaeili, M., & Amoshahi, M. J. (2009). On the stopping distance of array code parity-check matrices. IEEE Transactions on Information Theory, 55(8), 3488–3493.

    Article  Google Scholar 

  8. Yang, M., & Ryan, W. E. (2004). Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel. IEEE Transactions on Magnetics, 40(2), 507–512.

    Article  Google Scholar 

  9. Paolini, E., & Chiani, M. (2009). Construction of near-optimum burst erasure correcting low-density parity-check codes. IEEE Transactions on Communications, 57(5), 1320–1328.

    Article  MATH  Google Scholar 

  10. Tai, Y., Zeng, L., Lan, L., Song, S., Lin, S., & Abdel-Ghaffar, K. (2006). Hybrid burst erasure correction of LDPC codes. IEEE Transactions on Communications, 54(10), 1765–1774.

    Article  Google Scholar 

  11. Li, K., Kavcic, A., & Erden, M.F. (2010). Construction of burst-erasure efficient LDPC codes for use with belief propagation decoding. In Proceedings of communications ICC, pp. 1–5

  12. Yang, M., & Ryan, W. E. (2002). Design of ldpc codes for two-state fading channel models. In Proceedings 5th international symposim. Wireless personal multimedia communications, pp. 193–197

  13. Song, H., & Cruz, J. R. (2003). Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording. IEEE Transactions on Magnetics, 39(2), 1081–1087.

    Article  Google Scholar 

  14. Fong, W. H., Huang, Q., Chang, S.-C., & Lin, S. (2011). Multiple phased-burst correcting superposition product LDPC codes. In Proceedings communications ICC, pp. 1–5

  15. Fan, J.L. (2000). Array codes as low-density parity-check codes. In 2nd international symposium turbo codes and related topics, Brest, France, pp. 553–556.

  16. Esmaeili, M., & Tadayon, M. H. (2008). A novel approach to generating long low-density parity-check codes using two configurations. IET Communications, 2(4), 587–597.

    Article  MathSciNet  MATH  Google Scholar 

  17. Fossorier, M. (2009). Hybrid burst erasure correction of LDPC codes. IEEE Transactions on Communications, 60(4), 260–261.

    Google Scholar 

  18. Esmaeili, M., & Tadayon, M. H. (2009). A lattice-based systematic recursive construction of quasi-cyclic LDPC codes. IEEE Transactions on Information Theory, 57(10), 2857–2863.

    Google Scholar 

  19. Dolecek, L., Zhang, Z., Anantharam, V., Wainwright, M., & Nikolic, B. (2010). Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. IEEE Transactions on Information Theory, 56(1), 181–202.

    Article  MathSciNet  Google Scholar 

  20. Milenkovic, O., Kashyap, N., & Leyba, D. (2006). Shortened array codes of large girth. IEEE Transactions on Information Theory, 52(8), 3707–3722.

    Article  MathSciNet  Google Scholar 

  21. Forney, G. D. (1971). Burst-correcting codes for the classic bursty channel. IEEE Transactions on Communications, 19(5), 772–781.

    Article  Google Scholar 

  22. Tian, T., Jones, C., Villasenor, J., & Wesel, R. (2003). Construction of irregular LDPC codes with low error floors. In Proceedings IEEE international conference on communications Vol. 5, pp. 3125–3129.

Download references

Author information

Authors and Affiliations

  1. Iran Telecommunication Research Center (ITRC), Tehran, Iran

    Mohammad Hesam Tadayon

  2. Department of Informatics, University of Bergen, Bergen, Norway

    Asieh Abolpour Mofrad

  3. Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

    Zahra Ferdosi

Authors
  1. Mohammad Hesam Tadayon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asieh Abolpour Mofrad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zahra Ferdosi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Hesam Tadayon.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tadayon, M.H., Abolpour Mofrad, A. & Ferdosi, Z. On the Burst Erasure Efficiency of Array LDPC Codes. Wireless Pers Commun 83, 1313–1329 (2015). https://doi.org/10.1007/s11277-015-2451-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2451-x

Keywords

Search

Navigation