اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPrincipal Component Analysis (PCA)-based Massive-MIMO Channel Feedback
68
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Channel-state-information (CSI) feedback methods are considered, especially for massive or very large-scale multiple-input multiple-output (MIMO) systems. To extract essential information from the CSI without redundancy that arises from the highly correlated antennas, a receiver transforms (sparsifies) a correlated CSI vector to an uncorrelated sparse CSI vector by using a Karhunen-Loeve transform (KLT) matrix that consists of the eigen vectors of covariance matrix of CSI vector and feeds back the essential components of the sparse CSI, i.e., a principal component analysis method. A transmitter then recovers the original CSI through the inverse transformation of the feedback vector. Herein, to obtain the covariance matrix at transceiver, we derive analytically the covariance matrix of spatially correlated Rayleigh fading channels based on its statistics including transmit antennas and receive antennas correlation matrices, channel variance, and channel delay profile. With the knowledge of the channel statistics, the transceiver can readily obtain the covariance matrix and KLT matrix. Compression feedback error and bit-error-rate performance of the proposed method are analyzed. Numerical results verify that the proposed method is promising, which reduces significantly the feedback overhead of the massive-MIMO systems with marginal performance degradation from full-CSI feedback (e.g., feedback amount reduction by 80%, i.e., 1/5 of original CSI, with spectral efficiency reduction by only 2%). Furthermore, we show numerically that, for a given limited feedback amount, we can find the optimal number of transmit antennas to achieve the largest spectral efficiency, which is a new design framework.
قيم البحث
اقرأ أيضاً
Massive Multiple-Input Multiple-Output (massive MIMO) is a variant of multi-user MIMO in which the number of antennas at each Base Station (BS) is very large and typically much larger than the number of users simultaneously served. Massive MIMO can b
e implemented with Time Division Duplexing (TDD) or Frequency Division Duplexing (FDD) operation. FDD massive MIMO systems are particularly desirable due to their implementation in current wireless networks and their efficiency in situations with symmetric traffic and delay-sensitive applications. However, implementing FDD massive MIMO systems is known to be challenging since it imposes a large feedback overhead in the Uplink (UL) to obtain channel state information for the Downlink (DL). In recent years, a considerable amount of research is dedicated to developing methods to reduce the feedback overhead in such systems. In this paper, we use the sparse spatial scattering properties of the environment to achieve this goal. The idea is to estimate the support of the continuous, frequency-invariant scattering function from UL channel observations and use this estimate to obtain the support of the DL channel vector via appropriate interpolation. We use the resulting support estimate to design an efficient DL probing and UL feedback scheme in which the feedback dimension scales proportionally with the sparsity order of DL channel vectors. Since the sparsity order is much less than the number of BS antennas in almost all practically relevant scenarios, our method incurs much less feedback overhead compared with the currently proposed methods in the literature, such as those based on compressed-sensing. We use numerical simulations to assess the performance of our probing-feedback algorithm and compare it with these methods.
In this paper, we propose a novel method for efficient implementation of a massive Multiple-Input Multiple-Output (massive MIMO) system with Frequency Division Duplexing (FDD) operation. Our main objective is to reduce the large overhead incurred by
Downlink (DL) common training and Uplink (UL) feedback needed to obtain channel state information (CSI) at the base station. Our proposed scheme relies on the fact that the underlying angular distribution of a channel vector, also known as the angular scattering function, is a frequency-invariant entity yielding a UL-DL reciprocity and has a limited angular support. We estimate this support from UL CSI and interpolate it to obtain the corresponding angular support of the DL channel. Finally we exploit the estimated support of the DL channel of all the users to design an efficient channel probing and feedback scheme that maximizes the total spectral efficiency of the system. Our method is different from the existing compressed-sensing (CS) based techniques in the literature. Using support information helps reduce the feedback overhead from O(s*log M) in CS techniques to O(s) in our proposed method, with $s$ and $M$ being sparsity order of the channel vectors and the number of base station antennas, respectively. Furthermore, in order to control the channel sparsity and therefore the DL common training and UL feedback overhead, we introduce the novel concept of active channel sparsification. In brief, when the fixed pilot dimension is less than the required amount for reliable channel estimation, we introduce a pre-beamforming matrix that artificially reduces the effective channel dimension of each user to be not larger than the DL pilot dimension, while maximizing both the number of served users and the number of probed angles. We provide numerical experiments to compare our method with the state-of-the-art CS technique.
Channel estimation is very challenging when the receiver is equipped with a limited number of radio-frequency (RF) chains in beamspace millimeter-wave (mmWave) massive multiple-input and multiple-output systems. To solve this problem, we exploit a le
arned denoising-based approximate message passing (LDAMP) network. This neural network can learn channel structure and estimate channel from a large number of training data. Furthermore, we provide an analytical framework on the asymptotic performance of the channel estimator. Based on our analysis and simulation results, the LDAMP neural network significantly outperforms state-of-the-art compressed sensingbased algorithms even when the receiver is equipped with a small number of RF chains. Therefore, deep learning is a powerful tool for channel estimation in mmWave communications.
This paper investigates downlink channel estimation in frequency-division duplex (FDD)-based massive multiple-input multiple-output (MIMO) systems. To reduce the overhead of downlink channel estimation and uplink feedback in FDD systems, cascaded pre
coding has been used in massive MIMO such that only a low-dimensional effective channel needs to be estimated and fed back. On the other hand, traditional channel estimations can hardly achieve the minimum mean-square-error (MMSE) performance due to lack of the a priori knowledge of the channels. In this paper, we design and analyze a strategy for downlink channel estimation based on the parametric model in massive MIMO with cascaded precoding. For a parametric model, channel frequency responses are expressed using the path delays and the associated complex amplitudes. The path delays of uplink channels are first estimated and quantized at the base station, then fed forward to the user equipment (UE) through a dedicated feedforward link. In this manner, the UE can obtain the a priori knowledge of the downlink channel in advance since it has been demonstrated that the downlink and the uplink channels can have identical path delays. Our analysis and simulation results show that the proposed approach can achieve near-MMSE performance.
The problem of wideband massive MIMO channel estimation is considered. Targeting for low complexity algorithms as well as small training overhead, a compressive sensing (CS) approach is pursued. Unfortunately, due to the Kronecker-type sensing (measu
rement) matrix corresponding to this setup, application of standard CS algorithms and analysis methodology does not apply. By recognizing that the channel possesses a special structure, termed hierarchical sparsity, we propose an efficient algorithm that explicitly takes into account this property. In addition, by extending the standard CS analysis methodology to hierarchical sparse vectors, we provide a rigorous analysis of the algorithm performance in terms of estimation error as well as number of pilot subcarriers required to achieve it. Small training overhead, in turn, means higher number of supported users in a cell and potentially improved pilot decontamination. We believe, that this is the first paper that draws a rigorous connection between the hierarchical framework and Kronecker measurements. Numerical results verify the advantage of employing the proposed approach in this setting instead of standard CS algorithms.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
