<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Electrical Engineering</JournalTitle>
				<Issn>2588-2910</Issn>
				<Volume>50</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2018</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimal Power Management to Minimize SER in Amplify and-Forward Relay Networks</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>33</FirstPage>
			<LastPage>42</LastPage>
			<ELocationID EIdType="pii">1983</ELocationID>
			
<ELocationID EIdType="doi">10.22060/eej.2017.13060.5131</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Abedi</LastName>
<Affiliation>Electrical Engineering Department, Amirkabir University of Technology, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>M. J</FirstName>
					<LastName>Emadi</LastName>
<Affiliation>Electrical Engineering Department, Amirkabir University of Technology, Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2017</Year>
					<Month>06</Month>
					<Day>25</Day>
				</PubDate>
			</History>
		    <Abstract>This paper studies optimal power allocation to minimize symbol error rate (SER) of amplify-and-forward cooperative diversity networks. First, we analytically solve optimal power allocation problem to minimize SER for three different scenarios, namely, multi-branch single-relay, single-branch multi-relay and multi-branch multi-relay cooperative diversity networks, all subject to a given total relay power consumption. In addition to the total relay power constraint, for the multi-branch single-relay scenario. Next, we assume that every single relay is subject to a maximum power constraint. To this end, we present an iterative algorithm to find the optimal power rates. Finally, we study an off-line scenario in which the relays are energy harvester and equipped with infinite-sized batteries. For this scenario, the maximum SER is minimized over the whole harvesting time slots. We propose a water filling algorithm for the classical relay channel and an iterative algorithm for the multi-branch single-relay cooperative scheme. Through the numerical results, it is shown that optimal power allocation policies enhance the system performance.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Cooperative diversity network</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Optimal power allocation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Symbol error rate</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Water filling algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Battery</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://eej.aut.ac.ir/article_1983_1e4d36177d71bbb3558e43af9577d70e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
