219 research outputs found

    Gaussian Message Passing for Overloaded Massive MIMO-NOMA

    Full text link
    This paper considers a low-complexity Gaussian Message Passing (GMP) scheme for a coded massive Multiple-Input Multiple-Output (MIMO) systems with Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station with NsN_s antennas serves NuN_u sources simultaneously in the same frequency. Both NuN_u and NsN_s are large numbers, and we consider the overloaded cases with Nu>NsN_u>N_s. The GMP for MIMO-NOMA is a message passing algorithm operating on a fully-connected loopy factor graph, which is well understood to fail to converge due to the correlation problem. In this paper, we utilize the large-scale property of the system to simplify the convergence analysis of the GMP under the overloaded condition. First, we prove that the \emph{variances} of the GMP definitely converge to the mean square error (MSE) of Linear Minimum Mean Square Error (LMMSE) multi-user detection. Secondly, the \emph{means} of the traditional GMP will fail to converge when Nu/Ns<(2−1)−2≈5.83 N_u/N_s< (\sqrt{2}-1)^{-2}\approx5.83. Therefore, we propose and derive a new convergent GMP called scale-and-add GMP (SA-GMP), which always converges to the LMMSE multi-user detection performance for any Nu/Ns>1N_u/N_s>1, and show that it has a faster convergence speed than the traditional GMP with the same complexity. Finally, numerical results are provided to verify the validity and accuracy of the theoretical results presented.Comment: Accepted by IEEE TWC, 16 pages, 11 figure

    On the application of massive mimo systems to machine type communications

    Get PDF
    This paper evaluates the feasibility of applying massive multiple-input multiple-output (MIMO) to tackle the uplink mixed-service communication problem. Under the assumption of an available physical narrowband shared channel, devised to exclusively consume data traffic from machine type communications (MTC) devices, the capacity (i.e., number of connected devices) of MTC networks and, in turn, that of the whole system, can be increased by clustering such devices and letting each cluster share the same time-frequency physical resource blocks. Following this research line, we study the possibility of employing sub-optimal linear detectors to the problem and present a simple and practical channel estimator that works without the previous knowledge of the large-scale channel coefficients. Our simulation results suggest that the proposed channel estimator performs asymptotically, as well as the MMSE estimator, with respect to the number of antennas and the uplink transmission power. Furthermore, the results also indicate that, as the number of antennas is made progressively larger, the performance of the sub-optimal linear detection methods approaches the perfect interference-cancellation bound. The findings presented in this paper shed light on and motivate for new and exciting research lines toward a better understanding of the use of massive MIMO in MTC networks

    On the Impact of Phase Noise in Communication Systems –- Performance Analysis and Algorithms

    Get PDF
    The mobile industry is preparing to scale up the network capacity by a factor of 1000x in order to cope with the staggering growth in mobile traffic. As a consequence, there is a tremendous pressure on the network infrastructure, where more cost-effective, flexible, high speed connectivity solutions are being sought for. In this regard, massive multiple-input multiple-output (MIMO) systems, and millimeter-wave communication systems are new physical layer technologies, which promise to facilitate the 1000 fold increase in network capacity. However, these technologies are extremely prone to hardware impairments like phase noise caused by noisy oscillators. Furthermore, wireless backhaul networks are an effective solution to transport data by using high-order signal constellations, which are also susceptible to phase noise impairments. Analyzing the performance of wireless communication systems impaired by oscillator phase noise, and designing systems to operate efficiently in strong phase noise conditions are critical problems in communication theory. The criticality of these problems is accentuated with the growing interest in new physical layer technologies, and the deployment of wireless backhaul networks. This forms the main motivation for this thesis where we analyze the impact of phase noise on the system performance, and we also design algorithms in order to mitigate phase noise and its effects. First, we address the problem of maximum a posteriori (MAP) detection of data in the presence of strong phase noise in single-antenna systems. This is achieved by designing a low-complexity joint phase-estimator data-detector. We show that the proposed method outperforms existing detectors, especially when high order signal constellations are used. Then, in order to further improve system performance, we consider the problem of optimizing signal constellations for transmission over channels impaired by phase noise. Specifically, we design signal constellations such that the error rate performance of the system is minimized, and the information rate of the system is maximized. We observe that these optimized constellations significantly improve the system performance, when compared to conventional constellations, and those proposed in the literature. Next, we derive the MAP symbol detector for a MIMO system where each antenna at the transceiver has its own oscillator. We propose three suboptimal, low-complexity algorithms for approximately implementing the MAP symbol detector, which involve joint phase noise estimation and data detection. We observe that the proposed techniques significantly outperform the other algorithms in prior works. Finally, we study the impact of phase noise on the performance of a massive MIMO system, where we analyze both uplink and downlink performances. Based on rigorous analyses of the achievable rates, we provide interesting insights for the following question: how should oscillators be connected to the antennas at a base station, which employs a large number of antennas

    Analysis of Wireless Networks With Massive Connectivity

    Get PDF
    Recent years have witnessed unprecedented growth in wireless networks in terms of both data traffic and number of connected devices. How to support this fast increasing demand for high data traffic and connectivity is a key consideration in the design of future wireless communication systems. With this motivation, in this thesis, we focus on the analysis of wireless networks with massive connectivity. In the first part of the thesis, we seek to improve the energy efficiency (EE) of single-cell massive multiple-input multiple-output (MIMO) networks with joint antenna selection and user scheduling. We propose a two-step iterative procedure to maximize the EE. In each iteration, bisection search and random selection are used first to determine a subset of antennas with the users selected before, and then identify the EE-optimal subset of users with the selected antennas via cross entropy algorithm. Subsequently, we focus on the joint uplink and downlink EE maximization, under a limitation on the number of available radio frequency (RF) chains. With the Jensen\u27s inequality and the power consumption model, the original problem is converted into a combinatorial optimization problem. Utilizing the learning-based stochastic gradient descent framework and the rare event simulation method, we propose an efficient learning-based stochastic gradient descent algorithm to solve the corresponding combinatorial optimization problem. In the second part of the thesis, we focus on the joint activity detection and channel estimation in cell-free massive MIMO systems with massive connectivity. At first, we conduct an asymptotic analysis of single measurement vector (SMV) based minimum mean square error (MMSE) estimation in cell-free massive MIMO systems with massive connectivity. We establish a decoupling principle of SMV based MMSE estimation for sparse signal vectors with independent and non-identically distributed (i.n.i.d.) non-zero components. Subsequently, using the decoupling principle, likelihood ratio test and the optimal fusion rule, we obtain detection rules for the activity of users based on the received pilot signals at only one access point (AP), and also based on the cooperation of the received pilot signals from the entire set of APs for centralized and distributed detection. Moreover, we study the achievable uplink rates with zero-forcing (ZF) detector at the central processing unit (CPU) of the cell-free massive MIMO systems. In the third part, we focus on the performance analysis of intelligent reflecting surface (IRS) assisted wireless networks. Initially, we investigate the MMSE channel estimation for IRS assisted wireless communication systems. Then, we study the sparse activity detection problem in IRS assisted wireless networks. Specifically, employing the generalized approximate message passing (GAMP) algorithm, we obtain the MMSE estimates of the equivalent effective channel coefficients from the base station (BS) to all users, and transform the received pilot signals into additive Gaussian noise corrupted versions of the equivalent effective channel coefficients. Likelihood ratio test is used to acquire decisions on the activity of each user based on the Gaussian noise corrupted equivalent effective channel coefficients, and the optimal fusion rule is used to obtain the final decisions on the activity of all users based on the previous decisions on the activity of each user and the corresponding reliabilities. Finally, we conduct an asymptotic analysis of maximizing the weighted sum rate by joint beamforming and power allocation under transmit power and quality-of-service (QoS) constraints in IRS assisted wireless networks
    • …
    corecore