Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / Em comunicaÃÃes cooperativas, dois ou mais terminais de transmissÃo sÃo combinados para aumentar a diversidade e/ou a potencia dos sinais que chegam a um determinado receptor. Portanto, mesmo que os dispositivos nÃo disponham de mais de uma antena, ou que entÃo haja uma grande perda por propagaÃÃo entre dois pontos comunicantes, os diversos elementos transmissores podem atuar como um arranjo virtual de antenas, obtendo-se assim vantagens dos sistemas de mÃltiplas antenas (MIMO), sobretudo o aumento da capacidade de transmissÃo. Recentemente, a chamada analise tensorial tem se mostrado uma abordagem eficiente entÃo para a estimaÃÃo de canais em sistemas com diversidade cooperativa. Contudo, nos poucos trabalhos dedicados a essa tarefa, a utilizaÃÃo da decomposiÃÃo tensorial PARAFAC para a modelagem dos sinais recebidos nÃo possibilitou o desenvolvimento de tÃcnicas de estimaÃÃo conjunta de canais e sÃmbolos. Com a idÃia de se evitar o uso de sequencias de treinamento, que limita a eficiÃncia espectral da transmissÃo por dedicar uma parte da largura de banda apenas para a tarefa de estimaÃÃo dos canais, o objetivo desta tese à prover novas estratÃgias de comunicaÃÃo, em termos de sistemas de transmissÃo e receptores semi-cegos, baseados em tensores adaptados a sistemas cooperativos MIMO unidirecionais de dois saltos. Dois sistemas de transmissÃo sÃo propostos utilizando uma codificaÃÃo espaÃo-temporal do tipo Khatri-Rao na fonte e duas estrategias de processamento Amplify-and-Forward (AF) no relay. Para estes sistemas, nomeados PT2-AF e NP-AF, os sinais recebidos no chamado nà de destino satisfazem os modelos tensoriais do tipo PARATUCK2 e Nested PARAFAC. Explorando as propriedades de unicidade destes modelos tensoriais estabelecidas nesta tese, vÃrios receptores semi-cegos sÃo derivados. Alguns destes receptores sÃo do tipo ALS, enquanto outros sÃo de soluÃÃes baseadas na factorizaÃÃo de produtos de Khatri-Rao. Resultados de simulaÃÃo sÃo apresentados para ilustrar os desempenhos dos receptores propostos em comparaÃÃo a alguns estimadores supervisionados. / In cooperative communication systems, two or more transmitting terminals are combined to increase the diversity and/or the power of the signals arriving at a particular receiver. Therefore, even if the devices do not have more than one antenna, or if a significant propaga- tion loss is present between the two communicating nodes, the various transmitting elements can act as a virtual antenna array, thus obtaining the benefits of the multiple antenna (MIMO) systems, especially the increase in the capacity. Recently, tensor decompositions have been introduced as an efficient approach for channel estimation in cooperative com- munication systems. However, among the few works devoted to this task, the utilization of the PARAFAC tensor decomposition for modeling the received signals did not allow the development of techniques for joint symbol and channel estimation. Aiming to avoid the use of pilot sequences, which limits the overall spectral efficiency by dedicating a portion of the bandwidth only for the channel estimation task, the objective of this thesis is to provide new tensor-based strategies, including transmission systems and semi-blind receivers, for one-way two-hop MIMO relaying systems. Based on a Khatri-Rao space-time coding at the source and two different Amplify-and-Forward (AF) relaying strategies, two transmission schemes are proposed. For these systems, named PT2-AF and NP-AF, the received signals at the destination node follow respectively a PARATUCK2 and a nested PARAFAC tensor model. Exploiting uniqueness properties of these tensor models which are established in the thesis, several semi-blind receivers are derived. Some of these receivers are of iterative form us- ing an ALS algorithm, whereas some other ones have closed-form solutions associated with Khatri-Rao factorizations. Some simulation results are finally presented to illustrate the per- formance of the proposed receivers which are compared to some state-of-the-art supervised techniques.

This diploma thesis deals with the static assessment of selected parts of the panel building of the former boarding school, for which adaptation to separate housing units and extension of one floor is planned. Upon the planned change of layout, extensions of the original door openings and new openings are proposed. The work assesses the object in its original state with the included unprofessional interference in statics during its use, and the object in the final state with planned modifications of the openings and proposes solutions to secure unsatisfactory areas to suit the new state loads

Resource allocation in wireless networks is one of the most studied class of problems. Generally, these problems are formulated as utility maximization problems under relevant constraints. The challenges posed by these problems vary widely depending on the nature of the utility function under consideration. Recently, the widespread prevalence of wireless devices prompted researchers and engineers to delve into the security issues of wireless communication. As compared to the wired medium, ensuring security for the wireless medium is more challenging mainly due to the broadcast nature of the transmission. But the ongoing research on physical layer security promises robust and reliable security schemes for wireless communication. Contrary to conventional cryptographic schemes, physical layer security techniques are impregnable as the security is ensured by the inherent randomness present in the wireless medium. In this thesis, we consider several wireless scenarios and propose secrecy enhancing resource allocation schemes for them in the first few chapters. We initially address the problem of secure transmission by following the conventional approach in the secrecy literature|secrecy rate maximization. Needless to say, in these chapters, secrecy rate is the utility function and the constraints are posed by the available power budget. Then we consider a pragmatic approach where we target the signal-to-noise ratio (SNR) of participating nodes and ensure information secrecy by appropriately constraining the SNRs of those nodes. In those SNR based formulations, SNR at the destination is the utility function and we are interested in maximizing it. In the last two chapters, we study two scenarios in a non-secrecy setting. In one of them, end-to-end data rate is the utility, whereas, in the other one, two utility functions|based on revenue generated|are defined for two rational agents in a game-theoretic setting. In the second chapter, we study parallel independent Gaussian channels with imperfect channel state information (CSI) for the eavesdropper. Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions and (ii) a Rayleigh fading scenario. Secondly, when non-zero secrecy is achievable in the low SNR regime, we aim to solve a robust power allocation problem which minimizes the outage probability at a target secrecy rate. In the third, fourth and fifth chapters, we consider scenarios where the source node transmits a message to the destination using M parallel amplify-and-forward (AF) relays in the presence of a single or multiple eavesdroppers. The third chapter addresses the problem of the maximum achievable secrecy rate for two specific network models: (a) degraded eavesdropper channel with complex channel gain and (b) scaled eavesdropper channel with real-valued channel gains. In the fourth chapter, we consider the SNR based approach and address two problems: (i) SNR maximization at the destination and (ii) Total relay power minimization. In the fifth chapter, we assume that the relay nodes are untrusted and to counter them, we deliberately introduce artificial noise in the source message. For this model, we propose and solve SNR maximization problems for the following two scenarios: (i) Total power constraint on all the relay nodes and (ii) Individual power constraints on each of the relay nodes. In the sixth chapter, we address the problem of passive eavesdroppers in multi-hop wire-less networks using the technique of friendly jamming. Assuming decode-and-forward (DF) relaying, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met. When channel state information (CSI) of all the node are available, we intend to minimize the total power consumption of all the transmitting nodes. In the absence of eavesdroppers CSI, we minimize vulnerability region of the network. In chapter seven, the problem of cooperative beamforming for maximizing the achievable data rate of two-hop amplify-and-forward (AF) network (in the absence of eavesdropper(s)) is considered. Along with an individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. To solve this problem, we propose a novel algorithm based on the Quadratic Eigenvalue Problem (QEP) and discuss its convergence. In chapter eight, we study a Stackelberg game between a base station and a multi-antenna power beacon for wireless energy harvesting in a multiple sensor node scenario. Assuming imperfect CSI between the sensor nodes and the power beacon, we propose a utility function that is based on throughput non-outage probability at the base station. We find the optimal strategies for the base station and the power beacon that maximize their respective utility functions.

Master of Science / Department of Electrical and Computer Engineering / Balasubramaniam Natarajan / In this thesis, we first consider the problem of distributed estimation in an energy and rate-constrained wireless sensor network. To this end, we study three estimators namely - (1) Best Linear Unbiased Estimator (BLUE-1) that accounts for the variance of noise in measurement, uniform quantization and channel, and derive its variance and its lower bound; (2) Best Linear Unbiased Estimator (BLUE-2) that accounts for the variance of noise in measurement and uniform quantization, and derive lower and upper bounds for its variance; (3) Best Linear Unbiased Estima- tor (BLUE-3) that incorporates the effects of probabilistic quantization noise and measurement noise, and derive an upper bound for its variance. Then using BLUE-1, we analyze the tradeoff between estimation error (BLUE variance) at the fusion center and the total amount of resources utilized (power and rate) using three different system design approaches or optimization formulations. For all the formulations, we determine optimum quantization bits and transmission power per bit (or optimum actions) for all sensors jointly. Unlike prior efforts, we in- corporate the operating state (characterized by the amount of residual battery power) of the sensors in the optimization framework. We study the e®ect of channel quality, local measurement noise, and operating states of the sensors on their optimum choice for quantization bits and transmit power per bit. In the sequel, we consider a problem in distributed detection and signal processing in the context of biomedical wireless sensors and more specifically pulse- oximeter devices that record photoplethysmographic data. We propose an automated, two-stage PPG data processing method to minimize the effect of motion artifact. Regarding stage one, we present novel and consistent techniques to detect the presence of motion artifact in photoplethysmograms given higher order statistical information present in the data.For stage two, we propose an effective motion artifact reduction method that involves enhanced PPG data preprocessing followed by frequency domain Independent Component Analysis (FD-ICA). Experimental results are presented to demonstrate the efficacy of the overall motion artifact reduction method. Finally, we analyze a wireless ad hoc/sensor network where nodes are connected via random channels and information is transported in the network in a cooperative multihop fashion using amplify and forward relay strategy.

Vacinação contra doenças virais e bacterianas tem sido uma das histórias de sucesso da medicina humana e veterinária. Vacinas genéticas são constituídas apenas de DNA (como plasmídeos) ou RNA (como mRNA), que são entregues às células alvo. Esta abordagem proporciona uma vantagem significativa, pois essas preparações em geral apresentam facilidade de construção genética, baixo custo, rapidez de produção em massa, estabilidade elevada e um perfil de segurança atraente. Vacinas baseadas em RNA recentemente receberam maior atenção porque, ao contrário de vacinas de DNA, são processadas no citoplasma, excluindo a necessidade de entrada no núcleo celular. O vírus Semliki Forest (SFV, Alphavirus, Togaviridae ) possui um RNA genômico, auto replicativo, de simples fita e polaridade positiva, protegido em uma nucleocápside icosaédrica, composta pelo próprio RNA e pela proteína de cápside viral (C), de 267 aminoácidos. A nucleocápside contém 180 cópias da proteína C e é coberta por uma membrana lipoprotéica contendo as glicoproteínas virais. Para realizar a entrega de moléculas de RNA com fins de imunização é fundamental que o material esteja protegido da ação de enzimas. Assim, o objetivo deste trabalho foi expressar a proteína C recombinante de SFV em E.coli , associá-la in vitro com RNA auto replicativo, contendo gene repórter e fazer entrega deste complexo à célula alvo. Para isso, o gene da proteína C foi obtido de forma sintética e clonado em um vetor de expressão em bactérias, pET-28a(+). Para a expressão da proteína C recombinante foram utilizadas bactérias E. coli BL21(DE3) e testadas diferentes temperaturas após indução com IPTG. A proteína obtida foi purificada por cromatografia de afinidade e a amostra foi dialisada utilizando coluna de dessalinização. Após a purificação, a proteína recombinante foi submetida a uma associação in vitro com RNA, obtido através de transcrição in vitro . A eficiência de formação do complexo Proteína-RNA foi medida pela quantidade diferencial de RNA livre antes e após o procedimento por eletroforese em gel de agarose e pela análise através de imagens obtidas por microscopia eletrônica de transmissão. A entrega do complexo Proteína-RNA foi realizada de forma eficiente à célula alvo. Desta forma, de maneira geral, a proteína de capsídeo do vírus SFV é capaz de se associar in vitro com RNA auto replicativo, trazendo proteção e estabilidade ao mesmo, bem como realizar a entrega desse material à célula alvo, através da desmontagem da nucleocápside no interior da célula hospedeira. / Vaccination against viral and bacterial diseases has been one of the success stories of human and veterinary medicine. Genetic vaccines consist only of DNA (such as plasmids) or RNA (such as mRNA), which are delivered to target cells. This approach provides a significant advantage as these preparations generally have ease of genetic engineering, low cost, fast mass production, high stability and attractive safety profile. Unlike DNA vaccines, RNAbased vaccines are processed into the cytoplasm, excluding the need for entry into the cell nucleus. The Semliki Forest virus (SFV, Alphavirus, Togaviridae ) has a positive-strand and auto amplify RNA, protected in an icosahedral nucleocapsid, composed of viral RNA and the 267 amino acid capsid protein (C). The nucleocapsid contains 180 copies of protein C and is covered by a lipoprotein membrane containing the viral glycoproteins. In order to carry out the delivery of RNA molecules for immunization purposes, it is essential that the material is protected from the action of enzymes. Thus, the objective of this work was to express recombinant SFV C protein in E.coli, to associate it in vitro with auto replicative RNA, containing reporter gene and to deliver this complex to the target cell. For this, the protein C gene was synthesized and cloned into a bacterial expression vector, pET-28a (+). For expression of recombinant protein C, E. coli BL21 (DE3) bacteria were used and different temperatures tested after IPTG induction. The obtained protein was purified by affinity chromatography and the sample was dialyzed using desalting column. After purification, the recombinant protein was subjected to an in vitro association with RNA, obtained by in vitro transcription. The efficiency of formation of the Protein-RNA complex was measured by the differential amount of free RNA before and after the procedure by agarose gel electrophoresis and by the analysis through images obtained by transmission electron microscopy. Delivery of the Protein-RNA complex was efficiently performed on the target cell. Thus, in general, the SFV virus capsid protein is able to associate in vitro with auto amplify RNA, providing protection and stability to it, as well as delivering this material to the target cell, by disassembling the nucleocapsid in the interior of the host cell.

We study energy-efficient power allocation among relays for lifetime maximization in a dual-hop relay network operated by amplify-and-forward relays with battery limitations. Power allocation algorithms are proposed for three different scenarios. First, we study the relay cooperation case where all the relays jointly support transmissions for a targeted data rate. By exploring the correlation of time-varying relay channels, we develop a prediction-based relay cooperation method for optimal power allocation strategy to improve the relay network lifetime over existing methods that do not predict the future channel state, or assume the current channel state remains static in the future. Next, we consider energy-efficient relay selection for the single source-destination case. Assuming finite transmission power levels, we propose a stochastic shortest path approach which gives the optimal relay selection decision to maximize the network lifetime. Due to the high computational complexity, a suboptimal prediction-based relay selection algorithm, directly coming from previous problem, is created. Finally, we extend our study to multiple source-destination case, where relay selection needs to be determined for each source-destination pair simultaneously. The network lifetime in the presence of multiple source-destination pairs is defined as the longest time when all source-destination pairs can maintain the target transmission rate. We design relay-to-destination mapping algorithms to prolong the network lifeii time. They all aim at maximizing the perceived network lifetime at the current time slot. The optimal max-min approach and suboptimal user-priority based approach are proposed with different levels of computational complexity. / UOIT

There has been phenomenal interest in applying space-time coding techniques in wireless communications in the last two decades. In general, the benefit of applying space-time codes in multiple-input, multiple-output (MIMO) wireless channels is an increase in transmission reliability or system throughput (capacity). However, such a benefit cannot be obtained in some wireless systems where size or other constraints preclude the use of multiple antennas. As such, wireless relay communications has recently been proposed as a means to provide spatial diversity in the face of this limitation. In this approach, some users or relay nodes assist the transmission of other users information. This dissertation contributes to the advancement of wireless relay communications by investigating the performance of various relaying signal processing methods under different practical fading environments. In particular, it examines two main relaying methods, namely decode-and-forward (DF) and amplify-and-forward (AF).<p> For DF, the focus is on the diversity analysis of relaying systems under various practical protocols when detection error at relays is taken into account. In order to effectively mitigate the phenomenon of error propagation, the smart relaying technique proposed by Wang et al. in [R1] is adopted. First, diversity analysis of a single-relay system under the scenario that only the relay is allowed to transmit in the second time slot (called Protocol II) is carried out. For Nakagami and Hoyt generalized fading channels, analytical and numerical results are provided to demonstrate that the system always obtains the maximal diversity when binary phase shift keying (BPSK) modulation is used. Second, a novel and low-complexity relaying system is proposed when smart relaying and equal gain combing (EGC) techniques are combined. In the proposed system, the destination requires only the phases of the channel state information in order to detect the transmitted signals. For the single-relay system with M-ary PSK modulation, it is shown that the system can achieve the maximal diversity under Nakagami and Hoyt fading channels. For the K-relay system, simulation results suggest that the maximal diversity can also be achieved. Finally, the diversity analysis for a smart relaying system under the scenario when both the source and relay are permitted to transmit in the second time slot (referred to as Protocol I) is presented. It is shown that Protocol I can achieve the same diversity order as Protocol II for the case of 1 relay. In addition, the diversity is very robust to the quality of the feedback channel as well as the accuracy of the quantization of the power scaling implemented at the relay.<p> For AF, the dissertation considers a fixed-gain multiple-relay system with maximal ratio combining (MRC) detection at the destination under Nakagami fading channels. Different from the smart relaying for DF, all the channel state information is assumed to be available at the destination in order to perform MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived. Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics of all the channels available at the destination, a novel power allocation (PA) is then proposed. The proposed PA shows significant performance gain over the conventional equal PA.

En la última década, la cooperación entre usuarios ha generado un gran interés por la posibilidad de mejorar la velocidad de transmisión en las redes de comunicaciones inalámbricas. El objetivo es formar un array con las antenas de todos los dispositivos y, de esta forma, aplicar técnicas de procesado espacio-temporal. El esquema de cooperación más sencillo es el canal con relays: todos los terminales que escuchen una comunicación entre dos puntos pueden ayudar a la fuente retransmitiendo lo que hayan recibido.En un sistema realista, los relays no disponen de información sobre el canal en trasmisión. En este escenario, los códigos espacio-temporales (STC, del inglés space-time coding) son la alternativa más eficiente para aprovechar la diversidad introducida por los relays. Sin embargo, los STC clásicos están diseñados para un número limitado y fijo de antenas transmisoras y no se adaptan bien a sistemas cooperativos donde el número de relays puede ser elevado y, sobretodo, puede variar en el tiempo, según los usuarios entren o salgan de la red. El problema principal es la necesidad de usar un código nuevo cada vez que cambie la configuración de la red, generando un importante tráfico de señalización.Esta tesis analiza un código espacio-temporal a bloques de dispersión lineal (LD-STBC, del inglés linear-dispersion space-time block coding), aleatorio y distribuido: a cada relay se le asigna una matriz aleatoria que aplica una transformación lineal al vector que contiene los símbolos de la fuente. Cada matriz se genera de forma independiente y sin ninguna relación con el número de usuarios involucrados. De esta manera, el número de nodos puede variar sin necesidad de modificar los códigos existentes.La forma más intuitiva de construir matrices de dispersión lineal independientes es que sus elementos sean variables aleatorias independientes e idénticamente distribuidas (i.i.d.). Por esta razón, se estudia primero la eficiencia espectral obtenida por este tipo de LD-STBC. Es importante remarcar que la eficiencia espectral es una cantidad aleatoria, ya que es una función de los códigos aleatorios anteriormente descritos. Sin embargo, cuando las dimensiones de las matrices crecen infinitamente pero manteniendo constante la tasa del código (relación entre número de símbolos de la fuente sobre el número de símbolos de los relays), la eficiencia espectral converge rápidamente hacia una cantidad determinista. Este resultado se demuestra usando la teoría de las matrices aleatorias. Por esta razón, el sistema se analiza aproximando la eficiencia espectral con su limite. Por ejemplo, la comparación con el canal directo entre fuente y destino permite definir unas condiciones suficientes en donde el sistema con relays es superior a la comunicación punto a punto.Posteriormente se debe analizar la probabilidad de outage, es decir la probabilidad de que, debido a la baja calidad del canal, la eficiencia espectral sea menor que la velocidad de transmisión solicitada por el sistema. Como ya se ha mencionado anteriormente, los relays se introducen para aumentar la diversidad del canal y, con ella, el número de caminos independientes entre la fuente y el receptor, reduciendo la probabilidad de outage. Para los LD-STBC i.i.d. las prestaciones en términos de outage dependen del tipo de relay (amplify and forward o decode and forward) y son función de la tasa del código, que debe ser cuidadosamente elegida para maximizar el orden de diversidad sin desperdiciar demasiados recursos.Finalmente, en el último capítulo de la tesis se considera otro tipo de LD-STBC, distinto del i.i.d. analizado hasta ahora. En este caso, las matrices de dispersión lineal siguen siendo independientes la una de la otra pero se añade la restricción de que cada una tenga columnas (o filas, según la tasa del código) ortogonales. Así, se consigue que el código siga siendo flexible con respecto a las variaciones en el número de usuarios, pero su estructura permite reducir la interferencia generada por cada relay, como se puede notar comparando su eficiencia espectral con la eficiencia espectral obtenida por el código i.i.d. Cabe destacar que el análisis asintótico de estos códigos (llamados isométricos) se basa en herramientas matemáticas más sofisticadas que las anteriores y, por lo tanto, es necesario un estudio más profundo para poder entender cómo se comporta en términos de outage. / In the last decade, cooperation among multiple terminals has been seen as one of the more promising strategies to improve transmission speed in wireless communications networks. Basically, the idea is to mimic an antenna array and apply distributed versions of well-known space-diversity techniques. In this context, the simplest cooperative scheme is the relay channel: all the terminals (relays) that overhear a point-to-point communication between a source and a destination may decide to aid the source by forwarding (relaying) its message.In a mobile system, it is common to assume that the relays do not have any information about the channel between them and the destination. Under this hypothesis, the best solution to exploit the diversity offered by multiple transmitting antennas is to use space-time coding (STC). However, classical STC's are designed for systems with a fixed and usually low number of antennas. Thus, they are not suitable for relaying in most mobile communications systems where the number of terminals is potentially large and may vary as users join or leave the network. For each new configuration, a new code has to be chosen and notified to the relays, introducing a set-up overhead of signaling traffic.In this dissertation we will propose and analyze a randomized distributed linear-dispersion space-time block code (LD-STBC): each relay is assigned a specific matrix which linearly transforms (left-multiplies) the column vector of source symbols. Each matrix is independently generated and does not depend on the total number of transmitters, which can thus change without interrupting data transmission for a new code--relay assignment.The more intuitive way to build independent linear-dispersion matrices is to fill them with independent and identically distributed (i.i.d.) random variables. Therefore, we will first consider these i.i.d. codes and characterize the resulting spectral efficiency. In order to analyze the performance achieved by the system, we consider a large-system analysis based on random matrix theory. We will show that the random spectral efficiency (function of the random linear-dispersion matrices) converges almost surely to a deterministic quantity when the dimensions of the code grow indefinitely while keeping constant the coding rate. Since convergence is very fast, the random spectral efficiency will be approximated by the deterministic limit in the subsequent analysis. By comparison with the direct link, sufficient conditions are derived for the superiority of relaying.Next, we will analyze the outage probability of the system, that is the probability that the spectral efficiency falls below a given target rate due to channel fading. The main purpose of diversity techniques is to introduce alternative paths from the source to the destination, so that data transmission does not fail when the direct link undergoes deep fading. We will show that the diversity behavior of LD-STBC relaying mainly depends on both the coding rate and the relaying strategy (amplify and forward or decode and forward). It is then important to choose the coding rate that maximizes the diversity order without wasting too many resources.To conclude the dissertation, we will consider a different code based on independent isometric Haar-distributed random linear-dispersion matrices. Thenew code maintains the flexibility of the previous one with respect to variations in the number of relays. However, the more complex structure of the codes allows a noticeable reduction of the interference generated by the relays. Unfortunately, isometric codes also require more sophisticated mathematical tools for their asymptotic analysis. For this reason, we simply introduce the problem by showing that it is possible to have some spectral-efficiency gain with respect to i.i.d. codes. The outage-probability analysis requires a more thorough understanding and will be the subject of future work.

This dissertation studies the diversity multiplexing tradeoff and the capacity of wireless multiple-relay network. In part 1, we study the setup of the parallel Multi-Input Multi-Output (MIMO) relay network. An amplify-and-forward relaying scheme, Incremental Cooperative Beamforming, is introduced and shown to achieve the capacity of the network in the asymptotic case of either the number of relays or the power of each relay goes to infinity. In part 2, we study the general setup of multi-antenna multi-hop multiple- relay network. We propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. Furthermore, we derive diversity- multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. It is shown that for single-antenna two-hop multiple- access multiple-relay (K > 1) networks (without direct link between the source(s) and the destination), the proposed RS scheme achieves the optimum DMT. In part 3, we characterize the maximum achievable diversity gain of the multi- antenna multi-hop relay network and we show that the proposed RS scheme achieves the maximum diversity gain. In part 4, RS scheme is utilized to investigate DMT of the general multi-antenna multiple-relay networks. First, we study the case of a multi-antenna full-duplex single-relay two-hop network, for which we show that the RS achieves the optimum DMT. Applying this result, we derive a new achievable DMT for the case of multi-antenna half-duplex parallel relay network. Interestingly, it turns out that the DMT of the RS scheme is optimum for the case of multi-antenna two parallel non-interfering half-duplex relays. Furthermore, we show that random unitary matrix multiplication also improves the DMT of the Non-Orthogonal AF relaying scheme in the case of a multi-antenna single relay channel. Finally, we study the general case of multi-antenna full-duplex relay networks and derive a new lower-bound on its DMT using the RS scheme. Finally, in part 5, we study the multiplexing gain of the general multi-antenna multiple-relay networks. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally, the argument is extended to the multicast and multi-access scenarios.

There has been phenomenal interest in applying space-time coding techniques in wireless communications in the last two decades. In general, the benefit of applying space-time codes in multiple-input, multiple-output (MIMO) wireless channels is an increase in transmission reliability or system throughput (capacity). However, such a benefit cannot be obtained in some wireless systems where size or other constraints preclude the use of multiple antennas. As such, wireless relay communications has recently been proposed as a means to provide spatial diversity in the face of this limitation. In this approach, some users or relay nodes assist the transmission of other users information. This dissertation contributes to the advancement of wireless relay communications by investigating the performance of various relaying signal processing methods under different practical fading environments. In particular, it examines two main relaying methods, namely decode-and-forward (DF) and amplify-and-forward (AF).<p> For DF, the focus is on the diversity analysis of relaying systems under various practical protocols when detection error at relays is taken into account. In order to effectively mitigate the phenomenon of error propagation, the smart relaying technique proposed by Wang et al. in [R1] is adopted. First, diversity analysis of a single-relay system under the scenario that only the relay is allowed to transmit in the second time slot (called Protocol II) is carried out. For Nakagami and Hoyt generalized fading channels, analytical and numerical results are provided to demonstrate that the system always obtains the maximal diversity when binary phase shift keying (BPSK) modulation is used. Second, a novel and low-complexity relaying system is proposed when smart relaying and equal gain combing (EGC) techniques are combined. In the proposed system, the destination requires only the phases of the channel state information in order to detect the transmitted signals. For the single-relay system with M-ary PSK modulation, it is shown that the system can achieve the maximal diversity under Nakagami and Hoyt fading channels. For the K-relay system, simulation results suggest that the maximal diversity can also be achieved. Finally, the diversity analysis for a smart relaying system under the scenario when both the source and relay are permitted to transmit in the second time slot (referred to as Protocol I) is presented. It is shown that Protocol I can achieve the same diversity order as Protocol II for the case of 1 relay. In addition, the diversity is very robust to the quality of the feedback channel as well as the accuracy of the quantization of the power scaling implemented at the relay.<p> For AF, the dissertation considers a fixed-gain multiple-relay system with maximal ratio combining (MRC) detection at the destination under Nakagami fading channels. Different from the smart relaying for DF, all the channel state information is assumed to be available at the destination in order to perform MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived. Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics of all the channels available at the destination, a novel power allocation (PA) is then proposed. The proposed PA shows significant performance gain over the conventional equal PA.