Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMassive MIMO with Multi-Antenna Users under Jointly Correlated Ricean Fading
99
0
0.0
(
0
)
Added by
Konstantinos Dovelos
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We study the uplink performance of massive multiple-input multiple-output (MIMO) when users are equipped with multiple antennas. To this end, we consider a generalized channel model that accounts for line-of-sight propagation and spatially correlated multipath fading. Most importantly, we employ the Weichselberger correlation model, which has been shown to alleviate the deficiencies of the popular Kronecker model. The main contribution of this paper is a rigorous closed-form expression for the uplink spectral efficiency using maximum-ratio combining and minimum mean square error channel estimation. Our result is a non-trivial generalization of previous results on massive MIMO with spatially correlated channels, thereby enabling us to have suitable designs for future massive MIMO systems. Numerical simulations corroborate our analysis and provide useful insights on how different propagation conditions affect system performance.
rate research
Read More
Modern wireless cellular networks use massive multiple-input multiple-output technology. This involves operations with an antenna array at a base station that simultaneously serves multiple mobile devices that also use multiple antennas on their side. For this, various Beamforming and Detection techniques are used, allowing each user to receive the signal intended for him from the base station. There is an important class of linear Precoding called Regularized Zero-Forcing. In this work, we propose a special kind of regularization matrix with different regularizations for different UE, using singular values of multi-antenna users. The proposed algorithm has a simple analytical formula and is provided with theoretical study. We also show the results in comparison with other linear Precoding algorithms on simulations with the Quadriga channel model. The proposed approach leads to a significant increase in quality with the same computation time as in the baseline methods.
In this paper, an analytical framework for evaluating the performance of scalable cell-free massive MIMO (SCF-mMIMO) systems in which all user equipments (UEs) and access points (APs) employ finite resolution digital-to-analog converters (DACs) and analog-to-digital converters (ADCs) and operates under correlated Rician fading, is presented. By using maximal-ratio combining (MRC) detection, generic expressions for the uplink (UL) spectral efficiency (SE) for both distributed and centralized schemes are derived. In order to further reduce the computational complexity (CC) of the original local partial MMSE (LP-MMSE) and partial MMSE (P-MMSE) detectors, two novel scalable low complexity MMSE detectors are proposed for distributed and centralized schemes respectively, which achieves very similar SE performance. Furthermore, for the distributed scheme a novel partial large-scale fading decoding (P-LSFD) weighting vector is introduced and its analytical SE performance is very similar to the performance of an equivalent unscalable LSFD vector. Finally, a scalable algorithm jointly consisting of AP cluster formation, pilot assignment, and power control is proposed, which outperforms the conventional random pilot assignment and user-group based pilot assignment policies and, contrary to an equal power transmit strategy, it guarantees quality of service (QoS) fairness for all accessing UEs.
Flexible numerologies are being considered as part of designs for 5G systems to support vertical services with diverse requirements such as enhanced mobile broadband, ultra-reliable low-latency communications, and massive machine type communication. Different vertical services can be multiplexed in either frequency domain, time domain, or both. In this paper, we investigate the use of spatial multiplexing of services using MU-MIMO where the numerologies for different users may be different. The users are grouped according to the chosen numerology and a separate pre-coder and FFT size is used per numerology at the transmitter. The pre-coded signals for the multiple numerologies are added in the time domain before transmission. We analyze the performance gains of this approach using capacity analysis and link level simulations using conjugate beamforming and signal-to-leakage noise ratio maximization techniques. We show that the MU interference between users with different numerologies can be suppressed efficiently with reasonable number of antennas at the base-station. This feature enables MU-MIMO techniques to be applied for 5G across different numerologies.
In this paper, we propose a multiple-input multipleoutput (MIMO) transmission strategy that is closer to the Shannon limit than the existing strategies. Different from most existing strategies which only consider uniformly distributed discrete input signals, we present a unified framework to optimize the MIMO precoder and the discrete input signal distribution jointly. First, a general model of MIMO transmission under discrete input signals and its equivalent formulation are established. Next, in order to maximize the mutual information between the input and output signals, we provide an algorithm that jointly optimizes the precoder and the input distribution. Finally, we compare our strategy with other existing strategies in the simulation. Numerical results indicate that our strategy narrows the gap between the mutual information and Shannon limit, and shows a lower frame error rate in simulation.
Content caching is a widely studied technique aimed to reduce the network load imposed by data transmission during peak time while ensuring users quality of experience. It has been shown that when there is a common link between caches and the server, delivering contents via the coded caching scheme can significantly improve performance over conventional caching. However, finding the optimal content placement is a challenge in the case of heterogeneous users behaviours. In this paper we consider heterogeneous number of demands and non-uniform content popularity distribution in the case of homogeneous and heterogeneous user preferences. We propose a hybrid coded-uncoded caching scheme to trade-off between popularity and diversity. We derive explicit closed-form expressions of the server load for the proposed hybrid scheme and formulate the corresponding optimization problem. Results show that the proposed hybrid caching scheme can reduce the server load significantly and outperforms the baseline pure coded and pure uncoded and previous works in the literature for both homogeneous and heterogeneous user preferences.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
