Full dimension (FD) multiple-input multiple-output (MIMO) technology has recently attracted substantial research attention in the 3rd Generation Partnership Project (3GPP) as a promising technique for the next-generation of wireless communication networks. FD-MIMO scenarios utilize a planar two-dimensional (2D) active antenna system (AAS) that not only allows a large number of antenna elements to be placed within feasible base station (BS) form factors, but also provides the ability of elevation beamforming. This dissertation presents the elevation beamforming analysis for cellular networks utilizing FD massive MIMO antenna arrays. In particular, two architectures are proposed for the AAS - the uniform linear array (ULA) and the uniform circular array (UCA) of antenna ports, where each port is mapped to a group of vertically arranged antenna elements with a corresponding downtilt weight vector. To support FD-MIMO techniques, this dissertation presents two different 3D ray-tracing channel modeling approaches, the ITU based ‘antenna port approach’ and the 3GPP technical report (TR) 36.873 based ‘antenna element approach’. The spatial correlation functions (SCF)s for both FD-MIMO arrays are characterized based on the antenna port approach. The resulting expressions depend on the underlying angular distributions and antenna patterns through the Fourier series coefficients of the power spectra and are therefore valid for any 3D propagation environment. Simulation results investigate the performance patterns of the two arrays as a function of several channel and array parameters. The SCF for the ULA of antenna ports is then characterized in terms of the downtilt weight vectors, based on the more recent antenna element approach. The derived SCFs are used to form the Rayleigh correlated 3D channel model. All these aspects are put together to provide a mathematical framework for the design of elevation beamforming schemes in single-cell and multi-cell scenarios. Finally, this dissertation proposes to use the double scattering channel to model limited scattering in realistic propagation environments and derives deterministic equivalents of the signal-to-interference-plus-noise ratio (SINR) and ergodic rate with regularized zeroforcing (RZF) precoding. The performance of a massive MIMO system is shown to be limited by the number of scatterers. To this end, this dissertation points out future research directions

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.