Skip to main content
SpringerLink
Log in

Low Complexity Decoding Scheme for LDPC Codes Based on Belief Propagation Algorithm

  • Conference paper
  • First Online:
Wireless and Satellite Systems (WiSATS 2019)

Included in the following conference series:

  • 1538 Accesses

Abstract

The low-density parity check codes (LDPC codes) are block codes whose performances are close to the Shannon limit. LDPC codes have the strong ability for error correction. The decoding algorithm of LDPC codes has a great influence on their performances. The belief propagation (BP) algorithm is a commonly used soft decision decoding algorithm. The algorithm decodes by information iterations, and its complexity does not increase rapidly with the increase of code length. This paper mainly analyze the probabilistic domain BP decoding algorithm, log-domain BP decoding algorithm and minimum sum decoding algorithm, the bit error performance of LDPC codes under BP algorithm is studied, and the influence of the number of iterations on the BP decoding algorithm is also shown by simulation results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory, IT-18, 21–28 (1962)

    Article  MathSciNet  Google Scholar 

  2. MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 32(18), 1645–1646 (1996)

    Article  Google Scholar 

  3. Richardson, T.J., Shokrollahi, M.A., Urbanke, R.: Design of capacity-approaching irregular low-densityparity-check codes. IEEE Trans. Inf. Theory 47, 619–637 (2001)

    Article  Google Scholar 

  4. Hu, X.-Y., Eleftheriou, E., Arnold, D.-M.: Regular and irregular progressive edge-growth tanner graphs. IEEE Trans. Inform. Theory 51, 386–98 (2005)

    Article  MathSciNet  Google Scholar 

  5. Prompakdee, P., Phakphisut, W., Supnithi, P.: Quasi cyclic-LDPC codes based on PEG algorithm with maximized girth property. In: IEEE International Symposium on Intelligent Signal Processing and Communications Systems, pp. 1–4 (2012)

    Google Scholar 

  6. Fossorier, M.P.C., Mihaljevic, M., Imai, I.: Reduced complexity iterative decoding of low density parity check codes based on belief propagation. IEEE Trans. Commun. 47, 673–680 (1999)

    Article  Google Scholar 

  7. Ning, H., Hua, Q.: Research of LDPC decoding based on modified LLR BP algorithm. J. Southwest Univ. (Nat. Sci. Ed.) 119–124 (2009)

    Google Scholar 

  8. Jia, H.: Principle and Application of LDPC, 1st edn. People’s Posts and Telecommunications Press, Beijing (2009)

    Google Scholar 

Download references

Acknowledgments

This work was supported by National Natural Science Foundation of China (NSFC) (61671184).

Author information

Authors and Affiliations

  1. Communication Research Center, Harbin Institute of Technology, Harbin, China

    Wenshuo Zhang, Liming Zheng, Yue Wu, Gang Wang & Aijun Liu

Authors
  1. Wenshuo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liming Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yue Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Aijun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yue Wu .

Editor information

Editors and Affiliations

  1. Harbin Institute of Technology, Harbin, China

    Min Jia

  2. Harbin Institute of Technology, Harbin, China

    Qing Guo

  3. Harbin Institute of Technology, Harbin, China

    Weixiao Meng

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, W., Zheng, L., Wu, Y., Wang, G., Liu, A. (2019). Low Complexity Decoding Scheme for LDPC Codes Based on Belief Propagation Algorithm. In: Jia, M., Guo, Q., Meng, W. (eds) Wireless and Satellite Systems. WiSATS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 280. Springer, Cham. https://doi.org/10.1007/978-3-030-19153-5_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19153-5_71

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19152-8

  • Online ISBN: 978-3-030-19153-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation