Advertisement

On Estimation of the Error Exponent for Finite Length Regular Graph-Based LDPC Codes

  • P. S. RybinEmail author
  • F. I. IvanovEmail author
DATA TRANSMISSION IN COMPUTER NETWORKS
  • 13 Downloads

Abstract

The error exponent of the regular graph-based binary low-density parity-check (LDPC) codes under the maximum likelihood (ML) decoding algorithm in the binary symmetric channel (BSC) is analyzed. Unlike most other papers where error exponents are considered for the case when the length of LDPC codes tends to infinity (asymptotic analysis), the finite length case (finite length analysis) is considered. In this paper, a method of deriving the lower bound on the error exponent for a regular graph-based LDPC code with finite length under ML decoding is described. Also we analyze Dependences of the error exponent on various LDPC code parameters are also analyzed. The numerical results obtained for the considered lower bound are represented and analyzed at the end of the paper.

Keywords:

LDPC code error exponent finite length 

Notes

ACKNOWLEDGMENTS

This study was carried out at the Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, and was supported by the Russian Science Foundation, project no. 14-50-00150.

REFERENCES

  1. 1.
    R. G. Gallager, Low-Density Parity-Check Codes (MIT Press, Cambridge, MA, USA, 1963).zbMATHGoogle Scholar
  2. 2.
    O. Barak and D. Burshtein, “Lower bounds on the error rate of LDPC code ensembles,” IEEE Trans. Inf. Theory 53, 4225–4236 (2007).MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    D. Burshtein and O. Barak, “Upper bounds on the error exponents of LDPC code ensembles,” in Proc. 2006 IEEE Int. Symp. on Information Theory (ISIT), Seattle, USA, 2006 (IEEE, New York, 2006), pp. 401–405.Google Scholar
  4. 4.
    R. G. Gallager, Information Theory and Reliable Communication (Wiley, New York, 1968).zbMATHGoogle Scholar
  5. 5.
    M. Rahim, K. D. Nguyen, and G. Lechner, “Finite length analysis of LDPC codes,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), Istambul, Turkey, 2014 (IEEE, New York, 2014), pp. 206–211.Google Scholar
  6. 6.
    C. D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, “Finite-length analysis of low-density parity-check codes on the binary erasure channel,” IEEE Trans. Inf. Theory 48, 1570–1579 (2002).MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    T. J. Richardson and R. L. Urbanke, “Finite-length density evolution and the distribution of the number of iterations on the binary erasure channel,” Unpublished manuscript, available at http://lthcwww.epfl.ch/papers/ RiU02.psi.Google Scholar
  8. 8.
    H. Zhang and A. Orlitsky, “Finite-length analysis of LDPC codes with large left degrees,” in Proc. Int. Symp.on Inf. Theory (ISIT), Lausanne, Switzerland, June 30–July 5, 2002 (IEEE, New York, 2002), p. 3.Google Scholar
  9. 9.
    S. J. Johnson, “A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel,” IEEE Trans Inf. Theory 55, 27–32 (2009).MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    D. Burshtein and G. Miller, “Asymptotic enumeration methods for analyzing LDPC codes,” IEEE Trans. Inf. Theory 50, 1115–1131 (2004).MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    P. S. Rybin, “On the error-correcting capabilities of low-complexity decoded irregular LDPC codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Hawaii, USA, 2014 (IEEE, New York, 2014), pp. 3165–3169.Google Scholar
  12. 12.
    R. Tanner, “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory 27, 533–547 (1981).MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    H. S. Wilf, Generatingfunctionology (Academic, USA, 1992).zbMATHGoogle Scholar
  14. 14.
    E. L. Blokh and V. V. Zyablov, Linear Concatenated Codes (Nauka, Moscow, 1982) [in Russian].zbMATHGoogle Scholar
  15. 15.
    Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inf. Theory 56, 2307–2359 (2010).MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2018

Authors and Affiliations

  1. 1.Kharkevich Institute for Information Transmission Problems, Russian Academy of SciencesMoscowRussia
  2. 2.National Research University Higher School of EconomicsMoscowRussia

Personalised recommendations