2019
DOI: 10.1109/twc.2019.2922913
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Grouping Sparse Bayesian Learning for Channel Estimation in Non-Stationary Uplink Massive MIMO Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(14 citation statements)
references
References 35 publications
0
14
0
Order By: Relevance
“…Most of the existing DL channel estimation works i.e., [3]- [5] fail to capture the cluster-specific sparsity, which occurs due to co-located users. Cheng et al [17] proposed a Dirichlet-Gaussian hybrid prior which exploits user-specific, cluster-specific and common sparsities by adaptively grouping the users. However, it is difficult to extend this algorithm to a decentralized architecture, due to its adaptive user grouping.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of the existing DL channel estimation works i.e., [3]- [5] fail to capture the cluster-specific sparsity, which occurs due to co-located users. Cheng et al [17] proposed a Dirichlet-Gaussian hybrid prior which exploits user-specific, cluster-specific and common sparsities by adaptively grouping the users. However, it is difficult to extend this algorithm to a decentralized architecture, due to its adaptive user grouping.…”
Section: Introductionmentioning
confidence: 99%
“…3) We analyze the convergence of our D-VBL algorithm and show that the upper bound on the absolute error between the C-and D-VBL updates tends to zero, when the SNR-based criterion detects the non-zero support accurately. 4) We numerically show that the proposed D-VBL and C-VBL algorithms have much lower normalized mean squared error (NMSE) and bit error rate (BER) than the centralized algorithms e.g., J-OMP [4], variational expectation maximization (VEM) [3], adaptive grouping sparse Bayesian learning (AG-SBL) [17], and the decentralized ones in [13], [24]. We also show that proposed algorithms outperform the existing ones in terms of spectral efficiency (SE) and energy efficiency (EE), and that the D-VBL has better EE than the C-VBL.…”
Section: Introductionmentioning
confidence: 99%
“…If users and scatterers are located inside the Rayleigh distance of the array, then the array will experience spherical wavefronts instead of planar wavefronts [2]- [4]. Another difference is spatial non-stationarity [5]- [8]. The channel measurement results of [5] show that different regions of a large aperture array receive varying levels of powers due to the different propagation paths (scatterers) that they can see, whereas some of them cannot see a path.…”
Section: Introductionmentioning
confidence: 99%
“…Traditional channel estimation methods, such as least squares (LS) and linear minimum mean square error [9], are unable to satisfy these requirements. Although numerous studies have been conducted on positioning the scatterers in near-field stationary channels [3], [4], and more research has begun to focus on the estimation of visible regions of scatterers [8], only a few studies are available on positioning the scatterers and identifying the visible regions simultaneously. This letter proposes a subarray-wise and a scatterer-wise channel estimation methods to draw up the near-field non-stationary massive MIMO channel.…”
Section: Introductionmentioning
confidence: 99%
“…Another crucial difference is that users may not be far apart from the BS, such that the exchanged signals experience near-field propagation with spherical wavefronts. To account for these new propagation challenges in XL-MIMO, adapted channel estimation methods [4], [5] and novel low-complexity detection schemes [6]- [8] have been proposed. However, little attention…”
Section: Introductionmentioning
confidence: 99%