The Operational Complexity Reduction Algorithm for Single Relay Wireless Cooperative Network

Abstract

High operational complexity and computational time degrades the performance of already existing Amplify-and-Forward (AF) based two time slots algorithms in the literature, used for cooperative networks, and has several issues related to bit error rate, computation time etc. Consequently, the Operational Complexity Reduction Algorithm (OCRA) for single relay cooperative network has been proposed. The error probability of bits received is derived using the harmonic and geometric means, initial value theorem, and probability density function at zero. Moreover, the proposed algorithm is evaluated with the previous proposed algorithm. The OCRA demonstrated low Bit Error Rate (BER) and high BER-Gain values, with the increase in SNR values, at particular fading conditions. The proposed algorithm demonstrated less computational time and low operational complexity, as compared to previous proposed algorithm.