Skip to main content
Log in

Variable Global Optimization min-sum (VGOMS) algorithm of decode-and-forward protocol for the relay node in the cooperative channel

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The excessive delay due to the complexity of the decoding process at the relay node results in additional delays at the destination which is a significant issue in cooperative communication channels. A low complexity min-sum (MS) based algorithm called the Variable Global Optimization min-sum (VGOMS) algorithm has been developed to minimise the error corrective performance. The proposed VGOMS algorithm apply the optimization scaling factor at the bit node processing of the variable node operation which have significantly less complexity as compared with the check node operation or both variable node and check node operation. In this study, a straightforward Particle Swarm Optimization approach was used to determine the optimal scaling factor to obtain optimized error corrective performance of the algorithm. The proposed system model uses the channel combining large-scale and small-scale effects which used extensively in cooperative communications. The performance of the VGOMS algorithm performance was compared with four existing decoding algorithms (MS, OMS, NMS, SP) and was found better than the original min-sum (MS) in term of bit error rate (BER) performance and the first algorithm reach optimal BER in error floor region from 3 others existing decoding algorithm (MS, OMS, NMS) after Sum-Product (SP) algorithm. The VGOMS algorithm was therefore shown to have a significantly better compromise between the implementation of good error performance and low computational complexity.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Angarita, F., Valls, J., Almenar, V., & Torres, V. (2014). Reduced-complexity min-sum algorithm for decoding ldpc codes with low error-floor. IEEE Transactions on Circuits and Systems I: Regular Papers,61(7), 2150–2158.

    Article  Google Scholar 

  2. Chen, J., Member, S., Fossorier, M. P. C., & Member, S. (2002). Near optimum universal belief propagation based decoding of low-density parity check codes. IEEE Transactions on Communications,50(3), 406–414.

    Article  Google Scholar 

  3. Ullah, W., Tao, J., & Fengfan, Y. (2011) Two-way normalization of min-sum decoding algorithm for medium and short length low density parity check codes, pp. 2–6.

  4. Zhang, J., Fossorier, M., & Gu, D. (2006). Two-dimensional correction for min-sum decoding of irregular LDPC codes. IEEE Communications Letters,10(3), 180–182.

    Article  Google Scholar 

  5. Lechner, G., & Sayir, J. (2004). Improved sum-min decoding of LDPC codes, pp. 3–6.

  6. Emran, A. A., & Elsabrouty, M. (2014). Simplified variable-scaled min sum LDPC decoder for irregular LDPC codes. In Consum. Commun. Netw. Conf., pp. 526–531.

  7. Wang, C. L., Chen, X., Li, Z., & Yang, S. (2013). A simplified min-sum decoding algorithm for non-binary LDPC codes. IEEE Transactions on Communications,61(1), 24–32.

    Article  Google Scholar 

  8. Xu, Y., Member, S., Szczecinski, L., Member, S., & Rong, B. (2014). Variable LLR scaling in min-sum decoding for irregular LDPC codes. IEEE Transactions on Broadcasting,60(4), 606–613.

    Article  Google Scholar 

  9. Chen, J. C. J., & Fossorier, P. M. C. (2002). Density evolution for BP-based decoding algorithms of LDPC codes and their quantized versions. In Glob. Telecommun. Conf. 2002. GLOBECOM’02 (Vol. 2, no. 5, pp. 1378–1382). IEEE.

  10. Cheng, C. C., Yang, J. D., Lee, H. C., Yang, C. H., & Ueng, Y. L. (2014). A fully parallel LDPC decoder architecture using probabilistic min-sum algorithm for high-throughput applications. IEEE Transactions on Circuits and Systems I: Regular Papers,61(9), 2738–2746.

    Article  Google Scholar 

  11. Lechner, G. (2006). Improved sum-min decoding for irregular LDPC codes.

  12. Jung, Y., Jung, Y., Lee, S., & Kim, J. (2014). New min-sum LDPC decoding algorithm using SNR-considered adaptive scaling factors. Electronics and Telecommunications Research Institute Journal,36(4), 591–598.

    Google Scholar 

  13. Islam, M. R., Shafiullah, D. S., Mostafa, M., Faisal, A., & Rahman, I. (2012). Optimized min-sum decoding algorithm for low density parity check codes. In 14th International Conference on Advanced Communication Technology, Vol. 2, no. 12, pp. 168–174.

  14. Li, Y., Vucetic, B., Wong, T. F., Member, S., & Dohler, M. (2006). Distributed turbo coding with soft information relaying in multihop relay networks. IEEE Journal on Selected Areas in Communications,24(11), 2040–2050.

    Article  Google Scholar 

  15. Benjillali, M., & Szczecinski, L. (2009). A simple detect-and-forward scheme in fading channels. IEEE Communications Letters,13(5), 309–311.

    Article  Google Scholar 

  16. Wang, H., Ma, S., & Ng, T. (2011). “On performance of cooperative communication systems with spatial random relays. IEEE Transactions on Communications,59(4), 1190–1199.

    Article  Google Scholar 

  17. Like, P., & W. Communications. (2003). Wireless antennas—making wireless communications, pp. 47–73.

  18. Rappaport, T. S., et al. (1996). Wireless communications: principles and practice, Vol. 207, p. 736.

  19. Bansal, J. C., Singh, P. K., Saraswat, M., Verma, A., Jadon, S. S., & Abraham, A. (2011). Inertia weight strategies in particle swarm, pp. 640–647.

  20. Xu, M., Wu, J., & Zhang, M. (2010). A modified offset min-sum decoding algorithm for LDPC codes. In 2010 3rd International Conference on Computer Science and Information Technology, November, pp. 19–22.

Download references

Acknowledgements

Jamaah suud would like to acknowledge the Ministry of Higher Education Malaysia (MoHE) for their financial support through the HLP Ph.D. scholarship scheme.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jamaah Suud.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Suud, J., Zen, H., Othman, AK. et al. Variable Global Optimization min-sum (VGOMS) algorithm of decode-and-forward protocol for the relay node in the cooperative channel. Wireless Netw 26, 531–541 (2020). https://doi.org/10.1007/s11276-019-02159-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-019-02159-4

Keywords

Navigation