Skip to main content

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

Abstract

In this paper, we present a partial-parallel decoder architecture based on Min–Max algorithm for quasi-cyclic non-binary LDPC codes. An efficient architecture of the check node elementary processor is designed. The variable node update unit with fully parallel computation is proposed, which has the advantage of low complexity and latency by eliminating forward–backward operation and removing recursive computation among the message vector. Moreover, the FPGA simulation over GF(16) NB-LDPC is given to demonstrate the efficiency of the presented design scheme.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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. Gallager RG (1963) Low-density parity-check codes. MIT Press, Cambridge

    Google Scholar 

  2. Richardson TJ, Shokrollahi MA, Urbanke RL (2001) Design of capacity-approaching low-density parity check codes. IEEE Trans Inf Theor 47:619–637

    Article  MathSciNet  MATH  Google Scholar 

  3. Davey M, MacKay DJC (1998) Low density parity check codes over GF(q). IEEE Comm Lett 2:165–167

    Google Scholar 

  4. Zhou B, Kang J, Song S, Lin S, Abdel-Ghaffar K (2009) Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions. IEEE Trans Comm 57(10):1652–1662

    Google Scholar 

  5. Song H, Cruz JR (2003) Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording. IEEE Trans Magn 39:1081–1087

    Article  Google Scholar 

  6. Wymeersch H, Steendam H, Moeneclaey M (2004) Log-domain decoding of LDPC codes over GF(q). In: The proceedings of IEEE internaional conference on communication, Paris, France, pp 772–776

    Google Scholar 

  7. Declercq D, Fossorier M (2007) Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans Comm 55:633–643

    Google Scholar 

  8. Valentin Savin and CEA-LETI, Min-Max decoding for non binary LDPC codes. IEEE international conference on ISIT2008, p 960

    Google Scholar 

  9. Zhang X, Cai F (2010) Partial-parallel deccoder architecture for quasi-cyclic non-binary LDPC codes. IEEE international conference on communication, Cleveland, USA, p 1506

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leilei Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, L., Liu, F., Li, H. (2013). Min–Max Decoding for Non-Binary LDPC Codes. In: Lu, W., Cai, G., Liu, W., Xing, W. (eds) Proceedings of the 2012 International Conference on Information Technology and Software Engineering. Lecture Notes in Electrical Engineering, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34528-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34528-9_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34527-2

  • Online ISBN: 978-3-642-34528-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics