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

• Main Authors: Hushairi, Zen, Jamaah, Suut, Al-Khalid, Bin Hj Othman, Khairuddin, Bin Ab Hamid
• Format: Article
• Language: English
• Published: Springer Nature 2019
• Subjects: T Technology (General); TK Electrical engineering. Electronics Nuclear engineering
• Online Access: http://ir.unimas.my/id/eprint/27715/1/Variable%20Global%20Optimization%20min-sum%20%28VGOMS%29%20algorithm%20of%20decodeand-forward%20protocol%20for%20the%20relay%20node%20-%20Copy.pdf; http://ir.unimas.my/id/eprint/27715/; https://link.springer.com/article/10.1007/s11276-019-02159-4

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.