Skip to main content

An Improved Hybrid Offset-Based Min-Sum Decoding Algorithm

  • Conference paper
  • First Online:
Information and Communication Technology for Competitive Strategies

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 40))

  • 1093 Accesses

Abstract

In this work, a new hybrid approach based on offset min-sum decoding algorithm is proposed for decoding irregular low-density parity-check (LDPC) codes. In the proposed algorithm, incorporations are made in both the nodes of the Tanner graph with varying error correcting factors. In addition, to the error correcting factors, an adaptive weighting factors are utilized in CNU and VNU process to mitigate the numerical instabilities and negative correlation effects. These modifications in turn enhance the error correcting performance, which ultimately results in a better decoding efficiency. Through exhaustive simulation and comparison, it is shown that the proposed algorithm with a six-bit non-uniform quantization scheme exhibits good error correcting outcome at BER of 10−5 with an acceptable computational complexity.

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. Richardson, T., Shokrollahi, A., Urbanke, R.: Design of capacity approaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory 47(2), 619–637 (2001)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. Fossorier, M., Mihalijevic, M., Imai, H.: Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation. IEEE Trans. Commun. 47(5), 673–680 (1999)

    Article  Google Scholar 

  4. Xue, W., Ban, T., Wang, J.: A modified normalized min-sum algorithm for LDPC decoding using order statistics. Int. J. Satell. Commun. Netw. (Wiley) 35(2), 163–175 (2017)

    Article  Google Scholar 

  5. Cho, K., Chung, K.-S.: Self-adaptive termination check of min-sum algorithm for LDPC decoders using the first two minima. KSII Trans. Internet Inf. Syst. 11(4), 1987–2001 (2017)

    Google Scholar 

  6. Cho, K., Chung, K.-S.: Simplified 2-dimensional scaled min-sum algorithm for LDPC decoder. J. Electr. Eng. Technol. (JEET) 12(1), 1921-718 (2017)

    Google Scholar 

  7. Wang, X., Cao, W., Li, J., Shan, L., Cao, H., Li, J., Qian, F.: Improved min-sum algorithm based on density evolution for low-density parity check codes. IET Commun. 11(10), 1582–1586 (2017)

    Article  Google Scholar 

  8. Roberts, M.K., Jayabalan, R.: A modified optimally quantized offset min-sum decoding algorithm for low-complexity LDPC decoder. Wirel. Pers. Commun. J. 80(2), 561–570 (2015)

    Google Scholar 

  9. Chen, J., Fossorier, M.P.C.: Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Commun. Lett. 6(5), 208–210 (2002)

    Google Scholar 

Download references

Acknowledgements

This research work is funded by the Department of Science and Technology, Government of India through Early Career Research Award (Young Scientist) scheme of Science and Engineering Research Board (SERB) (Grant no. ECR/2016/001275).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michaelraj Kingston Roberts .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Roberts, M.K., Sunny, E. (2019). An Improved Hybrid Offset-Based Min-Sum Decoding Algorithm. In: Fong, S., Akashe, S., Mahalle, P. (eds) Information and Communication Technology for Competitive Strategies. Lecture Notes in Networks and Systems, vol 40. Springer, Singapore. https://doi.org/10.1007/978-981-13-0586-3_70

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0586-3_70

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0585-6

  • Online ISBN: 978-981-13-0586-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics