Skip to main content

Concatenated-Code Belief Propagation Decoding for High-Order LDPC Coded Modulations

  • Conference paper
  • First Online:
The Proceedings of the Second International Conference on Communications, Signal Processing, and Systems

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 246))

Abstract

This paper presents and demonstrates a concatenated code model (CCM) for high order, low-density parity-check (LDPC) coded modulation, which consists of a serial concatenation of an outer LDPC encoder, an inner binary-decimal conversion (BDC) encoder and a puncture. A corresponding concatenated-code belief propagation (CCBP) decoding algorithm is derived for the proposed concatenated code. Compared to other algorithms, CCBP method provides a much more excellent parallel decoding process for high order modulations. Simulation results show that the proposed CCBP algorithm performs superior to conventional belief propagation (BP) decoding within a wide range of modulation orders.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. MacKay DJC, Neal RM (1996) Near Shannon limit performance of low-density parity-check codes. Electron Lett 32:1645. doi:10.1049/el:19961141

    Article  Google Scholar 

  2. Bennatan A, Burshtein D (2006) Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels. IEEE T Inform Theory 52:549–583. doi:10.1109/TIT.2005.862080

    Article  MathSciNet  Google Scholar 

  3. Wachsmann U, Fischer RFH, Huber JB (1999) Multilevel codes: theoretical concepts and practical design rules. IEEE T Inform Theory 45:1361–1391. doi:10.1109/18.771140

    Article  MATH  MathSciNet  Google Scholar 

  4. Caire G, Taricco G, Biglieri E (1998) Bit interleaved coded modulation. IEEE T Inform Theory 44:927–946. doi:10.1109/18.669123

    Article  MATH  MathSciNet  Google Scholar 

  5. Proakis JG (2001) Digital communications, 4th edn. McGraw-Hill, Boston, MA

    Google Scholar 

  6. Tanner RM (1981) A recursive approach to low complexity codes. IEEE T Inform Theory IT-27:533–547. doi:10.1109/TIT.1981.1056404

    Article  MathSciNet  Google Scholar 

  7. Wiberg N (1996) Codes and decoding on general graphs. Dissertation, Linköping University

    Google Scholar 

  8. MacKay DJC (1999) Good error-correcting codes based on very sparse matrices. IEEE T Inform Theory 45:399–431. doi:10.1109/18.748992

    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

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, H., Zhu, G., Jiang, H. (2014). Concatenated-Code Belief Propagation Decoding for High-Order LDPC Coded Modulations. In: Zhang, B., Mu, J., Wang, W., Liang, Q., Pi, Y. (eds) The Proceedings of the Second International Conference on Communications, Signal Processing, and Systems. Lecture Notes in Electrical Engineering, vol 246. Springer, Cham. https://doi.org/10.1007/978-3-319-00536-2_88

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-00536-2_88

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-00535-5

  • Online ISBN: 978-3-319-00536-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics