<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T16:13:11Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5649" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5649</identifier><datestamp>2019-04-03T02:41:58Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="d8cdb1c6-7d77-42ca-9c83-935a8647520e" confidence="600">Changiz Rezaei, Seyed Saeed</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-12-07T17:07:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-12-07T17:07:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-12-07T17:07:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5649</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Cooperative wireless communication has received significant attention during recent years due to several reasons. First, since the received power&#xd;
decreases rapidly with distance, the idea of multi-hopping is becoming of particular&#xd;
importance. In multi-hopped communication, the source exploits some intermediate&#xd;
nodes as relays. Then the source sends its message via those relays to the destination.&#xd;
Second, relays can emulate some kind of distributed transmit antennas to form spatial&#xd;
diversity and combat multi-path fading effect of the wireless channel.&#xd;
&#xd;
Parallel Relay Channel is an information theoretical model for a communication system&#xd;
whereby a sender aims to communicate to a receiver with the help of relay nodes. It represents the simplest model for a multi–hop wireless network and a full understanding of the limits of communication over such a channel can potentially shed light on the design of more efficient wireless networks. However, the capacity of the relay&#xd;
channel has been established only for few special cases and little progress&#xd;
has been made toward solving the general case since the early 1980s.&#xd;
&#xd;
In this dissertation, motivated by practical constraints, we study the information theoretical limits of the half-duplex Gaussian Parallel Relay channel , as well as, the transmission strategies for the parallel relay channel with bandwidth mismatch between the first and the second hops.&#xd;
&#xd;
Chapter 2 investigates the problem of communication for a network composed of two&#xd;
half-duplex parallel relays with additive white Gaussian noise (AWGN).&#xd;
There is no direct link between the source and the destination.&#xd;
However, the relays can communicate with each other through the channel between them.&#xd;
Two protocols, i.e., \emph{Simultaneous} and \emph{Successive} relaying, associated with&#xd;
two possible relay scheduling are proposed. The simultaneous relaying protocol is based&#xd;
on \emph{Broadcast-multiaccess with Common Message (BCM)} scheme. For the successive relaying protocol: (i) a \emph{Non-Cooperative}&#xd;
scheme based on the \emph{Dirty Paper Coding (DPC)}, and (ii)  a \emph{Cooperative}&#xd;
scheme based on the \emph{Block Markov Encoding (BME)} are considered. The composite&#xd;
scheme of employing BME in \emph{at most} one relay and DPC in \emph{at least} another&#xd;
one is shown to achieve at least the same rate when compared to the \emph{Cooperative}&#xd;
and \emph{Non-Cooperative} schemes. A \emph{``Simultaneous-Successive Relaying based&#xd;
on Dirty paper coding scheme&amp;quot; (SSRD)} is also proposed. The optimum scheduling of the&#xd;
relays and hence the capacity of the half-duplex Gaussian parallel relay channel in the&#xd;
low and high signal-to-noise ratio (SNR) scenarios is derived. In the low SNR scenario,&#xd;
it is revealed that under certain conditions for the channel coefficients, the ratio of&#xd;
the achievable rate of the simultaneous relaying based on BCM to the cut-set bound tends&#xd;
to be 1. On the other hand, as SNR goes to infinity, it is proved that successive relaying, based on the DPC, asymptotically achieves the capacity of the network.&#xd;
&#xd;
Schein and Gallager introduced the Gaussian parallel relay channel in 2000.&#xd;
They proposed the Amplify-and-Forward (AF) and the Decode-and-Forward (DF) strategies for this channel. For a long time, the best known achievable rate for this channel was based on the AF and DF with time sharing (AF-DF).  Recently, a Rematch-and-Forward (RF) scheme for the scenario in which different amounts of bandwidth can be assigned to the first and second hops were proposed.&#xd;
In chapter 3, we propose a \emph{Combined Amplify-and-Decode Forward (CADF)} scheme for the Gaussian parallel relay channel. We prove that the CADF scheme always gives a better achievable rate compared to the RF scheme, when there is a bandwidth mismatch between the first hop and the second hop. Furthermore, for the equal bandwidth case (Schein&amp;apos;s setup), we show that the time sharing between the CADF and the DF schemes (CADF-DF) leads to a better achievable rate compared to the time sharing between the RF and the DF schemes (RF-DF) as well as the AF-DF.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Half-Duplex Parallel Relay Channel</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Gaussian Parallel Relay Channel</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Dirty Paper Coding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Block Markov Encoding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Amplify-and-Forward</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Decode-and-Forward</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Combined Amplify-and-Decode Forward (CADF))</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Transmission Strategies for the Gaussian Parallel Relay Channel</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>