Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Study on the distribution law of random code structure of irregular LDPC codes and its application in eliminating short cycles

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

The distribution law of the random code structure of randomly constructed irregular low-density parity-check (LDPC) codes is studied. Based on the Progressive Edge-Growth (PEG) algorithm, a new algorithm which can both eliminate short cycles and keep the distribution of the random code structure is presented. The experimental results show that the performance of the irregular LDPC codes constructed by the new algorithm is superior to that of the PEG algorithm.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Richardson T, Shokrollahi A, Urbanke R. Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans Inform Theory, 2001, 47(2): 619–637

    Article  MATH  MathSciNet  Google Scholar 

  2. Hu X, Eleftheriou E, Arnold D M. Progressive Edge-grown tanner graphs. In: Proceedings of IEEE Globe Com. Texas, USA: IEEE, 2001, 995–2001

    Google Scholar 

  3. Richardson T, Urbanke R. The renaissance of Gallager’s low-density parity-check codes. IEEE Commun Mag, 2003, 41(8): 126–131

    Article  Google Scholar 

  4. Tian T, Jones C, Villasenor J, et al. Construction of irregular LDPC codes with low error floors. In: Proceedings of IEEE International Conference on Communications, Anchorage, AK, USA: IEEE, 2003, 3125–3129

    Google Scholar 

  5. Oswald P, Shokrollahi A. Capacity-achieving sequences for the erasure channel. IEEE Trans Inform Theory, 2002, 48(12): 3017–3028

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an, 710071, China

    Ma LinHua & Chang YiLin

  2. Aeronautical Electronics Engineering Department, Air Force Engineering University, Engineering Institute, Xi’an, 710038, China

    Ma LinHua & Wang ShengDa

Authors
  1. Ma LinHua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chang YiLin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wang ShengDa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ma LinHua.

Additional information

Supported by the National Natural Science Foundation of China (Grant No. 60172030), Huawei Science Foundation, and Xidian ISN National Key Laboratory

About this article

Cite this article

Ma, L., Chang, Y. & Wang, S. Study on the distribution law of random code structure of irregular LDPC codes and its application in eliminating short cycles. SCI CHINA SER F 50, 99–104 (2007). https://doi.org/10.1007/s11432-007-0003-z

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-007-0003-z

Keywords

Search

Navigation