Skip to main content

Improved BP-Based Decoding Algorithms Integrated with GA for LDPC Codes

  • Conference paper
Fuzzy Information and Engineering Volume 2

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 62))

  • 1015 Accesses

Abstract

We proposed two improved decoding algorithms for Low-Density Parity-Check (LDPC) codes based on the Belief-Propagation (BP) algorithm combined with Genetic Algorithm (GA). After giving a genetic interpretation of Tanner graph, GA is adopted to efficiently use the information passing from the variable nodes to the check nodes. Simulation results assert the superiority of our proposed algorithms over the BP algorithm both in BER (Bit Error Rate) and FER (Frame Error Rate). At last, optimization of the key parameter of the developed algorithms is given.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    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. Chung, S.-Y., Forney, J.G.D., Richardson, T., et al.: On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun. Lett. 5, 58–60 (2001)

    Article  Google Scholar 

  4. Papaharalabos, S., Papaleo, M., Mathiopoulos, P.T., et al.: DVB-S2 LDPC Decoding Using Robust Check Node Update Approximations. IEEE Transactions on Broadcasting 54(1), 120–126 (2008)

    Article  Google Scholar 

  5. Ye, Y., Liu, X., Cho, H.: An Energy-Efficient Single-Hop Wireless Sensor Network Using Repeat-Accumulate Codes. In: Proc. of ICCCAS 2008, pp. 472–476.

    Google Scholar 

  6. Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory 27(5), 533–547 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Holland, J.H.: Adaptation in Nature and Artificial System. MIT Press, Cambridge (1992)

    Google Scholar 

  8. Ku, M.-K., Li, H.-S., Chien, Y.-H.: Code design and decoder implementation of low density parity check code. In: Emerging Information Technology Conference, San Diego, California (2005)

    Google Scholar 

  9. Scandurra, A.G., Dai Pra, A.L., Arnone, L., et al.: A genetic-algorithm based decoder for low density parity check codes. Lat. Am. Appl. Res. 36(3), 169–172 (2006)

    Google Scholar 

  10. MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory 45, 399–431 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deng, Zr., Liu, Xc. (2009). Improved BP-Based Decoding Algorithms Integrated with GA for LDPC Codes. In: Cao, B., Li, TF., Zhang, CY. (eds) Fuzzy Information and Engineering Volume 2. Advances in Intelligent and Soft Computing, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03664-4_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03664-4_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03663-7

  • Online ISBN: 978-3-642-03664-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics