Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks

Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs). The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated. Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals. The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the DF and AF protocols. Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions

Energy Efficient, Cooperative Communication in Low-Power Wireless Networks

The increased interest in massive deployment of wireless sensors and network densification requires more innovation in low-latency communication across multi-hop networks. Moreover, the resource constrained nature of sensor nodes calls for more energy efficient transmission protocols, in order to increase the battery life of said devices. Therefore, it is important to investigate possible technologies that would aid in improving energy efficiency and decreasing latency in wireless sensor networks (WSN) while focusing on application specific requirements. To this end, and based on state of the art Glossy, a low-power WSN flooding protocol, this dissertation introduces two energy efficient, cooperative transmission schemes for low-power communication in WSNs, with the aim of achieving performance gains in energy efficiency, latency and power consumption. These approaches apply several cooperative transmission technologies such as physical layer network coding and transmit beamforming. Moreover, mathematical tools such as convex optimization and game theory are used in order to analytically construct the proposed schemes. Then, system level simulations are performed, where the proposed schemes are evaluated based on different criteria. First, in order to improve over all latency in the network as well as energy efficiency, MF-Glossy is proposed; a communication scheme that enables the simultaneous flooding of different packets from multiple sources to all nodes in the network. Using a communication-theoretic analysis, upper bounds on the performance of Glossy and MF-Glossy are determined. Further, simulation results show that MF-Glossy has the potential to achieve several-fold improvements in goodput and latency across a wide spectrum of network configurations at lower energy costs and comparable packet reception rates. Hardware implementation challenges are discussed as a step towards harnessing the potential of MF-Glossy in real networks, while focusing on key challenges and possible solutions. Second, under the assumption of available channel state information (CSI) at all nodes, centralized and distributed beamforming and power control algorithms are proposed and their performance is evaluated. They are compared in terms of energy efficiency to standard Glossy. Numerical simulations demonstrate that a centralized power control scheme can achieve several-fold improvements in energy efficiency over Glossy across a wide spectrum of network configurations at comparable packet reception rates. Furthermore, the more realistic scenario where CSI is not available at transmitting nodes is considered. To battle CSI unavailability, cooperation is introduced on two stages. First, cooperation between receiving and transmitting nodes is proposed for the process of CSI acquisition, where the receivers provide the transmitters with quantized (e.g. imperfect) CSI. Then, cooperation within transmitting nodes is proposed for the process of multi-cast transmit beamforming. In addition to an analytical formulation of the robust multi-cast beamforming problem with imperfect CSI, its performance is evaluated, in terms of energy efficiency, through numerical simulations. It is shown that the level of cooperation, represented by the number of limited feedback bits from receivers to transmitters, greatly impacts energy efficiency. To this end, the optimization problem of finding the optimal number of feedback bits B is formulated, as a programming problem, under QoS constraints of 5% maximum outage. Numerical simulations show that there exists an optimal number of feedback bits that maximizes energy efficiency. Finally, the effect of choosing cooperating transmitters on energy efficiency is studied, where it is shown that an optimum group of cooperating transmit nodes, also known as a transmit coalition, can be formed in order to maximize energy efficiency. The investigated techniques including optimum feedback bits and transmit coalition formation can achieve a 100% increase in energy efficiency when compared to state of the art Glossy under same operation requirements in very dense networks. In summary, the two main contributions in this dissertation provide insights on the possible performance gains that can be achieved when cooperative technologies are used in low-power wireless networks

A Critical Review of Physical Layer Security in Wireless Networking

Wireless networking has kept evolving with additional features and increasing capacity. Meanwhile, inherent characteristics of wireless networking make it more vulnerable than wired networks. In this thesis we present an extensive and comprehensive review of physical layer security in wireless networking. Different from cryptography, physical layer security, emerging from the information theoretic assessment of secrecy, could leverage the properties of wireless channel for security purpose, by either enabling secret communication without the need of keys, or facilitating the key agreement process. Hence we categorize existing literature into two main branches, namely keyless security and key-based security. We elaborate the evolution of this area from the early theoretic works on the wiretap channel, to its generalizations to more complicated scenarios including multiple-user, multiple-access and multiple-antenna systems, and introduce not only theoretical results but practical implementations. We critically and systematically examine the existing knowledge by analyzing the fundamental mechanics for each approach. Hence we are able to highlight advantages and limitations of proposed techniques, as well their interrelations, and bring insights into future developments of this area

Relay-aided Interference Alignment in Wireless Networks

Resource management in wireless networks is one of the key factors in maximizing the overall throughput. Contrary to popular belief, dividing the resources in a dense network does not yield the best results. A method that has been developed recently shares the spectrum amongst all the users in such a way that each node can potentially utilize about half of all the available resources. This new technique is often referred to as Interference Alignment and excels based on the fact that the amount of the network resources assigned to a user does not go to zero as the number of users in the network increases. Unfortunately it is still very difficult to implement the interference alignment concepts in practice. This thesis investigates some of the low-complexity solutions to integrate interference alignment ideas into the existing wireless networks. In the third and fourth chapters of this thesis, it is shown that introducing relays to a quasi-static wireless network can be very beneficial in terms of achieving higher degrees of freedom. The relays store the signals being communicated in the network and then send a linear combination of those signals. Using the proposed scheme, it is shown that although the relays cannot decode the original information, they can transform the equivalent channel in such a way that performing interference alignment becomes much easier. Investigating the required output power of the relays shows that it can scale either slower or faster than the output power of the main transmitters. This opens new doors for the applications that have constraints on the accessible output powers in the network nodes. The results are valid for both $X$ Channel and Interference Channel network topologies. In Chapter Five, the similarities between full-duplex transmitters and relays are examined. The results suggest that the transmitters can play the relay roles for offering easier interference alignment. Similar to the relay-based alignment, in the presented scheme full-duplex transmitters listen to the signals from other transmitters and use this information during the subsequent transmission periods. Studying the functionality of the full-duplex transmitters from the receivers' side shows the benefits of having a minimal cooperation between transmitters without even being able to decode the signals. It is also proved that the degrees of freedom for the $N$-user Interference Channel with full-duplex transmitters can be $\sqrt{\frac{N}{2}}$. The results offer an easy way to recover a portion of degrees of freedom with manageable complexity suited for practical systems

Linear Transmit-Receive Strategies for Multi-user MIMO Wireless Communications

Die Notwendigkeit zur Unterdrueckung von Interferenzen auf der einen Seite und zur Ausnutzung der durch Mehrfachzugriffsverfahren erzielbaren Gewinne auf der anderen Seite rueckte die raeumlichen Mehrfachzugriffsverfahren (Space Division Multiple Access, SDMA) in den Fokus der Forschung. Ein Vertreter der raeumlichen Mehrfachzugriffsverfahren, die lineare Vorkodierung, fand aufgrund steigender Anzahl an Nutzern und Antennen in heutigen und zukuenftigen Mobilkommunikationssystemen besondere Beachtung, da diese Verfahren das Design von Algorithmen zur Vorcodierung vereinfachen. Aus diesem Grund leistet diese Dissertation einen Beitrag zur Entwicklung linearer Sende- und Empfangstechniken fuer MIMO-Technologie mit mehreren Nutzern. Zunaechst stellen wir ein Framework zur Approximation des Datendurchsatzes in Broadcast-MIMO-Kanaelen mit mehreren Nutzern vor. In diesem Framework nehmen wir das lineare Vorkodierverfahren regularisierte Blockdiagonalisierung (RBD) an. Durch den Vergleich von Dirty Paper Coding (DPC) und linearen Vorkodieralgorithmen (z.B. Zero Forcing (ZF) und Blockdiagonalisierung (BD)) ist es uns moeglich, untere und obere Schranken fuer den Unterschied bezueglich Datenraten und bezueglich Leistung zwischen beiden anzugeben. Im Weiteren entwickeln wir einen Algorithmus fuer koordiniertes Beamforming (Coordinated Beamforming, CBF), dessen Loesung sich in geschlossener Form angeben laesst. Dieser CBF-Algorithmus basiert auf der SeDJoCo-Transformation und loest bisher vorhandene Probleme im Bereich CBF. Im Anschluss schlagen wir einen iterativen CBF-Algorithmus namens FlexCoBF (flexible coordinated beamforming) fuer MIMO-Broadcast-Kanaele mit mehreren Nutzern vor. Im Vergleich mit bis dato existierenden iterativen CBF-Algorithmen kann als vielversprechendster Vorteil die freie Wahl der linearen Sende- und Empfangsstrategie herausgestellt werden. Das heisst, jede existierende Methode der linearen Vorkodierung kann als Sendestrategie genutzt werden, waehrend die Strategie zum Empfangsbeamforming frei aus MRC oder MMSE gewaehlt werden darf. Im Hinblick auf Szenarien, in denen Mobilfunkzellen in Clustern zusammengefasst sind, erweitern wir FlexCoBF noch weiter. Hier wurde das Konzept der koordinierten Mehrpunktverbindung (Coordinated Multipoint (CoMP) transmission) integriert. Zuletzt stellen wir drei Moeglichkeiten vor, Kanalzustandsinformationen (Channel State Information, CSI) unter verschiedenen Kanalumstaenden zu erlangen. Die Qualitaet der Kanalzustandsinformationen hat einen starken Einfluss auf die Guete des Uebertragungssystems. Die durch unsere neuen Algorithmen erzielten Verbesserungen haben wir mittels numerischer Simulationen von Summenraten und Bitfehlerraten belegt.In order to combat interference and exploit large multiplexing gains of the multi-antenna systems, a particular interest in spatial division multiple access (SDMA) techniques has emerged. Linear precoding techniques, as one of the SDMA strategies, have obtained more attention due to the fact that an increasing number of users and antennas involved into the existing and future mobile communication systems requires a simplification of the precoding design. Therefore, this thesis contributes to the design of linear transmit and receive strategies for multi-user MIMO broadcast channels in a single cell and clustered multiple cells. First, we present a throughput approximation framework for multi-user MIMO broadcast channels employing regularized block diagonalization (RBD) linear precoding. Comparing dirty paper coding (DPC) and linear precoding algorithms (e.g., zero forcing (ZF) and block diagonalization (BD)), we further quantify lower and upper bounds of the rate and power offset between them as a function of the system parameters such as the number of users and antennas. Next, we develop a novel closed-form coordinated beamforming (CBF) algorithm (i.e., SeDJoCo based closed-form CBF) to solve the existing open problem of CBF. Our new algorithm can support a MIMO system with an arbitrary number of users and transmit antennas. Moreover, the application of our new algorithm is not only for CBF, but also for blind source separation (BSS), since the same mathematical model has been used in BSS application.Then, we further propose a new iterative CBF algorithm (i.e., flexible coordinated beamforming (FlexCoBF)) for multi-user MIMO broadcast channels. Compared to the existing iterative CBF algorithms, the most promising advantage of our new algorithm is that it provides freedom in the choice of the linear transmit and receive beamforming strategies, i.e., any existing linear precoding method can be chosen as the transmit strategy and the receive beamforming strategy can be flexibly chosen from MRC or MMSE receivers. Considering clustered multiple cell scenarios, we extend the FlexCoBF algorithm further and introduce the concept of the coordinated multipoint (CoMP) transmission. Finally, we present three strategies for channel state information (CSI) acquisition regarding various channel conditions and channel estimation strategies. The CSI knowledge is required at the base station in order to implement SDMA techniques. The quality of the obtained CSI heavily affects the system performance. The performance enhancement achieved by our new strategies has been demonstrated by numerical simulation results in terms of the system sum rate and the bit error rate

Advanced Signal Processing Techniques for Two-Way Relaying Networks and Full-Duplex Communication Systems

Sehr hohe Datenraten und ständig verfügbare Netzabdeckung in zukünftigen drahtlosen Netzwerken erfordern neue Algorithmen auf der physischen Schicht. Die Nutzung von Relais stellt ein vielversprechendes Verfahren dar, da die Netzabdeckung gesteigert werden kann. Zusätzlich steht hierdurch im Vergleich zu Kupfer- oder Glasfaserleitungen eine preiswerte Lösung zur Anbindung an die Netzinfrastruktur zur Verfügung. Traditionelle Einwege-Relais-Techniken (One-Way Relaying [OWR]) nutzen Halbduplex-Verfahren (HD-Verfahren), welche das Übertragungssystem ausbremst und zu spektralen Verlusten führt. Einerseits erlauben es Zweiwege-Relais-Techniken (Two-Way Relaying [TWR]), simultan sowohl an das Relais zu senden als auch von diesem zu empfangen, wodurch im Vergleich zu OWR das Spektrum effizienter genutzt wird. Aus diesem Grunde untersuchen wir Zweiwege-Relais und im Speziellen TWR-Systeme für den Mehrpaar-/Mehrnutzer-Betrieb unter Nutzung von Amplify-and-forward-Relais (AF-Relais). Derartige Szenarien leiden unter Interferenzen zwischen Paaren bzw. zwischen Nutzern. Um diesen Interferenzen Herr zu werden, werden hochentwickelte Signalverarbeitungsalgorithmen – oder in anderen Worten räumliche Mehrfachzugriffsverfahren (Spatial Division Multiple Access [SDMA]) – benötigt. Andererseits kann der spektrale Verlust durch den HD-Betrieb auch kompensiert werden, wenn das Relais im Vollduplexbetrieb arbeitet. Nichtsdestotrotz ist ein FD-Gerät in der Praxis aufgrund starker interner Selbstinterferenz (SI) und begrenztem Dynamikumfang des Tranceivers schwer zu realisieren. Aus diesem Grunde sollten fortschrittliche Verfahren zur SI-Ünterdrückung entwickelt werden. Diese Dissertation trägt diesen beiden Zielen Rechnung, indem optimale und/oder effiziente algebraische Lösungen entwickelt werden, welche verschiedenen Nutzenfunktionen, wie Summenrate und minimale Sendeleistung, maximieren.Im ersten Teil studieren wir zunächst Mehrpaar-TWR-Netzwerke mit einem einzelnen Mehrantennen-AF-Relais. Dieser Anwendungsfall kann auch so betrachtet werden, dass sich mehrere verschiedene Dienstoperatoren Relais und Spektrum teilen, wobei verschiedene Nutzerpaare zu verschiedenen Dienstoperatoren gehören. Aktuelle Ansätzen zielen auf Interferenzunterdrückung ab. Wir schlagen ein auf Projektion basiertes Verfahren zur Trennung mehrerer Dienstoperatoren (projection based separation of multiple operators [ProBaSeMO]) vor. ProBaSeMO ist leicht anpassbar für den Fall, dass jeder Nutzer mehrere Antennen besitzt oder unterschiedliche Systemdesignkriterien angewendet werden müssen. Als Bewertungsmaßstab für ProBaSeMO entwickeln wir optimale Algorithmen zur Maximierung der Summenrate, zur Minimierung der Sendeleistung am Relais oder zur Maximierung des minimalen Signal-zu-Interferenz-und-Rausch-Verhältnisses (Signal to Interference and Noise Ratio [SINR]) am Nutzer. Zur Maximierung der Summenrate wurden spezifische gradientenbasierte Methoden entwickelt, die unabhängig davon sind, ob ein Nutzer mit einer oder mehr Antennen ausgestattet ist. Um im Falle eines „Worst-Case“ immer noch eine polynomielle Laufzeit zu garantieren, entwickelten wir einen Algorithmus mit polynomieller Laufzeit. Dieser ist inspiriert von der „Polynomial Time Difference of Convex Functions“-Methode (POTDC-Methode). Bezüglich der Summenrate des Systems untersuchen wir zuletzt, welche Bedingungen erfüllt sein müssen, um einen Gewinn durch gemeinsames Nutzen zu erhalten. Hiernach untersuchen wir die Maximierung der Summenrate eines Mehrpaar-TWR-Netzwerkes mit mehreren Einantennen-AF-Relais und Einantennen-Nutzern. Das daraus resultierende Problem der Summenraten-Maximierung, gebunden an eine bestimmte Gesamtsendeleistung aller Relais im Netzwerk, ist ähnlich dem des vorangegangenen Szenarios. Dementsprechend kann eine optimale Lösung für das eine Szenario auch für das jeweils andere Szenario genutzt werden. Weiterhin werden basierend auf dem Polynomialzeitalgorithmus global optimale Lösungen entwickelt. Diese Lösungen sind entweder an eine maximale Gesamtsendeleistung aller Relais oder an eine maximale Sendeleistung jedes einzelnen Relais gebunden. Zusätzlich entwickeln wir suboptimale Lösungen, die effizient in ihrer Laufzeit sind und eine Approximation der optimalen Lösung darstellen. Hiernach verlegen wir unser Augenmerk auf ein Mehrpaar-TWR-Netzwerk mit mehreren Mehrantennen-AF-Relais und mehreren Repeatern. Solch ein Szenario ist allgemeiner, da die vorherigen beiden Szenarien als spezielle Realisierungen dieses Szenarios aufgefasst werden können. Das Interferenz-Management in diesem Szenario ist herausfordernder aufgrund der vorhandenen Repeater. Interferenzneutralisierung (IN) stellt eine Lösung dar, um diese Art Interferenz zu handhaben. Im Zuge dessen werden notwendige und ausreichende Bedingungen zur Aufhebung der Interferenz hergeleitet. Weiterhin wird ein Framework entwickelt, dass verschiedene Systemnutzenfunktionen optimiert, wobei IN im jeweiligen Netzwerk vorhanden sein kann oder auch nicht. Dies ist unabhängig davon, ob die Relais einer maximalen Gesamtsendeleistung oder einer individuellen maximalen Sendeleistung unterliegen. Letztendlich entwickeln wir ein Übertragungsverfahren sowie ein Vorkodier- und Dekodierverfahren für Basisstationen (BS) in einem TWR-assistierten Mehrbenutzer-MIMO-Downlink-Kanal. Im Vergleich mit dem Mehrpaar-TWR-Netzwerk leidet dieses Szenario unter Interferenzen zwischen den Kanälen. Wir entwickeln drei suboptimale Algorithmen, welche auf Kanalinversion basieren. ProBaSeMO und „Zero-Forcing Dirty Paper Coding“ (ZFDPC), welche eine geringe Zeitkomplexität aufweisen, schaffen eine Balance zwischen Leistungsfähigkeit und Komplexität. Zusätzlich gibt es jeweils nur geringe Einbrüche in stark beanspruchten Kommunikationssystemen.Im zweiten Teil untersuchen wir Techniken zur SI-Unterdrückung, um den FD-Gewinn in einem Punkt-zu-Punkt-System auszunutzen. Zunächst entwickeln wir ein Übertragungsverfahren, dass auf SI Rücksicht nimmt und die SI-Unterdrückung gegen den Multiplexgewinn abwägt. Die besten Ergebnisse werden durch die perfekte Kenntnis des Kanals erzielt, was praktisch nicht genau der Fall ist. Aus diesem Grund werden Übertragungstechniken für den „Worst Case“ entwickelt, die den Kanalschätzfehlern Rechnung tragen. Diese Fehler werden deterministisch modelliert und durch Ellipsoide beschränkt. In praktischen Szenarien ist der HF-Schaltkreise nicht perfekt. Dies hat Einfluss auf die Verfahren zur SI-Unterdrückung und führt zu einer Restselbstinterferenz. Wir entwickeln effiziente Übertragungstechniken mittels Beamforming, welche auf dem Signal-zu-Verlust-und-Rausch-Verhältnis (signal to leakage plus noise ratio [SLNR]) aufbauen, um Unvollkommenheiten der HF-Schaltkreise auszugleichen. Zusätzlich können alle Designkonzepte auf FD-OWR-Systeme erweitert werden.To enable ultra-high data rate and ubiquitous coverage in future wireless networks, new physical layer techniques are desired. Relaying is a promising technique for future wireless networks since it can boost the coverage and can provide low cost wireless backhauling solutions, as compared to traditional wired backhauling solutions via fiber and copper. Traditional one-way relaying (OWR) techniques suffer from the spectral loss due to the half-duplex (HD) operation at the relay. On one hand, two-way relaying (TWR) allows the communication partners to transmit to and/or receive from the relay simultaneously and thus uses the spectrum more efficiently than OWR. Therefore, we study two-way relays and more specifically multi-pair/multi-user TWR systems with amplify-and-forward (AF) relays. These scenarios suffer from inter-pair or inter-user interference. To deal with the interference, advanced signal processing algorithms, in other words, spatial division multiple access (SDMA) techniques, are desired. On the other hand, if the relay is a full-duplex (FD) relay, the spectral loss due to a HD operation can also be compensated. However, in practice, a FD device is hard to realize due to the strong loop-back self-interference and the limited dynamic range at the transceiver. Thus, advanced self-interference suppression techniques should be developed. This thesis contributes to the two goals by developing optimal and/or efficient algebraic solutions for different scenarios subject to different utility functions of the system, e.g., sum rate maximization and transmit power minimization. In the first part of this thesis, we first study a multi-pair TWR network with a multi-antenna AF relay. This scenario can be also treated as the sharing of the relay and the spectrum among multiple operators assuming that different pairs of users belong to different operators. Existing approaches focus on interference suppression. We propose a projection based separation of multiple operators (ProBaSeMO) scheme, which can be easily extended when each user has multiple antennas or when different system design criteria are applied. To benchmark the ProBaSeMO scheme, we develop optimal relay transmit strategies to maximize the system sum rate, minimize the required transmit power at the relay, or maximize the minimum signal to interference plus noise ratio (SINR) of the users. Specifically for the sum rate maximization problem, gradient based methods are developed regardless whether each user has a single antenna or multiple antennas. To guarantee a worst-case polynomial time solution, we also develop a polynomial time algorithm which has been inspired by the polynomial time difference of convex functions (POTDC) method. Finally, we analyze the conditions for obtaining the sharing gain in terms of the sum rate. Then we study the sum rate maximization problem of a multi-pair TWR network with multiple single antenna AF relays and single antenna users. The resulting sum rate maximization problem, subject to a total transmit power constraint of the relays in the network, yields a similar problem structure as in the previous scenario. Therefore the optimal solution for one scenario can be used for the other. Moreover, a global optimal solution, which is based on the polyblock approach, and several suboptimal solutions, which are more computationally efficient and approximate the optimal solution, are developed when there is a total transmit power constraint of the relays in the network or each relay has its own transmit power constraint. We then shift our focus to a multi-pair TWR network with multiple multi-antenna AF relays and multiple dumb repeaters. This scenario is more general because the previous two scenarios can be seen as special realizations of this scenario. The interference management in this scenario is more challenging due to the existence of the repeaters. Interference neutralization (IN) is a solution for dealing with this kind of interference. Thereby, necessary and sufficient conditions for neutralizing the interference are derived. Moreover, a general framework to optimize different system utility functions in this network with or without IN is developed regardless whether the AF relays in the network have a total transmit power limit or individual transmit power limits. Finally, we develop the relay transmit strategy as well as base station (BS) precoding and decoding schemes for a TWR assisted multi-user MIMO (MU-MIMO) downlink channel. Compared to the multi-pair TWR network, this scenario suffers from the co-channel interference. We develop three suboptimal algorithms which are based on channel inversion, ProBaSeMO and zero-forcing dirty paper coding (ZFDPC), which has a low computational complexity, provides a balance between the performance and the complexity, and suffers only a little when the system is heavily loaded, respectively.In the second part of this thesis, we investigate self-interference (SI) suppression techniques to exploit the FD gain for a point-to-point MIMO system. We first develop SI aware transmit strategies, which provide a balance between the SI suppression and the multiplexing gain of the system. To get the best performance, perfect channel state information (CSI) is needed, which is imperfect in practice. Thus, worst case transmit strategies to combat the imperfect CSI are developed, where the CSI errors are modeled deterministically and bounded by ellipsoids. In real word applications, the RF chain is imperfect. This affects the performance of the SI suppression techniques and thus results in residual SI. We develop efficient transmit beamforming techniques, which are based on the signal to leakage plus noise ratio (SLNR) criterion, to deal with the imperfections in the RF chain. All the proposed design concepts can be extended to FD OWR systems