This dissertation addresses multi-layer optimization aspects of multiple input multiple output (MIMO) and deep learning-based communication systems. The initial focus is on the rate optimization for multi-user MIMO (MU-MIMO) configurations; specifically, multiple access channel (MAC) and interference channel (IC). First, the ergodic sum rates of MIMO MAC and IC configurations are determined by jointly integrating the error and overhead effects due to channel estimation (training) and feedback into the rate optimization. Then, we investigated methods that will increase the achievable rate for parallel Gaussian IC (PGIC) which is a special case of MIMO IC where there is no interference between multiple antenna elements. We derive a generalized iterative waterfilling algorithm for power allocation that maximizes the ergodic achievable rate. We verified the sum rate improvement with our proposed scheme through extensive simulation tests. Next, we introduce a novel physical layer scheme for single user MIMO spatial multiplexing systems based on unsupervised deep learning using an autoencoder. Both transmitter and receiver are designed as feedforward neural networks (FNN) and constellation diagrams are optimized to minimize the symbol error rate (SER) based on the channel characteristics. We first evaluate the SER in the presence of a constant Rayleigh-fading channel as a performance upper bound. Then, we quantize the Gaussian distribution and train the autoencoder with multiple quantized channel matrices. The channel is provided as an input to both the transmitter and the receiver. The performance exceeds that of conventional communication systems both when the autoencoder is trained and tested with single and multiple channels and the performance gain is sustained after accounting for the channel estimation error. Moreover, we evaluate the performance with increasing number of quantization points and when there is a difference between training and test channels. We show that the performance loss is minimal when training is performed with sufficiently large number of quantization points and number of channels. Finally, we develop a distributed and decentralized MU-MIMO link selection and activation protocol that enables MU-MIMO operation in wireless networks. We verified the performance gains with the proposed protocol in terms of average network throughput. / Doctor of Philosophy / Multiple Input Multiple Output (MIMO) wireless systems include multiple antennas both at the transmitter and receiver and they are widely used today in cellular and wireless local area network systems to increase robustness, reliability and data rate. Multi-user MIMO (MU-MIMO) configurations include multiple access channel (MAC) where multiple transmitters communicate simultaneously with a single receiver; interference channel (IC) where multiple transmitters communicate simultaneously with their intended receivers; and broadcast channel (BC) where a single transmitter communicates simultaneously with multiple receivers. Channel state information (CSI) is required at the transmitter to precode the signal and mitigate interference effects. This requires CSI to be estimated at the receiver and transmitted back to the transmitter in a feedback loop. Errors occur during both channel estimation and feedback processes. We initially analyze the achievable rate of MAC and IC configurations when both channel estimation and feedback errors are taken into account in the capacity formulations. We treat the errors associated with channel estimation and feedback as additional noise. Next, we develop methods to maximize the achievable rate for IC by using interference cancellation techniques at the receivers when the interference is very strong. We consider parallel Gaussian IC (PGIC) which is a special case of MIMO IC where there is no interference between multiple antenna elements. We develop a power allocation scheme which maximizes the ergodic achievable rate of the communication systems. We verify the performance improvement with our proposed scheme through simulation tests. Standard optimization techniques are used to determine the fundamental limits of MIMO communications systems. However, there is still a gap between current operational systems and these limits due to complexity of these solutions and limitations in their assumptions. Next, we introduce a novel physical layer scheme for MIMO systems based on machine learning; specifically, unsupervised deep learning using an autoencoder. An autoencoder consists of an encoder and a decoder that compresses and decompresses data, respectively. We designed both the encoder and the decoder as feedforward neural networks (FNNs). In our case, encoder performs transmitter functionalities such as modulation and error correction coding and decoder performs receiver functionalities such as demodulation and decoding as part of the communication system. Channel is included as an additional layer between the encoder and decoder. By incorporating the channel effects in the design process of the autoencoder and jointly optimizing the transmitter and receiver, we demonstrate the performance gains over conventional MIMO communication schemes. Finally, we develop a distributed and decentralized MU-MIMO link selection and activation protocol that enables MU-MIMO operation in wireless networks. We verified the performance gains with the proposed protocol in terms of average network throughput.

With the increasing number of wireless devices and the phenomenal amount of data that is being generated by them, there is a growing interest in the wireless communications community to complement the traditional model-driven design approaches with data-driven machine learning (ML)-based solutions. However, managing the large-scale multi-dimensional data to maintain the efficiency and scalability of the ML algorithms has obviously been a challenge. Tensors provide a useful framework to represent multi-dimensional data in an integrated manner by preserving relationships in data across different dimensions. This thesis studies two new applications of tensors to ML for wireless communications where the tensor structure of the concerned data is exploited in novel ways. The first contribution of this thesis is a tensor learning-based low-complexity precoder codebook design technique for a full-dimension multiple-input multiple-output (FD-MIMO) system with a uniform planar antenna (UPA) array at the transmitter (Tx) whose channel distribution is available through a dataset. Represented as a tensor, the FD-MIMO channel is further decomposed using a tensor decomposition technique to obtain an optimal precoder which is a function of Kronecker-Product (KP) of two low-dimensional precoders, each corresponding to the horizontal and vertical dimensions of the FD-MIMO channel. From the design perspective, we have made contributions in deriving a criterion for optimal product precoder codebooks using the obtained low-dimensional precoders. We show that this product codebook design problem is an unsupervised clustering problem on a Cartesian Product Grassmann Manifold (CPM), where the optimal cluster centroids form the desired codebook. We further simplify this clustering problem to a $K$-means algorithm on the low-dimensional factor Grassmann manifolds (GMs) of the CPM which correspond to the horizontal and vertical dimensions of the UPA, thus significantly reducing the complexity of precoder codebook construction when compared to the existing codebook learning techniques. The second contribution of this thesis is a tensor-based bandwidth-efficient gradient communication technique for federated learning (FL) with convolutional neural networks (CNNs). Concisely, FL is a decentralized ML approach that allows to jointly train an ML model at the server using the data generated by the distributed users coordinated by a server, by sharing only the local gradients with the server and not the raw data. Here, we focus on efficient compression and reconstruction of convolutional gradients at the users and the server, respectively. To reduce the gradient communication overhead, we compress the sparse gradients at the users to obtain their low-dimensional estimates using compressive sensing (CS)-based technique and transmit to the server for joint training of the CNN. We exploit a natural tensor structure offered by the convolutional gradients to demonstrate the correlation of a gradient element with its neighbors. We propose a novel prior for the convolutional gradients that captures the described spatial consistency along with its sparse nature in an appropriate way. We further propose a novel Bayesian reconstruction algorithm based on the Generalized Approximate Message Passing (GAMP) framework that exploits this prior information about the gradients. Through the numerical simulations, we demonstrate that the developed gradient reconstruction method improves the convergence of the CNN model. / Master of Science / The increase in the number of wireless and mobile devices have led to the generation of massive amounts of multi-modal data at the users in various real-world applications including wireless communications. This has led to an increasing interest in machine learning (ML)-based data-driven techniques for communication system design. The native setting of ML is {em centralized} where all the data is available on a single device. However, the distributed nature of the users and their data has also motivated the development of distributed ML techniques. Since the success of ML techniques is grounded in their data-based nature, there is a need to maintain the efficiency and scalability of the algorithms to manage the large-scale data. Tensors are multi-dimensional arrays that provide an integrated way of representing multi-modal data. Tensor algebra and tensor decompositions have enabled the extension of several classical ML techniques to tensors-based ML techniques in various application domains such as computer vision, data-mining, image processing, and wireless communications. Tensors-based ML techniques have shown to improve the performance of the ML models because of their ability to leverage the underlying structural information in the data. In this thesis, we present two new applications of tensors to ML for wireless applications and show how the tensor structure of the concerned data can be exploited and incorporated in different ways. The first contribution is a tensor learning-based precoder codebook design technique for full-dimension multiple-input multiple-output (FD-MIMO) systems where we develop a scheme for designing low-complexity product precoder codebooks by identifying and leveraging a tensor representation of the FD-MIMO channel. The second contribution is a tensor-based gradient communication scheme for a decentralized ML technique known as federated learning (FL) with convolutional neural networks (CNNs), where we design a novel bandwidth-efficient gradient compression-reconstruction algorithm that leverages a tensor structure of the convolutional gradients. The numerical simulations in both applications demonstrate that exploiting the underlying tensor structure in the data provides significant gains in their respective performance criteria.

A new communication paradigm is foreseen for beyond 2020 society, due to the emergence of new broadband services and the Internet of Things era. The set of requirements imposed by these new applications is large and diverse, aiming to provide a ubiquitous broadband connectivity. Research community has been working in the last decade towards the definition of the 5G mobile wireless networks that will provide the proper mechanisms to reach these challenging requirements. In this framework, three key research directions have been identified for the improvement of capacity in 5G: the increase of the spectral efficiency by means of, for example, the use of massive MIMO technology, the use of larger amounts of spectrum by utilizing the millimeter wave band, and the network densification by deploying more base stations per unit area. This dissertation addresses densification as the main enabler for the broadband and massive connectivity required in future 5G networks. To this aim, this Thesis focuses on the study of the UDN. In particular, a set of technology enablers that can lead UDN to achieve their maximum efficiency and performance are investigated, namely, the use of higher frequency bands for the benefit of larger bandwidths, the use of massive MIMO with distributed antenna systems, and the use of distributed radio resource management techniques for the inter-cell interference coordination. Firstly, this Thesis analyzes whether there exists a fundamental performance limit related with densification in cellular networks. To this end, the UDN performance is evaluated by means of an analytical model consisting of a 1-dimensional network deployment with equally spaced BS. The inter-BS distance is decreased until reaching the limit of densification when this distance approaches 0. The achievable rates in networks with different inter-BS distances are analyzed for several levels of transmission power availability, and for various types of cooperation among cells. Moreover, UDN performance is studied in conjunction with the use of a massive number of antennas and larger amounts of spectrum. In particular, the performance of hybrid beamforming and precoding MIMO schemes are assessed in both indoor and outdoor scenarios with multiple cells and users, working in the mmW frequency band. On the one hand, beamforming schemes using the full-connected hybrid architecture are analyzed in BS with limited number of RF chains, identifying the strengths and weaknesses of these schemes in a dense-urban scenario. On the other hand, the performance of different indoor deployment strategies using HP in the mmW band is evaluated, focusing on the use of DAS. More specifically, a DHP suitable for DAS is proposed, comparing its performance with that of HP in other indoor deployment strategies. Lastly, the presence of practical limitations and hardware impairments in the use of hybrid architectures is also investigated. Finally, the investigation of UDN is completed with the study of their main limitation, which is the increasing inter-cell interference in the network. In order to tackle this problem, an eICIC scheduling algorithm based on resource partitioning techniques is proposed. Its performance is evaluated and compared to other scheduling algorithms under several degrees of network densification. After the completion of this study, the potential of UDN to reach the capacity requirements of 5G networks is confirmed. Nevertheless, without the use of larger portions of spectrum, a proper interference management and the use of a massive number of antennas, densification could turn into a serious problem for mobile operators. Performance evaluation results show large system capacity gains with the use of massive MIMO techniques in UDN, and even greater when the antennas are distributed. Furthermore, the application of ICIC techniques reveals that, besides the increase in system capacity, it brings significant energy savings to UDNs. / A partir del año 2020 se prevé que un nuevo paradigma de comunicación surja en la sociedad, debido a la aparición de nuevos servicios y la era del Internet de las cosas. El conjunto de requisitos impuesto por estas nuevas aplicaciones es muy amplio y diverso, y tiene como principal objetivo proporcionar conectividad de banda ancha y universal. En las últimas décadas, la comunidad científica ha estado trabajando en la definición de la 5G de redes móviles que brindará los mecanismos necesarios para garantizar estos requisitos. En este marco, se han identificado tres mecanismos clave para conseguir el necesario incremento de capacidad de la red: el aumento de la eficiencia espectral a través de, por ejemplo, el uso de tecnologías MIMO masivas, la utilización de mayores porciones del espectro en frecuencia y la densificación de la red mediante el despliegue de más estaciones base por área. Esta Tesis doctoral aborda la densificación como el principal mecanismo que permitirá la conectividad de banda ancha y universal requerida en la 5G, centrándose en el estudio de las Redes Ultra Densas o UDNs. En concreto, se analiza el conjunto de tecnologías habilitantes que pueden llevar a las UDNs a obtener su máxima eficiencia y prestaciones, incluyendo el uso de altas frecuencias para el aprovechamiento de mayores anchos de banda, la utilización de MIMO masivo con sistemas de antenas distribuidas y el uso de técnicas de reparto de recursos distribuidas para la coordinación de interferencias. En primer lugar, se analiza si existe un límite fundamental en la mejora de las prestaciones en relación a la densificación. Con este fin, las prestaciones de las UDNs se evalúan utilizando un modelo analítico de red unidimensional con BSs equiespaciadas, en el que la distancia entre BSs se disminuye hasta alcanzar el límite de densificación cuando ésta se aproxima a 0. Las tasas alcanzables en redes con distintas distancias entre BSs son analizadas, considerando distintos niveles de potencia disponible en la red y varios grados de cooperación entre celdas. Además, el comportamiento de las UDNs se estudia junto al uso masivo de antenas y la utilización de anchos de banda mayores. Más concretamente, las prestaciones de ciertas técnicas híbridas MIMO de precodificación y beamforming se examinan en la banda milimétrica. Por una parte, se analizan esquemas de beamforming en BSs con arquitectura híbrida en función de la disponibilidad de cadenas de radiofrecuencia en escenarios exteriores. Por otra parte, se evalúan las prestaciones de ciertos esquemas de precodificación híbrida en escenarios interiores, utilizando distintos despliegues y centrando la atención en los sistemas de antenas distribuidos o DAS. Además, se propone un algoritmo de precodificación híbrida específico para DAS, y se evalúan y comparan sus prestaciones con las de otros algoritmos de precodificación utilizados. Por último, se investiga el impacto en las prestaciones de ciertas limitaciones prácticas y deficiencias introducidas por el uso de dispositivos no ideales. Finalmente, el estudio de las UDNs se completa con el análisis de su principal limitación, el nivel creciente de interferencia en la red. Para ello, se propone un algoritmo de control de interferencias basado en la partición de recursos. Sus prestaciones son evaluadas y comparadas con las de otras técnicas de asignación de recursos. Tras este estudio, se puede afirmar que las UDNs tienen gran potencial para la consecución de los requisitos de la 5G. Sin embargo, sin el uso conjunto de mayores porciones del espectro, adecuadas técnicas de control de la interferencia y el uso masivo de antenas, las UDNs pueden convertirse en serios obstáculos para los operadores móviles. Los resultados de la evaluación de prestaciones de estas tecnologías confirman el gran aumento de la capacidad de las redes mediante el uso masivo de antenas y la introducción de mecanismos de I / A partir de l'any 2020 es preveu un nou paradigma de comunicació en la societat, degut a l'aparició de nous serveis i la era de la Internet de les coses. El conjunt de requeriments imposat per aquestes noves aplicacions és ampli i divers, i té com a principal objectiu proporcionar connectivitat universal i de banda ampla. En les últimes dècades, la comunitat científica ha estat treballant en la definició de la 5G, que proveirà els mecanismes necessaris per a garantir aquests exigents requeriments. En aquest marc, s'han identificat tres mecanismes claus per a aconseguir l'increment necessari en la capacitat: l'augment de l'eficiència espectral a través de, per exemple, l'ús de tecnologies MIMO massives, la utilització de majors porcions de l'espectre i la densificació mitjançant el desplegament de més estacions base per àrea. Aquesta Tesi aborda la densificació com a principal mecanisme que permetrà la connectivitat de banda ampla i universal requerida en la 5G, centrant-se en l' estudi de les xarxes ultra denses (UDNs). Concretament, el conjunt de tecnologies que poden dur a les UDNs a la seua màxima eficiència i prestacions és analitzat, incloent l'ús d'altes freqüències per a l'aprofitament de majors amplàries de banda, la utilització de MIMO massiu amb sistemes d'antenes distribuïdes i l'ús de tècniques distribuïdes de repartiment de recursos per a la coordinació de la interferència. En primer lloc, aquesta Tesi analitza si existeix un límit fonamental en les prestacions en relació a la densificació. Per això, les prestacions de les UDNs s'avaluen utilitzant un model analític unidimensional amb estacions base equidistants, en les quals la distància entre estacions base es redueix fins assolir el límit de densificació quan aquesta distància s'aproxima a 0. Les taxes assolibles en xarxes amb diferents distàncies entre estacions base s'analitzen considerant diferents nivells de potència i varis graus de cooperació entre cel·les. A més, el comportament de les UDNs s'estudia conjuntament amb l'ús massiu d'antenes i la utilització de majors amplàries de banda. Més concretament, les prestacions de certes tècniques híbrides MIMO de precodificació i beamforming s'examinen en la banda mil·limètrica. D'una banda, els esquemes de beamforming aplicats a estacions base amb arquitectures híbrides és analitzat amb disponibilitat limitada de cadenes de radiofreqüència a un escenari urbà dens. D'altra banda, s'avaluen les prestacions de certs esquemes de precodificació híbrida en escenaris d'interior, utilitzant diferents estratègies de desplegament i centrant l'atenció en els sistemes d' antenes distribuïdes (DAS). A més, es proposa un algoritme de precodificació híbrida distribuïda per a DAS, i s'avaluen i comparen les seues prestacions amb les de altres algoritmes. Per últim, s'investiga l'impacte de les limitacions pràctiques i altres deficiències introduïdes per l'ús de dispositius no ideals en les prestacions de tots els esquemes anteriors. Finalment, l' estudi de les UDNs es completa amb l'anàlisi de la seua principal limitació, el nivell creixent d'interferència entre cel·les. Per tractar aquest problema, es proposa un algoritme de control d'interferències basat en la partició de recursos. Les prestacions de l'algoritme proposat s'avaluen i comparen amb les d'altres tècniques d'assignació de recursos. Una vegada completat aquest estudi, es pot afirmar que les UDNs tenen un gran potencial per aconseguir els ambiciosos requeriments plantejats per a la 5G. Tanmateix, sense l'ús conjunt de majors amplàries de banda, apropiades tècniques de control de la interferència i l'ús massiu d'antenes, les UDNs poden convertir-se en seriosos obstacles per als operadors mòbils. Els resultats de l'avaluació de prestacions d' aquestes tecnologies confirmen el gran augment de la capacitat de les xarxes obtingut mitjançant l'ús massiu d'antenes i la introducci / Giménez Colás, S. (2017). Ultra Dense Networks Deployment for beyond 2020 Technologies [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/86204

No / An investigation into the wavelet packet transform (WPT) modulation scheme for Multiple Input Multiple Output (MIMO) band-limited systems is presented. The implementation involves using the WPT as the base multiplexing technology at baseband, instead of the traditional Fast Fourier Transform (FFT) common in Orthogonal Frequency Division Multiplexing (OFDM) systems. An investigation for a WPT-MIMO multicarrier system, using the Alamouti diversity technique, is presented. Results are consistent with those in the original Alamouti work. The scheme is then implemented for WPT-MIMO and FFTMIMO cases with extended receiver diversity, namely 2 ×Nr MIMO systems, where Nr is the number of receiver elements. It is found that the diversity gain decreases with increasing receiver diversity and that WPT-MIMO systems can be more advantageous than FFT-based MIMO-OFDM systems.

This work deals with the design of MT transmit, MR receive antenna MIMO (Multiple Input Multiple Output) communication system where the transmitter performs a linear operation on data. This linear precoding model includes systems which involve signal shaping for achieving higher data rates, uncoded MIMO Multicarrier and Single-Carrier systems and, the more recent, MIMO-OFDM (Orthogonal Frequency Division Multiplexing) systems employing full diversity Space-Frequency codes. The objective of this work is to design diversity centric and rate centric linear precoded MIMO systems whose performance is better than the existing designs. In particular, we consider MIMO-OFDM systems, Zero Padded MIMO systems and MIMO systems with limited rate feedback. Design of full diversity MIMO-OFDM systems of rate symbol per channel use (1 s/ pcu) : In literature, MIMO-OFDM systems exploiting full diversity at a rate of 1 s/ pcu are based on a few specific Space-Frequency (SF)/ Space-Time-Frequency (STF) codes. In this work, we devise a general parameterized framework for the design of MIMO-OFDM systems employing full diversity STF codes of rate 1 s/ pcu. This framework unifies all existing designs and provides tools for the design of new systems with interesting properties and superior performance. Apart from rate and diversity, the parameters of the framework are designed for a low complexity receiver. The parameters of the framework usually depend on the channel characteristics (number of multipath, Delay Profile (DP)). When channel characteristics are available at the transmitter, a procedure to optimize the performance of STF codes is provided. The resulting codes are termed as DP optimized codes. Designs obtained using the optimization are illustrated and their performance is shown to be better than the existing ones. To cater to the scenarios where channel characteristics are not available at the transmitter, a complete characterization of a class of full diversity DP Independent (DPI) STF codes is provided. These codes exploit full diversity on channels with a given number of multipath irrespective of their characteristics. Design of DP optimized STF codes and DPI codes from the same framework highlights the flexibility of the framework. Design of Zero Padded (ZP) MIMO systems : While the MIMO-OFDM transmitter needs to precode data for exploiting channel induced multipath diversity, ZP MIMO systems with ML receivers are shown to exploit multipath diversity without any precoding. However, the receiver complexity of such systems is enormous and hence a study ZP MIMO system with linear receivers is undertaken. Central to this study involves devising low complexity receivers and deriving the diversity gain of linear receivers. Reduced complexity receiver implementations are presented for two classes of precoding schemes. An upper bound on the diversity gain of linear receivers is evaluated for certain precoding schemes. For uncoded systems operating on a channel of length L, this bound is shown to be MRL_MT +1 for uncoded transmissions, i.e, such systems tend to exploit receiver and multipath diversities. On the other hand, MIMO-OFDM systems designed earlier have to trade diversity with receiver complexity. These observations motivate us to use ZP MIMO systems with linear receivers for channels with large delay spread when receiver complexity is at a premium. Design examples highlighting the attractiveness of ZP systems when employed on channels with large delay spread are also presented. Efficient design of MIMO systems with limited feedback : Literature presents a number of works that consider the design of MIMO systems with partial feedback. The works that consider feedback of complete CSI, however, do not provide for an efficient system design. In this work, we consider two schemes, Correlation matrix feedback and Channel information feedback that convey complete CSI to the transmitter. This CSI is perturbed due to various impairments. A perturbation analysis is carried out to study the variations in mutual information for each of the proposed schemes. For ergodic channels, this analysis is used to design a MIMO system with a limited rate feedback. Using a codebook based approach, vector quantizers are designed to minimize the loss in ergodic capacity for each of the proposed schemes. The efficiency of the design stems from the ability to obtain closed-form expression for centroids during the iterative vector quantizer design. The performance of designed vector quantizers compare favorably with the existing designs. The vector quantizer design for channel information feedback is robust in the sense that the same codebook can be used across all operating SNR. Use of vector quantizers for improving the outage performance is also presented.

The research reported in this thesis is concerned with robust precoder and transceiver optimization in multiuser multi-antenna wireless communication systems in the presence of imperfect channel state information(CSI). Precoding at the transmit side, which utilizes the CSI, can improve the system performance and simplify the receiver design. Transmit precoding is essential for inter-user interference cancellation in multiuser downlink where users do not cooperate. Linear and non-linear precoding have been widely investigated as low-complexity alternatives to dirty paper coding-based transmission scheme for multiuser multiple-input multiple-output(MU-MIMO)downlink. Similarly, in relay-assisted networks, precoding at the relay nodes have been shown to improve performance. The precoder and joint precoder/receive filter (transceiver) designs usually assume perfect knowledge of the CSI. In practical systems, however, the CSI will be imperfect due to estimation errors, feedback errors and feedback delays. Such imperfections in CSI will lead to deterioration of performance of the precoders/transceivers designed assuming perfect CSI. In such situations, designs which are robust to CSI errors are crucial to realize the potential of multiuser multi-antenna systems in practice. This thesis focuses on the robust designs of precoders and transceivers for MU-MIMO downlink, and for non-regenerative relay networks in the presence of errors in the CSI. We consider a norm-bounded error(NBE) model, and a stochastic error(SE) model for the CSI errors. These models are suitable for commonly encountered errors, and they allow mathematically and computationally tractable formulations for the robust designs. We adopt a statistically robust design in the case of stochastic error, and a minimax or worst-case robust design in the case of norm-bounded error. We have considered the robust precoder and transceiver designs under different performance criteria based on transmit power and quality-of-service(QoS) constraints. The work reported in this thesis can be grouped into three parts, namely,i ) robust linear pre-coder and transceiver designs for multiuser downlink, ii)robust non-linear precoder and transceiver designs for multiuser downlink, and iii)robust precoder designs for non-regenerative relay networks. Linear precoding: In this part, first, a robust precoder for multiuser multiple-input single-output(MU-MISO)downlink that minimizes the total base station(BS)transmit power with constraints on signal-to-interference-plus-noise ratio(SINR) at the user terminals is considered. We show that this problem can be reformulated as a second order cone program(SOCP) with the same order of computational complexity as that of the non-robust precoder design. Next, a robust design of linear transceiver for MU-MIMO downlink is developed. This design is based on the minimization of sum mean square error(SMSE) with a constraint on the total BS transmit power, and assumes that the error in the CSI at the transmitter(CSIT) follows the stochastic error model. For this design, an iterative algorithm based on the associated Karush-Kuhn-Tucker(KKT) conditions is proposed. Our numerical results demonstrate the robust performance of the propose designs. Non-linear precoding: In this part, we consider robust designs of Tomlinson-Harashima precoders(THP) for MU-MISO and MU-MIMO downlinks with different performance criteria and CSI error models. For MU-MISO systems with imperfect CSIT, we investigate the problem of designing robust THPs under MSE and total BS transmit power constraints. The first design is based on the minimization of total BS transmit power under constraints on the MSE at the individual user receivers. We present an iterative procedure to solve this problem, where each iteration involves the solution of a pair of convex optimization problems. The second design is based on the minimization of a stochastic function of the SMSE under a constraint on the total BS transmit power. We solve this problem efficiently by the method of alternating optimization. For MU-MIMO downlink, we propose robust THP transceiver designs that jointly optimize the TH precoder and receiver filters. We consider these transceiver designs under stochastic and norm-bounded error models for CSIT. For the SE model, we propose a minimum SMSE transceiver design. For the NBE model, we propose three robust designs, namely, minimum SMSE design, MSE-constrained design, and MSE-balancing design. Our proposed solutions to these robust design problems are based on iteratively solving a pair of sub-problems, one of which can be solved analytically, and the other can be formulated as a convex optimization problem that can be solved efficiently. Robust precoder designs for non-regenerative relay networks: In this part, we consider robust designs for two scenarios in the case of relay-assisted networks. First, we consider a non-regenerative relay network with a source-destination node pair assisted by multiple relay nodes, where each node is equipped with a single antenna. The set of the cooperating relay nodes can be considered as a distributed antenna array. For this scenario, we present a robust distributed beam former design that minimizes the total relay transmit power with a constraint on the SNR at the destination node. We show that this robust design problem can be reformulated as a semi-definite program (SDP)that can be solved efficiently. Next, we consider a non-regenerative relay network, where a set of source-destination node pairs are assisted by a MIMO-relay node, which is equipped with multiple transmit and multiple receive antennas. For this case, we consider robust designs in the presence of stochastic and norm-bounded CSI errors. We show that these problems can be reformulated as convex optimization problems. In the case of norm-bounded error, we use an approximate expression for the MSE in order to obtain a tractable solution.

To meet the exponentially increasing traffic data driven by the rapidly growing mobile subscriptions, both industry and academia are exploring the potential of a new genera- tion (5G) of wireless technologies. An important 5G goal is to achieve high data rate. Small cells with spectrum sharing and multiple-input multiple-output (MIMO) techniques are one of the most promising 5G technologies, since it enables to increase the aggregate data rate by improving the spectral efficiency, nodes density and transmission bandwidth, respectively. However, the increased interference in the densified networks will in return limit the achievable rate performance if not properly managed. The considered setup can be modeled as MIMO interference networks, which can be classified into the K-user MIMO interference channel (IC) and the K-cell MIMO interfering broadcast channel/multiple access channel (MIMO-IBC/IMAC) according to the number of mobile stations (MSs) simultaneously served by each base station (BS). The thesis considers two physical layer (PHY) resource allocation problems that deal with the interference for both models: 1) Pareto boundary computation for the achiev- able rate region in a K-user single-stream MIMO IC and 2) grouping-based interference alignment (GIA) with optimized IA-Cell assignment in a MIMO-IMAC under limited feedback. In each problem, the thesis seeks to provide a deeper understanding of the system and novel mathematical results, along with supporting numerical examples. Some of the main contributions can be summarized as follows. It is an open problem to compute the Pareto boundary of the achievable rate region for a K-user single-stream MIMO IC. The K-user single-stream MIMO IC models multiple transmitter-receiver pairs which operate over the same spectrum simultaneously. Each transmitter and each receiver is equipped with multiple antennas, and a single desired data stream is communicated in each transmitter-receiver link. The individual achievable rates of the K users form a K-dimensional achievable rate region. To find efficient operating points in the achievable rate region, the Pareto boundary computation problem, which can be formulated as a multi-objective optimization problem, needs to be solved. The thesis transforms the multi-objective optimization problem to two single-objective optimization problems–single constraint rate maximization problem and alternating rate profile optimization problem, based on the formulations of the ε-constraint optimization and the weighted Chebyshev optimization, respectively. The thesis proposes two alternating optimization algorithms to solve both single-objective optimization problems. The convergence of both algorithms is guaranteed. Also, a heuristic initialization scheme is provided for each algorithm to achieve a high-quality solution. By varying the weights in each single-objective optimization problem, numerical results show that both algorithms provide an inner bound very close to the Pareto boundary. Furthermore, the thesis also computes some key points exactly on the Pareto boundary in closed-form. A framework for interference alignment (IA) under limited feedback is proposed for a MIMO-IMAC. The MIMO-IMAC well matches the uplink scenario in cellular system, where multiple cells share their spectrum and operate simultaneously. In each cell, a BS receives the desired signals from multiple MSs within its own cell and each BS and each MS is equipped with multi-antenna. By allowing the inter-cell coordination, the thesis develops a distributed IA framework under limited feedback from three aspects: the GIA, the IA-Cell assignment and dynamic feedback bit allocation (DBA), respec- tively. Firstly, the thesis provides a complete study along with some new improvements of the GIA, which enables to compute the exact IA precoders in closed-form, based on local channel state information at the receiver (CSIR). Secondly, the concept of IA-Cell assignment is introduced and its effect on the achievable rate and degrees of freedom (DoF) performance is analyzed. Two distributed matching approaches and one centralized assignment approach are proposed to find a good IA-Cell assignment in three scenrios with different backhaul overhead. Thirdly, under limited feedback, the thesis derives an upper bound of the residual interference to noise ratio (RINR), formulates and solves a corresponding DBA problem. Finally, numerical results show that the proposed GIA with optimized IA-Cell assignment and the DBA greatly outperforms the traditional GIA algorithm.

This thesis addresses the design of low-complexity coding schemes for wireless relay networks and multiple access channels. The first part of the thesis is on wireless relay networks and the second part is on multiple access channels. Distributed space-time coding is a well known technique to achieve spatial diversity in wireless networks wherein, several geographically separated nodes assist a source node to distributively transmit a space-time block code (STBC) to the destination. Such STBCs are referred to as Distributed STBCs (DSTBCs). In the first part of the thesis, we focus on designing full diversity DSTBCs with some nice properties which make them amenable for implementation in practice. Towards that end, a class of full diversity DST-BCs referred to as Co-ordinate Interleaved DSTBCs (CIDSTBCs) are proposed for relay networks with two-antenna relays. To construct CIDSTBCs, a technique called co-ordinate vector interleaving is introduced wherein, the received signals at different antennas of the relay are processed in a combined fashion. Compared to the schemes where the received signals at different antennas of the relay are processed independently, we show that CIDSTBCs provide coding gain which comes in with negligible increase in the processing complexity at the relays. Subsequently, we design single-symbol ML decodable (SSD) DSTBCs for relay networks with single-antenna nodes. In particular, two classes of SSD DSTBCs referred to as (i) Semi-orthogonal SSD Precoded DSTBCs and (ii) Training-Symbol Embedded (TSE) SSD DSTBCs are proposed. A detailed analysis on the maximal rate of such DSTBCs is presented and explicit DSTBCs achieving the maximal rate are proposed. It is shown that the proposed codes have higher rates than the existing SSD DSTBCs. In the second part, we study two-user Gaussian Multiple Access Channels (GMAC). Capacity regions of two-user GMAC are well known. Though, capacity regions of such channels provide insights into the achievable rate pairs in an information theoretic sense, they fail to provide information on the achievable rate pairs when we consider finitary restrictions on the input alphabets and analyze some real world practical signal constellations like QAM and PSK signal sets. Hence, we study the capacity aspects of two-user GMAC with finite input alphabets. In particular, Constellation Constrained (CC) capacity regions of two-user SISO-GMAC are computed for several orthogonal and non-orthogonal multiple access schemes (abbreviated as O-MA and NO-MA schemes respectively). It is first shown that NO-MA schemes strictly offer larger capacity regions than the O-MA schemes for finite input alphabets. Subsequently, for NO-MA schemes, code pairs based on Trellis Coded Modulation (TCM) are proposed such that any rate pair on the CC capacity region can be approached. Finally, we consider a two-user Multiple-Input Multiple-Output (MIMO) fading MAC and design STBC pairs such that ML decoding complexity is reduced.

To meet the exponentially increasing traffic data driven by the rapidly growing mobile subscriptions, both industry and academia are exploring the potential of a new genera- tion (5G) of wireless technologies. An important 5G goal is to achieve high data rate. Small cells with spectrum sharing and multiple-input multiple-output (MIMO) techniques are one of the most promising 5G technologies, since it enables to increase the aggregate data rate by improving the spectral efficiency, nodes density and transmission bandwidth, respectively. However, the increased interference in the densified networks will in return limit the achievable rate performance if not properly managed. The considered setup can be modeled as MIMO interference networks, which can be classified into the K-user MIMO interference channel (IC) and the K-cell MIMO interfering broadcast channel/multiple access channel (MIMO-IBC/IMAC) according to the number of mobile stations (MSs) simultaneously served by each base station (BS). The thesis considers two physical layer (PHY) resource allocation problems that deal with the interference for both models: 1) Pareto boundary computation for the achiev- able rate region in a K-user single-stream MIMO IC and 2) grouping-based interference alignment (GIA) with optimized IA-Cell assignment in a MIMO-IMAC under limited feedback. In each problem, the thesis seeks to provide a deeper understanding of the system and novel mathematical results, along with supporting numerical examples. Some of the main contributions can be summarized as follows. It is an open problem to compute the Pareto boundary of the achievable rate region for a K-user single-stream MIMO IC. The K-user single-stream MIMO IC models multiple transmitter-receiver pairs which operate over the same spectrum simultaneously. Each transmitter and each receiver is equipped with multiple antennas, and a single desired data stream is communicated in each transmitter-receiver link. The individual achievable rates of the K users form a K-dimensional achievable rate region. To find efficient operating points in the achievable rate region, the Pareto boundary computation problem, which can be formulated as a multi-objective optimization problem, needs to be solved. The thesis transforms the multi-objective optimization problem to two single-objective optimization problems–single constraint rate maximization problem and alternating rate profile optimization problem, based on the formulations of the ε-constraint optimization and the weighted Chebyshev optimization, respectively. The thesis proposes two alternating optimization algorithms to solve both single-objective optimization problems. The convergence of both algorithms is guaranteed. Also, a heuristic initialization scheme is provided for each algorithm to achieve a high-quality solution. By varying the weights in each single-objective optimization problem, numerical results show that both algorithms provide an inner bound very close to the Pareto boundary. Furthermore, the thesis also computes some key points exactly on the Pareto boundary in closed-form. A framework for interference alignment (IA) under limited feedback is proposed for a MIMO-IMAC. The MIMO-IMAC well matches the uplink scenario in cellular system, where multiple cells share their spectrum and operate simultaneously. In each cell, a BS receives the desired signals from multiple MSs within its own cell and each BS and each MS is equipped with multi-antenna. By allowing the inter-cell coordination, the thesis develops a distributed IA framework under limited feedback from three aspects: the GIA, the IA-Cell assignment and dynamic feedback bit allocation (DBA), respec- tively. Firstly, the thesis provides a complete study along with some new improvements of the GIA, which enables to compute the exact IA precoders in closed-form, based on local channel state information at the receiver (CSIR). Secondly, the concept of IA-Cell assignment is introduced and its effect on the achievable rate and degrees of freedom (DoF) performance is analyzed. Two distributed matching approaches and one centralized assignment approach are proposed to find a good IA-Cell assignment in three scenrios with different backhaul overhead. Thirdly, under limited feedback, the thesis derives an upper bound of the residual interference to noise ratio (RINR), formulates and solves a corresponding DBA problem. Finally, numerical results show that the proposed GIA with optimized IA-Cell assignment and the DBA greatly outperforms the traditional GIA algorithm.

Approved for public release, distribution is unlimited / This thesis investigates the simulation performance of multiple-input multiple-output (MIMO) systems utilizing Alamoutibased space-time block coding (STBC) technique. The MIMO communication systems using STBC technique employing both single- carrier modulation and orthogonal frequency division multiplexing (OFDM) are simulated in Matlab. The physical layer part of the IEEE 802.16a standard is used in constructing the simulated OFDM schemes. Stanford University Interim (SUI) channel models are selected for the wireless channel in the simulation process. The performance results of the simulated MIMO systems are compared to those of conventional single antenna systems. / Lieutenant Junior Grade, Turkish Navy