اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديد3D Channel Model in 3GPP
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Multi-antenna techniques capable of exploiting the elevation dimension are anticipated to be an important air-interface enhancement targeted to handle the expected growth in mobile traffic. In order to enable the development and evaluation of such multi-antenna techniques, the 3rd generation partnership project (3GPP) has recently developed a 3-dimensional (3D) channel model. The existing 2-dimensional (2D) channel models do not capture the elevation channel characteristics lending them insufficient for such studies. This article describes the main components of the newly developed 3D channel model and the motivations behind introducing them. One key aspect is the ability to model channels for users located on different floors of a building (at different heights). This is achieved by capturing a user height dependency in modelling some channel characteristics including pathloss, line-of-sight (LOS) probability, etc. In general this 3D channel model follows the framework of WINNERII/WINNER+ while also extending the applicability and the accuracy of the model by introducing some height and distance dependent elevation related parameters.
قيم البحث
اقرأ أيضاً
In this paper, we investigate the robust linear precoder design for three dimensional (3D) massive multi-input multi-output (MIMO) downlink with uniform planar array (UPA) and imperfect channel state information (CSI). In practical massive MIMO with
UPAs, the number of antennas in each column or row is usually limited. The straightforward extension of the conventional DFT based beam domain channel model widely used in massive MIMO with uniform linear arrays (ULAs) can not apply. To overcome this issue, we establish a new beam domain channel model by using sampled steering vectors. Then, a novel method to obtain the beam domain channel power matrices and the instantaneous beam domain channel coefficients is proposed, and an a posteriori beam domain channel model which includes the channel aging and the spatial correlation is established. On the basis of the a posteriori channel model, we consider the robust precoder design with the expected weighted sum-rate maximization under a total power constraint. By viewing the power constraint as a Riemannian manifold, we transform the constrained optimization problem into an unconstrained optimization problem on the Riemannian manifold. Then, we derive an iterative algorithm to obtain the optimal precoders by setting the Riemannian gradient of the objective function to zero. Furthermore, we propose a low complexity robust precoder design by replacing the expected rates in the objective function with their upper bounds. Simulation results show that the proposed precoders can achieve significant performance gain than the widely used regularized zero forcing (RZF) precoder and signal to leakage noise ratio (SLNR) precoder.
In this paper, we address the message-passing receiver design for the 3D massive MIMO-OFDM systems. With the aid of the central limit argument and Taylor-series approximation, a computationally efficient receiver that performs joint channel estimatio
n and decoding is devised by the framework of expectation propagation. Specially, the local belief defined at the channel transition function is expanded up to the second order with Wirtinger calculus, to transform the messages sent by the channel transition function to a tractable form. As a result, the channel impulse response (CIR) between each pair of antennas is estimated by Gaussian message passing. In addition, a variational expectation-maximization (EM)-based method is derived to learn the channel power-delay-profile (PDP). The proposed joint algorithm is assessed in 3D massive MIMO systems with spatially correlated channels, and the empirical results corroborate its superiority in terms of performance and complexity.
In this paper, we propose an efficient coding scheme for the two-link binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. The exact rate-distortion bound for a two-link binary CEO problem under the logarithmic loss has been
obtained by Courtade and Weissman. We propose an encoding scheme based on compound LDGM-LDPC codes to achieve the theoretical bounds. In the proposed encoding, a binary quantizer using LDGM codes and a syndrome-coding employing LDPC codes are applied. An iterative joint decoding is also designed as a fusion center. The proposed CEO decoder is based on the sum-product algorithm and a soft estimator.
Information delivery using chemical molecules is an integral part of biology at multiple distance scales and has attracted recent interest in bioengineering and communication. The collective signal strength at the receiver (i.e., the expected number
of observed molecules inside the receiver), resulting from a large number of transmitters at random distances (e.g., due to mobility), can have a major impact on the reliability and efficiency of the molecular communication system. Modeling the collective signal from multiple diffusion sources can be computationally and analytically challenging. In this paper, we present the first tractable analytical model for the collective signal strength due to randomly-placed transmitters, whose positions are modelled as a homogeneous Poisson point process in three-dimensional (3D) space. By applying stochastic geometry, we derive analytical expressions for the expected number of observed molecules at a fully absorbing receiver and a passive receiver. Our results reveal that the collective signal strength at both types of receivers increases proportionally with increasing transmitter density. The proposed framework dramatically simplifies the analysis of large-scale molecular systems in both communication and biological applications.
Channel matrix sparsification is considered as a promising approach to reduce the progressing complexity in large-scale cloud-radio access networks (C-RANs) based on ideal channel condition assumption. In this paper, the research of channel sparsific
ation is extend to practical scenarios, in which the perfect channel state information (CSI) is not available. First, a tractable lower bound of signal-to-interferenceplus-noise ratio (SINR) fidelity, which is defined as a ratio of SINRs with and without channel sparsification, is derived to evaluate the impact of channel estimation error. Based on the theoretical results, a Dinkelbach-based algorithm is proposed to achieve the global optimal performance of channel matrix sparsification based on the criterion of distance. Finally, all these results are extended to a more challenging scenario with pilot contamination. Finally, simulation results are shown to evaluate the performance of channel matrix sparsification with imperfect CSIs and verify our analytical results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
