<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">CS</journal-id><journal-title-group><journal-title>Circuits and Systems</journal-title></journal-title-group><issn pub-type="epub">2153-1285</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/cs.2016.78153</article-id><article-id pub-id-type="publisher-id">CS-67508</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Modified Cooperative Subchannel Allocation Algorithms and PSO Based Power Allocation for an Alamouti Decode and Forward Relaying Protocol in Multiuser OFDMA Systems
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>K.</surname><given-names>Shoukath Ali</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>P.</surname><given-names>Sampath</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of ECE, Bannari Amman Institute of Technology, Sathyamangalam, India</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>shoukathali@bitsathy.ac.in(KSA)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>02</day><month>06</month><year>2016</year></pub-date><volume>07</volume><issue>08</issue><fpage>1769</fpage><lpage>1786</lpage><history><date date-type="received"><day>21</day>	<month>March</month>	<year>2016</year></date><date date-type="rev-recd"><day>accepted</day>	<month>15</month>	<year>April</year>	</date><date date-type="accepted"><day>20</day>	<month>June</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  The present work is a discussion on the performance analysis of Modified Cooperative Subchannel Allocation (CSA) Algorithms which is used in Alamouti Decoded and Forward (Alamouti DF) Relaying Protocol for wireless multi-user Orthogonal Frequency Division Multiplexing Access (OFDMA) systems. In addition, the performance of approximate Symbol Error Rate (SER) for the Alamouti DF Relaying Protocol with the Cooperative Maximum Ratio Combining Technique (C-MRC)
   
  is analyzed and compared with SER upper bound. The approximate SER is asymptotically tight bound at higher Signal-to-Noise Ratio (SNR). From the asymptotic tight bound approximate SER, Particle Swarm Optimization (PSO) based Power Allocation (PA) is determined for the Alamouti DF Relaying Protocol. The simulation results suggested that the Modified Throughput based Subchannel Allocation Algorithm achieved an improved throughput of 6% to 33% compared to that of existing cooperative diversity protocol. Further, the Modified Fairness based Subchannel Allocation Algorithm rendered fairness of 7.2% to 17% among the multiuser against the existing cooperative diversity protocol.
 
</p></abstract><kwd-group><kwd>Amplify-and-Forward</kwd><kwd> Decode-and-Forward</kwd><kwd> Cooperative Relay</kwd><kwd> Maximal Ratio Combining</kwd><kwd> Symbol Error Rate</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The random fading nature of the wireless communication channel has attracted many researchers to propose novel techniques to raise the cooperative diversity order [<xref ref-type="bibr" rid="scirp.67508-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref2">2</xref>] . To arrive at the diversity gain, a cooperative technique in combination with relaying terminal is used [<xref ref-type="bibr" rid="scirp.67508-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref4">4</xref>] . Of the several known methods of communication using a MIMO system, Alamouti coding scheme is the well characterized approach to adopt the high speed and consistent wireless communication system. Improved bit error rate as well as high data rate can be achieved by exploiting diversity gain in the spatial domain [<xref ref-type="bibr" rid="scirp.67508-ref5">5</xref>] - [<xref ref-type="bibr" rid="scirp.67508-ref7">7</xref>] . In wireless communication systems, the Cooperative relaying protocol promises a considerable capacity and increased multiplexing gain [<xref ref-type="bibr" rid="scirp.67508-ref8">8</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref9">9</xref>] . Cooperative communication is mainly classified into two relaying protocol: Amplify-and-Forward (AF) Relaying Protocol and Decode-and-Forward (DF) Relaying Protocol. AF Relaying Protocol amplifies the Relay Station (RS) information which is received from the Base Station (BS) and is retransmitted to the Mobile Station (MS). The pros of the AF Relaying Protocol are its low cost implementation and simplicity. However, the drawback of the above relaying protocol is that the noise also gets amplified at the RS. In contrast to AF Relaying Protocol, DF Relaying Protocol decodes the RS information received from the BS and then retransmits the re-encoded information to the MS. The signal received from the BS and RS at the MS will be combined using a Maximal Combining Ratio (MRC) technique [<xref ref-type="bibr" rid="scirp.67508-ref10">10</xref>] . Unlike AF Relaying Protocol, the noise is rectified and hence, the DF Relaying Protocol usually shows a better transmission performance than the AF Relaying Protocol.</p><p>Previously, it has been reported that the performance analysis of SER upper-bound for Alamouti-coded DF Relaying Protocol used the C-MRC technique along with an optimum PA [<xref ref-type="bibr" rid="scirp.67508-ref11">11</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref12">12</xref>] . The concept that the equal PA and PSO PA do not depend on weighting factor W, has not been discussed in [<xref ref-type="bibr" rid="scirp.67508-ref13">13</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref14">14</xref>] . The C-MRC signal combining technique introduces a weighting factor, and it can be considered by value of the channel. The C- MRC technique guarantees the enhance throughput of the system and maximum SNR.</p><p>In this paper, the performance of approximate SER for the Alamouti DF Relaying Protocol using C-MRC is analyzed, and compared with SER upper bound. In this, the approximate SER is asymptotically tight bound at higher SNR. From the asymptotic tight bound approximate SER, PSO based PA is determined for the Alamouti DF Relaying Protocol. The link between base station and mobile station contributes diversity order one in the system performance, and also depends on the balance of the two channel links from the base station to the relay station and from the relay station to the mobile station. Therefore, the Alamouti DF Relaying Protocol for wireless systems shows an overall performance of diversity orders two.</p><p>To achieve high data rates in mobile communication environment, OFDM is a hopeful method because of its multicarrier modulation technique [<xref ref-type="bibr" rid="scirp.67508-ref15">15</xref>] - [<xref ref-type="bibr" rid="scirp.67508-ref17">17</xref>] . In the selected literatures, downlink of non cooperative multi-users OFDMA systems is described using the dynamic Resource Allocation Algorithms (RAA) and optimization techniques. The aim of the RAA is either to achieve the constrained total transmits power with highest throughput and the minimum total transmitted power with constrained throughput [<xref ref-type="bibr" rid="scirp.67508-ref18">18</xref>] - [<xref ref-type="bibr" rid="scirp.67508-ref22">22</xref>] . Cooperative subcarrier allocation for AF Relaying Protocol gives the increased throughput and fairness among the multi-user OFDMA systems. Cooperative subcarrier allocation for AF Relaying Protocol is used EPA, which does not provide enhanced throughput and optimized power to wireless systems. The MS is combined with the signal that is received from the BS and RS using MRC technique. Though, there exist limitations in MRC technique cannot assure the maximum SNR and improved throughput as mentioned in [<xref ref-type="bibr" rid="scirp.67508-ref23">23</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref24">24</xref>] .</p><p>In addition, in this paper the performance analysis of proposed modified CSA Algorithms used in Alamouti DF Relaying Protocol for wireless multi-user OFDMA systems so as to achieve increased throughput than the existing relaying protocols. The modified CSA Algorithms used in Alamouti DF Relaying for PSO based PA gives the enhanced throughput and optimized wireless systems.</p><p>The rest of this paper is organized as the following: in Section 2, received signal model is described. Performance analysis of Alamouti DF Relaying Protocol is discussed in Section 3. In Section 4, Modified Cooperative Subchannel Allocation for an Alamouti DF Relaying Protocol is presented. The simulation results are discussed in Section 5 and Section 6 concludes this research work.</p></sec><sec id="s2"><title>2. Received Signal Model</title><p>In this paper, system model consist of one BS, two RS and one MS for an Alamouti DF Relaying Protocol in wireless multi-user OFDMA systems is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> [<xref ref-type="bibr" rid="scirp.67508-ref11">11</xref>] .</p><p>Orthogonal Space Time Block Codes (OSTBC) is using multiple transmit and receive antenna, which gives</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> System model for cooperative relaying protocols</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x6.png"/></fig><p>full data rate and full diversity gain to the system. Alamouti scheme is used to enhance the quality of the channel in the received signal. The encoder transmit matrix takes two modulated symbol <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x7.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x8.png" xlink:type="simple"/></inline-formula> at a time. This is described as,</p><disp-formula id="scirp.67508-formula68"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x9.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x10.png" xlink:type="simple"/></inline-formula> complex conjugate of X. It is clear that the encoding process is done in both space and time domain [<xref ref-type="bibr" rid="scirp.67508-ref25">25</xref>] . The TDMA transmission for Alamouti DF Relaying Protocol is divided into four phases and it is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. In phase 1, BS is transmitting its information to selected RS by optimum relay selection technique. In phase 2, the transmitted information from BS is decoded using selective RS then forwarded to MS based on Alamouti scheme. Similarly, the process carried out in phase 3 and 4 is same as phase 1 and 2 respectively.</p><p>In phase 1, the BS is transmitting information to RS and MS. Let us consider, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x11.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x12.png" xlink:type="simple"/></inline-formula>are the received signals at RS and MS respectively. Then, it is described as follows:</p><disp-formula id="scirp.67508-formula69"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x13.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula70"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x14.png"  xlink:type="simple"/></disp-formula><p>In phase 2, the MS receives information from RS and BS is gives as,</p><disp-formula id="scirp.67508-formula71"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x15.png"  xlink:type="simple"/></disp-formula><p>Assume, the BS is transmitting a symbol <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x16.png" xlink:type="simple"/></inline-formula> to MS and RS with transmitting power of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x17.png" xlink:type="simple"/></inline-formula> in phase1. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x18.png" xlink:type="simple"/></inline-formula>is the received signal in phase 2, in which the BS are transmitting a symbol <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x19.png" xlink:type="simple"/></inline-formula> and the RS is able to decodes the correct symbol and forwards the decoded symbol <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula> to MS with transmitting power of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula> respectively. Similarly, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula> are the received signals in phase 3 with transmitting symbol of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x25.png" xlink:type="simple"/></inline-formula> and transmitting power of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x26.png" xlink:type="simple"/></inline-formula>. Then, the BS is transmitting a symbol <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x27.png" xlink:type="simple"/></inline-formula> and the RS is able to decode the correct symbol and forwards the decoded symbol <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x28.png" xlink:type="simple"/></inline-formula> to MS with transmitting power of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x29.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x30.png" xlink:type="simple"/></inline-formula> respectively in phase 4. The received signals in phase 3 and 4 are described in Equations (5)-(7).</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Alamouti DF relaying protocol in different phases</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x31.png"/></fig><disp-formula id="scirp.67508-formula72"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x32.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula73"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x33.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula74"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x34.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x36.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x37.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x38.png" xlink:type="simple"/></inline-formula> are the channel coefficient of the BS-to-MS in phase 1, the BS-to- RS in phase 1, the BS-to-MS in phase 2, and the RS-to-MS in phase 2 respectively. Also, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x39.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x40.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x41.png" xlink:type="simple"/></inline-formula>is the additive noise in phase 1 and phase 2.</p><p>The total SNR at the MS using C-MRC technique as follows:</p><disp-formula id="scirp.67508-formula75"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x42.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x43.png" xlink:type="simple"/></inline-formula> is the total SNR received at MS from BS and RS. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x44.png" xlink:type="simple"/></inline-formula>is the direct path SNR transmitted from BS to MS in phase 1 or 3, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x45.png" xlink:type="simple"/></inline-formula> is the indirect path SNR at the MS received from RS in phase 2 or 4.</p><p>The C-MRC for the received signals at the MS in Equations (2), (4), (5), and (7) are combined and could be expressed as follows:</p><disp-formula id="scirp.67508-formula76"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x46.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula77"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x47.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x48.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x49.png" xlink:type="simple"/></inline-formula> are the resultant of the C-MRC combiner at the MS [<xref ref-type="bibr" rid="scirp.67508-ref11">11</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref26">26</xref>] . Also <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x50.png" xlink:type="simple"/></inline-formula>- <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x51.png" xlink:type="simple"/></inline-formula> are the C-MRC weights and expressed in Equations (11)-(16).</p><disp-formula id="scirp.67508-formula78"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x52.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula79"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x53.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula80"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x54.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula81"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x55.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula82"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x56.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula83"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x57.png"  xlink:type="simple"/></disp-formula><p>After substitution of Equations (11)-(16) in (9) and (10), the received signal at MS is simplified as,</p><disp-formula id="scirp.67508-formula84"><label>(17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x58.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula85"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x59.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x60.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x61.png" xlink:type="simple"/></inline-formula> are the total noise at MS and described as follows:</p><disp-formula id="scirp.67508-formula86"><label>(19)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x62.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula87"><label>(20)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x63.png"  xlink:type="simple"/></disp-formula><p>Finally, the total SNR at MS using C-MRC technique as follows:</p><disp-formula id="scirp.67508-formula88"><label>(21)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x64.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula89"><label>(22)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x65.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3"><title>3. Performance Analysis of Alamouti Decode and Forward Relaying Protocol</title><sec id="s3_1"><title>3.1. Performance Analysis of SER Asymptotic Tight Approximation</title><p>In this paper, the performance of SER approximation for the Alamouti DF Relaying Protocol with the M-PSK modulation system is analyzed, and compared with SER upper bound. In this, the approximate SER is significantly improves at higher SNR. From the results of asymptotic tight bound approximate SER, PSO based PA is determined for the Alamouti DF Relaying Protocol.</p><p>The conditional approximate SER of the system can be follow as,</p><disp-formula id="scirp.67508-formula90"><label>(23)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x66.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula91"><label>(24)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x67.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula92"><label>(25)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x68.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula> with K is even [<xref ref-type="bibr" rid="scirp.67508-ref11">11</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref12">12</xref>] . In the following, the average condtional SER in Equation (25) over the rayleigh fading channels<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula> with variances<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x74.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x75.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x76.png" xlink:type="simple"/></inline-formula> respectively. Since the fading channels<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x76.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x77.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x76.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x78.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x69.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x76.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x77.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x79.png" xlink:type="simple"/></inline-formula> are independent of each other, and</p><disp-formula id="scirp.67508-formula93"><label>(26)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x80.png"  xlink:type="simple"/></disp-formula><p>To get the SER of the Alamouti DF Relaying Protocol with M-PSK modulation system can be written as,</p><disp-formula id="scirp.67508-formula94"><label>(27)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x81.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula95"><label>(28)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x82.png"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.67508-formula96"><label>(29)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x83.png"  xlink:type="simple"/></disp-formula><p>it is experiential that, substituting <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x84.png" xlink:type="simple"/></inline-formula> into the inequality in the right-hand side of Equation (27). In order to obtain maximum value in all integrands, the SER of Alamouti DF Relaying Protocol with M-PSK can be upper bounded as,</p><disp-formula id="scirp.67508-formula97"><label>(30)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x85.png"  xlink:type="simple"/></disp-formula><p>In the sequel, an asymptotically tight SER approximate is provided if all of the channel links<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x88.png" xlink:type="simple"/></inline-formula> are available, i.e., <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x89.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x90.png" xlink:type="simple"/></inline-formula>, and, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x91.png" xlink:type="simple"/></inline-formula>, then when <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x92.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x93.png" xlink:type="simple"/></inline-formula> go to infinity. According to Equation (30), let us denote the approximate SER of Alamouti DF Relaying Protocol with M-PSK,</p><disp-formula id="scirp.67508-formula98"><label>(31)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x94.png"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.67508-formula99"><label>(32)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x95.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula100"><label>(33)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x96.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula101"><label>(34)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x97.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula102"><label>(35)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x98.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula103"><label>(36)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x99.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula104"><label>(37)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x100.png"  xlink:type="simple"/></disp-formula><p>Therefore for large value x and y, an asymptotically tight approximations as follows,</p><disp-formula id="scirp.67508-formula105"><label>(38)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x101.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula106"><label>(39)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x102.png"  xlink:type="simple"/></disp-formula><p>In this approximate, the errors become insignificant compared to the orders <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x103.png" xlink:type="simple"/></inline-formula> when x and y go to inﬁnity.</p><p>Replacing x and y in Equations (38) and (39) with <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x104.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x105.png" xlink:type="simple"/></inline-formula> respectively and then substituting the results into Equation (31). The asymptotically tight SER approximate with M-PSK modulation systems is given as,</p><disp-formula id="scirp.67508-formula107"><label>(40)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x106.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3_2"><title>3.2. Optimum Relay Selection Technique</title><p>It is well known that the increasing number of relay in wireless communication system can achieved the diversity gain of the cooperative communication system .the optimum relay selection technique such that the base station can select the optimum cooperative relay depending on the channel quality of each link [<xref ref-type="bibr" rid="scirp.67508-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref11">11</xref>] .</p><p>The optimum relay selection for Alamouti DF Relaying Protocol is given by</p><disp-formula id="scirp.67508-formula108"><label>(41)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x107.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x108.png" xlink:type="simple"/></inline-formula> stands for the RS1, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x109.png" xlink:type="simple"/></inline-formula> stands for the RS2. From Equation (40), calculate the PSO based PA for asymptotically tight bound SER approximate <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x109.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x110.png" xlink:type="simple"/></inline-formula> for RS1 and RS2. From this, the lower approximate SER value for Alamouti DF Relaying Protocol gives the optimum relay in the cooperative communication systems [<xref ref-type="bibr" rid="scirp.67508-ref11">11</xref>] .</p></sec><sec id="s3_3"><title>3.3. Power Allocation Using Particle Swarm Optimization</title><p>In this paper, the performance of Equal PA (EPA) and PSO based PA for Alamouti DF Relaying Protocol are analyzed and compared. Total transmitted power is <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x111.png" xlink:type="simple"/></inline-formula> then the power allocated to BS and RS as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x112.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x112.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x113.png" xlink:type="simple"/></inline-formula>. PSO is optimizing technique; which gives the best optimum value for a given problem by using objective function. PSO contains a swarm of particles; each particle in this swarm gives a possible solution. Working of this optimizing technique is based on the population search, and gives a best solution by iteration method [<xref ref-type="bibr" rid="scirp.67508-ref27">27</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref28">28</xref>] .</p><p>In PSO algorithm, all particles are move towards its optimum value. For each iteration, all the particles in this swarm are updated by its position and velocity for optimization ability. In PSO, each particle maintains its position evaluated fitness and velocity. Where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x114.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x115.png" xlink:type="simple"/></inline-formula> are random variables and its elements are equally dispense in [0, 1]. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x115.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x116.png" xlink:type="simple"/></inline-formula> denotes the i particles position in the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x115.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x117.png" xlink:type="simple"/></inline-formula>-search space at time t. By updating velocity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x115.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x116.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x118.png" xlink:type="simple"/></inline-formula> to current position, the particles position are changed, and it is given by</p><disp-formula id="scirp.67508-formula109"><label>(42)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x119.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula110"><label>(43)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x120.png"  xlink:type="simple"/></disp-formula><p>Problem statement:</p><p>The SER of the systems with M-PSK modulation can be tightly approximated as</p><disp-formula id="scirp.67508-formula111"><label>(44)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x121.png"  xlink:type="simple"/></disp-formula><p>Here the problem statement is, to minimize the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x122.png" xlink:type="simple"/></inline-formula> in Equation (44)</p><p>Such that,</p><disp-formula id="scirp.67508-formula112"><label>(45)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x123.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula113"><label>(46)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x124.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula114"><graphic  xlink:href="http://html.scirp.org/file/53-7600576x125.png"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.67508-formula115"><graphic  xlink:href="http://html.scirp.org/file/53-7600576x126.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula116"><label>(47)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x127.png"  xlink:type="simple"/></disp-formula><p>For optimum single relay selection case,</p><disp-formula id="scirp.67508-formula117"><label>(48)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x128.png"  xlink:type="simple"/></disp-formula><p>Pseudo code for particle swarm optimization</p><p>1) Initialize<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x129.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x130.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x130.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x131.png" xlink:type="simple"/></inline-formula></p><p>2) Allocate number of particle <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x132.png" xlink:type="simple"/></inline-formula> and number of iteration</p><p>3) Generate random particles</p><p>4) Initialize random velocity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x133.png" xlink:type="simple"/></inline-formula></p><p>5) Evaluate fitness function (SER) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x134.png" xlink:type="simple"/></inline-formula></p><p>6) If <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x135.png" xlink:type="simple"/></inline-formula></p><p>Yes---update <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x136.png" xlink:type="simple"/></inline-formula></p><p>No---end</p><p>7) If <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x137.png" xlink:type="simple"/></inline-formula></p><p>Yes----update <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x138.png" xlink:type="simple"/></inline-formula></p><p>No---update velocity and position of random particle.</p><p>Continue until iteration end</p><p>From PSO algorithm, evaluate the fitness value from Equation (44) under minimum SER condition is reached. If current fitness value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula>) is lesser than the previous fitness value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x140.png" xlink:type="simple"/></inline-formula>), update the minimum SER as the best fitness value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x141.png" xlink:type="simple"/></inline-formula>). Global best fitness value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x142.png" xlink:type="simple"/></inline-formula>) is calculated by comparing all the best fitness. If current global best value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x142.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x143.png" xlink:type="simple"/></inline-formula>) is lesser than the previous global best fitness value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x142.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x143.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x144.png" xlink:type="simple"/></inline-formula>), update the minimum SER as the best global value (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x139.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x140.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x141.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x142.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x143.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x144.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x145.png" xlink:type="simple"/></inline-formula>). Here 50 particles and 100 iterations are considered to achieve the optimum value [<xref ref-type="bibr" rid="scirp.67508-ref27">27</xref>] . <xref ref-type="fig" rid="fig3">Figure 3</xref> depicts the flowchart of PSO Algorithm.</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Flowchart of PSO Algorithm for minimizing approximate SER</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x146.png"/></fig></sec></sec><sec id="s4"><title>4. Modified Cooperative Subchannel Allocation for an Alamouti DF Relaying Protocol</title><p>In this paper, the performance analysis of a modified CSA Algorithms used in Alamouti DF Relaying Protocol for wireless multi-user OFDMA systems is discussed. The total bandwidth is B and each subchannel or subcarrier is N which has bandwidth of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x147.png" xlink:type="simple"/></inline-formula>. The noise power spectral density is <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x147.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x148.png" xlink:type="simple"/></inline-formula> level for all users and all subchannels.The Modified Throughput based CSA Algorithm enhances the throughput of the system by PSO based PA to all subchannel. In addition, the Modified Fairness based CSA Algorithm prioritize the fairness in the multi-user OFDMA systems.</p><p>User Data Rate:</p><p>The subchannel allocation matrix <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula> specifies that the user can be allocated to the subchannels.<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula>, if and only if subchannel j is allocated to user i; or else it is zero. Any of the users not shares subchannel, so in case <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x151.png" xlink:type="simple"/></inline-formula> then <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x151.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x152.png" xlink:type="simple"/></inline-formula> for all<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x151.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x152.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x153.png" xlink:type="simple"/></inline-formula>. The total transmit power is assumed as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x151.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x152.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x154.png" xlink:type="simple"/></inline-formula> over the entire bandwidth and PSO based power allocated to the all the subchannels. In such system, the data rate for the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x151.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x152.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x155.png" xlink:type="simple"/></inline-formula> user, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x149.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x150.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x151.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x152.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x156.png" xlink:type="simple"/></inline-formula>, is given by,</p><disp-formula id="scirp.67508-formula118"><label>(49)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x157.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x158.png" xlink:type="simple"/></inline-formula> is the SNR of the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x158.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x159.png" xlink:type="simple"/></inline-formula> subchannel for the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x158.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x159.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x160.png" xlink:type="simple"/></inline-formula> user and its given by,</p><disp-formula id="scirp.67508-formula119"><label>(50)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x161.png"  xlink:type="simple"/></disp-formula><sec id="s4_1"><title>4.1. Modified Throughput Based Subchannel Allocation</title><p>To enhance the total throughput of the multi-user OFDMA systems, the Modified Throughput based CSA for an Alamouti DF Relaying Protocol is given by,</p><disp-formula id="scirp.67508-formula120"><label>(51)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x162.png"  xlink:type="simple"/></disp-formula><p>Subject to:</p><disp-formula id="scirp.67508-formula121"><label>(52)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x163.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula122"><graphic  xlink:href="http://html.scirp.org/file/53-7600576x164.png"  xlink:type="simple"/></disp-formula><p><xref ref-type="fig" rid="fig4">Figure 4</xref> shows the flowchart of Modified Throughput based Subchannel Allocation Algorithm. The constraints <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x165.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x165.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x166.png" xlink:type="simple"/></inline-formula> guarantee that the multi user OFDMA systems are not shared all subchannels. By taking the capacity derived in Equation (52), it is experiential that the data rate is not only the function of MS subcarrier gain (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x165.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x166.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x167.png" xlink:type="simple"/></inline-formula>), but also depends on the RS subcarrier gain (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x165.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x166.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x167.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x168.png" xlink:type="simple"/></inline-formula>) and weighting factor (W). Therefore, the channel values include the sub channels gain of RS and MS. In subchannel allocation, the selected channel</p><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Flowchart of modified throughput based subchannel allocation algorithm</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x169.png"/></fig><p>value for <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x170.png" xlink:type="simple"/></inline-formula> user as,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x170.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x171.png" xlink:type="simple"/></inline-formula>.</p><p>Pseudocode For Throughput Cooperative Subchannel Allocation</p><p>1) Initialize <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x172.png" xlink:type="simple"/></inline-formula> &amp; <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x172.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x173.png" xlink:type="simple"/></inline-formula></p><p>2) Assign channel <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x174.png" xlink:type="simple"/></inline-formula></p><p>3) Allocated PSO based power to source and relay as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x175.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x175.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x176.png" xlink:type="simple"/></inline-formula> respectively.</p><p>4) Allocate each subchannel to the user -for j = 1 to J</p><p>5) Find i to maximize <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x177.png" xlink:type="simple"/></inline-formula></p><p>6) Allocate subchannel to the user <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x178.png" xlink:type="simple"/></inline-formula></p><p>7) Maximize throughput rate <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x179.png" xlink:type="simple"/></inline-formula></p><p>8) end</p><p>9) end</p><p>In the first step, the channel value is considered for all the subchannels of the entire user and all the variables are initialized in the Pseudo code. In the next step, user is assigned the highest channel value for that subchannel each. For all the users, a simple two step procedure is continuing until the CSA is reached. In the OFDMA systems, thus throughput Pseudo code does not meet fairness among all users.</p></sec><sec id="s4_2"><title>4.2. Modified Fairness Based Subchannel Allocation</title><p>To enhance the total throughput with maintaining the fairness in the multi-user OFDMA systems, by using Modified Fairness (Max-Min) based CSA for an Alamouti DF Relaying Protocol is given by:</p><disp-formula id="scirp.67508-formula123"><label>(53)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x180.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula124"><label>(54)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/53-7600576x181.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.67508-formula125"><graphic  xlink:href="http://html.scirp.org/file/53-7600576x182.png"  xlink:type="simple"/></disp-formula><p>By modifying the channel values for the Fairness based CSA Pseudo code is as follows:</p><p>Pseudo Code For Fairness Cooperative Subchannel Allocation</p><p>1) Initialize <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x183.png" xlink:type="simple"/></inline-formula> &amp; <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x183.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x184.png" xlink:type="simple"/></inline-formula></p><p>2) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x185.png" xlink:type="simple"/></inline-formula></p><p>3) Assign channel <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x186.png" xlink:type="simple"/></inline-formula></p><p>4) Allocated PSO based power to source and relay as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x187.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x187.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x188.png" xlink:type="simple"/></inline-formula> respectively.</p><p>5) Allocate each subchannel to the user --for i = 1 to I</p><p>6) (a) find j satisfying <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x189.png" xlink:type="simple"/></inline-formula> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x189.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x190.png" xlink:type="simple"/></inline-formula></p><p>7) (b) Update <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x191.png" xlink:type="simple"/></inline-formula></p><p>8) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x192.png" xlink:type="simple"/></inline-formula></p><p>9) end while <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x193.png" xlink:type="simple"/></inline-formula></p><p>10) (a) find i satisfying <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x194.png" xlink:type="simple"/></inline-formula> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x194.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x195.png" xlink:type="simple"/></inline-formula></p><p>11) (b) for the found i find j satisfying <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x196.png" xlink:type="simple"/></inline-formula> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x196.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x197.png" xlink:type="simple"/></inline-formula></p><p>12) (c) update<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x198.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x198.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x199.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x198.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x199.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x200.png" xlink:type="simple"/></inline-formula></p><p>13) end</p><p>14) end</p><p><xref ref-type="fig" rid="fig5">Figure 5</xref> shows the flowchart of Modified Fairness based Subchannel Allocation Algorithm. In the first step, the channel value is considered for all the subchannels of the entire user and all the variables are initialized in the Pseudo code. In the second step, user is assigned the channel value for that subchannel. After the entire users have been assigned to one subchannel each, in the third step priority is given to the user with the lowest data rate to choose its next subchannel. This process continues until to allocate the entire user in the systems.</p></sec></sec><sec id="s5"><title>5. Simulation Result</title><p>In this paper, the total transmitted power of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x201.png" xlink:type="simple"/></inline-formula> and the Channel bandwidth B=1.4 MHz are considered for performance evaluate of LTE downlink system.</p><p>In this the number of subchannels allocated to the users is N = 256 and the variance of the noise is <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x202.png" xlink:type="simple"/></inline-formula> assumed for analysis [<xref ref-type="bibr" rid="scirp.67508-ref29">29</xref>] [<xref ref-type="bibr" rid="scirp.67508-ref30">30</xref>] .</p><p>The asymptotic performance of the Alamouti DF Relaying Protocol with 4-PSK modulation system is compared with SER upper bound and the approximation is shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>. The normalized channel variance as 1 (i.e., <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x203.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x203.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x204.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x203.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x204.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x205.png" xlink:type="simple"/></inline-formula>) and Equal Power Allocation(EPA) are assumed for simulation .In this analysis, the parameters b = 0.11, A = 0.377 and B = 0.3828 are obtained for 4-PSK modulation system. From <xref ref-type="fig" rid="fig6">Figure 6</xref>, it is observed that the approximate SER is less at low SNR and significantly improves at higher SNR.</p><p>From the asymptotically tight bound approximation, the performance of Alamouti DF Relaying Protocol shows the diversity order two. <xref ref-type="fig" rid="fig7">Figure 7</xref> shows the performance comparison of the PSO based PA and EPA of the Alamouti DF Relaying Protocol with 4-PSK modulation system. From <xref ref-type="fig" rid="fig7">Figure 7</xref>, it is observed that PSO powers ratios are <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x206.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x206.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x207.png" xlink:type="simple"/></inline-formula> achieved lower approximate SER compared to EPA. The performance comparisons of the AF Relaying Protocol, DF Relaying Protocol and Alamouti DF Relaying Protocols with M-PSK modulation system are shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>. From the simulation results, it is observed that the performance of the Alamouti DF Relaying Protocol is better than that of the DF and AF protocols at SNR of</p><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Flowchart of modified fairness based subchannel allocation algorithm</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x208.png"/></fig><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Performance comparison of the SER upper bound and the asymptotic tight bound approximate for the Alamouti DF Relaying Protocol with 4-PSK modulation</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x209.png"/></fig><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Performance of the Alamouti DF Relaying Protocol with 4-PSK modulation: PSO PA versus EPA</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x210.png"/></fig><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Performance of the Alamouti DF Relaying Protocol with 4-PSK modulation: PSO PA versus EPA</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x211.png"/></fig><p>2 dB and 2.5 dB. In the cooperative wireless communication system, the Alamouti DF Relaying Protocol is achieved improved SNR Compared to Alamouti AF Relaying Protocol, due to a decrease in the effects of additive white noise at the relay station from the decoding method. The Alamouti DF Relaying Protocol can achieve a full diversity gain with the enhanced SNR and reduced approximate SER for the base-to-mobile received signal.</p><p>From the asymptotic tight bound approximate SER, PSO power ratios (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x212.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x212.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x213.png" xlink:type="simple"/></inline-formula>) for the Alamouti DF Relaying Protocol, AF Relaying Protocol and, DF Relaying Protocol are found as (0.6667, 0.3333), (0.6670, 0.3333) and (0.6184, 0.3814) respectively.</p><p><xref ref-type="fig" rid="fig9">Figure 9</xref> shows the total transmitted power versus SER for the AF, DF and Alamouti DF Relaying Protocols with 4-PSK modulation system. The performance of three different power ratios is allocated to the BS (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x214.png" xlink:type="simple"/></inline-formula>) as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>0. For<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x214.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x215.png" xlink:type="simple"/></inline-formula>, it is observed that low power is allocated to the BS and high power is allocated to the RS. This is because of the SNR in the BS-to-MS link contains a weighting factor of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x214.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x215.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x216.png" xlink:type="simple"/></inline-formula> which is higher than weighting factor (W) in the RS-to-MS link.</p><p>Therefore, high power is allocated to the RS in order to maximize the total SNR. In addition for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x217.png" xlink:type="simple"/></inline-formula>, it is observed that high power is allocated to the BS and low power is allocated to the RS. In this case, the C-MRC weighting factor approaches to 1, which is the maximum value.</p><p>It is observed that the equal power is allocated to the BS and the RS for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/53-7600576x218.png" xlink:type="simple"/></inline-formula>. In this case also, the C-MRC weighting factor approaches to maximum value of 1. The throughput modified cooperative subchannel allocation versus number of users for a wireless multi-user OFDMA system as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>1. From this simulation results, it is observed that the Modified Throughput based Subchannel Allocation Algorithm used in Alamouti DF Relaying Protocol achieves throughput from 5.6% to 6.3% and 21% to 33% when compared with AF Relaying Protocol and DF Relaying Protocol, respectively. In addition, the total throughput versus number of users is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>2 using fairness based modified cooperative subchannel allocation. In this, the Modified Fairness based Subchannel Allocation Algorithm used in Alamouti DF Relaying Protocol achieves fairness among the multiuser 7.2% to 7.6% and 16.2% to 16.6% when compared with AF Relaying</p><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Performance comparison of the AF, DF, and Alamouti DF Relaying Protocols with 4-PSK modulation</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x219.png"/></fig><fig id="fig10"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>0</label><caption><title> Performance comparison of the three different power ratios for Alamouti DF Relaying Protocol with 4-PSK modulation</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x220.png"/></fig><fig id="fig11"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>1</label><caption><title> Total throughput for throughput oriented modified CSA algorithm</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x221.png"/></fig><fig id="fig12"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>2</label><caption><title> Total throughput for fairness oriented modified CSA algorithm</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/53-7600576x222.png"/></fig><p>Protocol and DF Relaying Protocol, respectively. The modified cooperative subchannel allocation algorithm used in Alamouti DF Relaying Protocol can achieve a full diversity gain with the enhanced SNR and total throughput for wireless systems.</p></sec><sec id="s6"><title>6. Conclusions</title><p>In this paper, the performance of a Modified CSA Algorithms used in Alamouti DF Relaying Protocol for wireless multi-user OFDMA systems is analyzed. In addition, the SER approximation performance analysis of Alamouti DF Relaying Protocol with PSO based PA is analyzed and compared with SER upper bound. From the simulation results, it is observed that the asymptotically approximate SER significantly improves at higher SNR region and also presents good quality match to the system performance in the reasonable-SNR region; they may not be suitable for low SNR regions.</p><p>Due to Alamouti DF Relaying Protocol, it is achieved maximum 33% of throughput for Modified Throughput based Subchannel Allocation Algorithm. In addition, it is achieved maximum 16.6% of fairness among the multiuser for Modified Fairness based Subchannel Allocation Algorithm. Further this research can be extended in the direction of Hybrid DF/AF Relaying Protocol for SNR improvements and throughput of the OFDMA systems.</p></sec><sec id="s7"><title>Cite this paper</title><p>K. Shoukath Ali,P. Sampath, (2016) Modified Cooperative Subchannel Allocation Algorithms and PSO Based Power Allocation for an Alamouti Decode and Forward Relaying Protocol in Multiuser OFDMA Systems. Circuits and Systems,07,1769-1786. doi: 10.4236/cs.2016.78153</p></sec></body><back><ref-list><title>References</title><ref id="scirp.67508-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Laneman, J. and Wornell, G. (2003) Distributed Space-Time-Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks. IEEE Transactions on Information Theory, 49, 2415-2425. http://dx.doi.org/10.1109/TIT.2003.817829</mixed-citation></ref><ref id="scirp.67508-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Laneman, J., Tse, D. and Wornell, G. (2004) Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior. IEEE Transactions on Information Theory, 50, 3062-3080. http://dx.doi.org/10.1109/TIT.2004.838089</mixed-citation></ref><ref id="scirp.67508-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Tarokh, V., Seshadri, N. and Calderbank, A.R. (1998) Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction. IEEE Transactions on Information Theory, 44, 744-765. http://dx.doi.org/10.1109/18.661517</mixed-citation></ref><ref id="scirp.67508-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Alamouti, S.M. (1998) A Simple Transmit Diversity Technique for Wireless Communications. IEEE Journal on Select Areas Communications, 16, 1451-1458. http://dx.doi.org/10.1109/49.730453</mixed-citation></ref><ref id="scirp.67508-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Tarokh, V., Jafarkhani, H. and Calderbank, A.R. (1999) Space-Time Block Codes from Orthogonal Designs. IEEE Transactions on Information Theory, 45, 1456-1467. http://dx.doi.org/10.1109/18.771146</mixed-citation></ref><ref id="scirp.67508-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Sendonaris, A., Erkip, E. and Aazhang, B. (2003) User Cooperation Diversity—Part I: System Description. IEEE Transactions on Communications, 51, 1927-1938.</mixed-citation></ref><ref id="scirp.67508-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Cover, T.M. and El Gamal, A.A. (2005) Capacity Theorems for the Relay Channel. IEEE Transactions on Information Theory, 25, 572-584. http://dx.doi.org/10.1109/TIT.1979.1056084</mixed-citation></ref><ref id="scirp.67508-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Kramer, G., Gastpar, M. and Gupta, P. (2005) Cooperative Strategies and Capacity Theorems for Relay Networks. IEEE Transactions on Information Theory, 51,3037-3063. http://dx.doi.org/10.1109/TIT.2005.853304</mixed-citation></ref><ref id="scirp.67508-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Swasdio, W., Pirak, C. and Ascheid, G. (2010) Alamouti-Coded Decode-and-Forward Protocol with Optimum Relay Selection for Cooperative Communications. 978-1-4244-6890-4/10.</mixed-citation></ref><ref id="scirp.67508-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Swasdio, W. and Pirak, C. (2010) A Novel Alamouti-Coded Decode-and-Forward Protocol for Cooperative Communications. 978-1-4244-6890-4/10.</mixed-citation></ref><ref id="scirp.67508-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Swasdio, W., Pirak, C., Jitapunkul, S. and Ascheid, G. (2014) Alamouti-Coded Decode-and-Forward Protocol with Optimum Relay Selection and Power Allocation for Cooperative Communications. EURASIP Journal on Wireless Communications and Networking, 2014, 112. http://dx.doi.org/10.1186/1687-1499-2014-112</mixed-citation></ref><ref id="scirp.67508-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Su, W., Sadek, A.K. and Liu, KJ.R. (2008) Cooperative Communication Protocols in Wireless Networks: Performance Analysis and Optimum Power Allocation. Wireless Personal Communications, 44, 181-217.http://dx.doi.org/10.1007/s11277-007-9359-z</mixed-citation></ref><ref id="scirp.67508-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Bai, Z., Xu, Y., Dong, P., Gong, P. and Kwak, K. (2013) Particle Swarm Optimization Based Power Allocation in DF Cooperative Communications. Ubiquitous and Future Networks (ICUFN), 978-1-4673-5990-0/13.</mixed-citation></ref><ref id="scirp.67508-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Li, F., Liu, X.-M., Luo, T. and Yue, G.-X. (2008) Optimal Power Allocation to Minimize SER for Multimode Amplify-and-Forward Cooperative Communication Systems. The Journal of China Universities of Posts and Telecommunications, 15, 14-23. http://dx.doi.org/10.1016/S1005-8885(08)60395-7</mixed-citation></ref><ref id="scirp.67508-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Peter, S. and Heath, R. (2009) The Future of Wimax: Multihop Relaying with IEEE 802.16j. IEEE Communications Magazine, 47, 104-111. http://dx.doi.org/10.1109/MCOM.2009.4752686</mixed-citation></ref><ref id="scirp.67508-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Li, Y.G., Winters, J.H. and Sollenberger, N.R. (2002) MIMO-OFDM for Wireless Communications: Signal Detection with Enhanced Channel Estimation. IEEE Transactions on Communications, 50, 1471-1476.http://dx.doi.org/10.1109/tcomm.2002.802566</mixed-citation></ref><ref id="scirp.67508-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Yang, Y., Hu, H., Xu, J. and Mao, G. (2009) Relay Technologies for WiMax and LTE-Advanced Mobile Systems. IEEE Communications Magazine, 47, 100-105. http://dx.doi.org/10.1109/MCOM.2009.5273815</mixed-citation></ref><ref id="scirp.67508-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Jang, J. and Lee, K.B. (2003) Transmit Power Adaptation for Multiuser OFDM Systems. IEEE Journal on Selected Areas in Communications, 21, 171-178. http://dx.doi.org/10.1109/JSAC.2002.807348</mixed-citation></ref><ref id="scirp.67508-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Yin, H. and Liu, H. (2000) An Efficient Multiuser Loading Algorithm for OFDM Based Broadband Wireless Systems. Global Telecommunications Conference, San Francisco, 27 November-1 December 2000, 103-107. http://dx.doi.org/10.1109/glocom.2000.891705</mixed-citation></ref><ref id="scirp.67508-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Wong, C.Y. and Cheng, R.S. (1999) Multiuser OFDM with Adaptive Subcarrier, Bit and Power Allocation. IEEE Journal on Selected Areas in Communications, 17, 1747-1758. http://dx.doi.org/10.1109/49.793310</mixed-citation></ref><ref id="scirp.67508-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Sadr, S., Anpalagan, A. and Raahemifar, K. (2009) Radio Resource Allocation Algorithms for the Downlink of Multiuser OFDM Communication Systems. IEEE Communications Surveys &amp; Tutorials, 11, 92-106. http://dx.doi.org/10.1109/SURV.2009.090307</mixed-citation></ref><ref id="scirp.67508-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Sadr, S., Anpalagan, A. and Raahemifar, K. (2007) A Novel Subcarrier Allocation Algorithm for Multiuser OFDM System with Fairness: User’s Perspective. 2007 IEEE 66th Vehicular Technology Conference, Baltimore, 30 September-3 October 2007, 1772-1776. http://dx.doi.org/10.1109/vetecf.2007.374</mixed-citation></ref><ref id="scirp.67508-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Rasouli, H. and Anpalagan, A. (2011) An Opportunistic Subcarrier Allocation Algorithm Based on Cooperative Coefficient for OFDM Relaying Systems. 7th International Wireless Communications and Mobile Computing Conference (IWCMC), Istanbul, Turkey, 4-8 July 2011, 178-183.</mixed-citation></ref><ref id="scirp.67508-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple">Ashourian, M., Salimian, R. and Nasab, H.M. (2013) A Low Complexity Resource Allocation Method for OFDMA System Based on Channel Gain. Wireless Personal Communications, 71, 519-529. http://dx.doi.org/10.1007/s11277-012-0826-9</mixed-citation></ref><ref id="scirp.67508-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Alamouti, S.M. (1998) A Simple Transmit Diversity Technique for Wireless Communications. IEEE Journal on Select Areas in Communications, 16, 1451-1458. http://dx.doi.org/10.1109/49.730453</mixed-citation></ref><ref id="scirp.67508-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Wang, T., Cano, A., Giannakis, G.B. and Laneman, J.N. (2007) High-Performance Cooperative Demodulation with Decode-and-Forward Relays. IEEE Transactions on Communications, 55, 1427-1438.http://dx.doi.org/10.1109/TCOMM.2007.900631</mixed-citation></ref><ref id="scirp.67508-ref27"><label>27</label><mixed-citation publication-type="book" xlink:type="simple">Kennedy, J. (2010) Particle Swarm Optimization. In: Gass, S.I. and Fu, M.C., Eds., Encyclopedia of Machine Learning, Springer, New York, 760-766.</mixed-citation></ref><ref id="scirp.67508-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Bai, Q. (2010) Analysis of Particle Swarm Optimization Algorithm. Computer &amp; Information Science, 3, 94-97.http://dx.doi.org/10.5539/cis.v3n1p180</mixed-citation></ref><ref id="scirp.67508-ref29"><label>29</label><mixed-citation publication-type="other" xlink:type="simple">Gray, D. (2009) WiMAX?, HSPA+, and LTE: A Comparative Analysis. </mixed-citation></ref><ref id="scirp.67508-ref30"><label>30</label><mixed-citation publication-type="other" xlink:type="simple">Roessler, A. and Pfeifer, G. (2010) LTE UE RF Measurements—An Introduction and Overview.</mixed-citation></ref></ref-list></back></article>