2018 IEEE Globecom Workshops (GC Wkshps) 2018
DOI: 10.1109/glocomw.2018.8644255
|View full text |Cite
|
Sign up to set email alerts
|

Clustered Cell-Free Massive MIMO

Abstract: This paper introduces a novel technique, clustered cell-free massive-MIMO (C 2 F-M-MIMO), that generalizes the recently proposed cell-free massive MIMO (CF-M-MIMO) concept by optimizing the connectivity pattern among access points (APs) and mobile stations (MSs). Relying on the popular Kmeans clustering algorithm, APs and MSs are grouped together in clusters in such a way that strong interferers arising due to pilot contamination are minimized. The clustering pattern varies in accordance to the large-scale fad… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3
3

Relationship

2
8

Authors

Journals

citations
Cited by 46 publications
(34 citation statements)
references
References 14 publications
0
34
0
Order By: Relevance
“…The above levels have been partially analyzed before in the literature, but not under the general and practical conditions considered in this paper, which allow us to draw conclusions that differ in several important ways-in particular, we show that MR combining performs terribly bad in Cell-free mMIMO. Level 4 was considered in [24], [30], [31] for N = 1 and in [27], [32] with N ≥ 1 but with spatially uncorrelated channels. Level 3 was investigated in [24], [33] for N = 1 and MR combining.…”
Section: B Contributionsmentioning
confidence: 99%
“…The above levels have been partially analyzed before in the literature, but not under the general and practical conditions considered in this paper, which allow us to draw conclusions that differ in several important ways-in particular, we show that MR combining performs terribly bad in Cell-free mMIMO. Level 4 was considered in [24], [30], [31] for N = 1 and in [27], [32] with N ≥ 1 but with spatially uncorrelated channels. Level 3 was investigated in [24], [33] for N = 1 and MR combining.…”
Section: B Contributionsmentioning
confidence: 99%
“…. β Mk ] into M A clusters in which each propagation vector belongs to the cluster with the nearest centroid, serving as a representative of the cluster [48]. Now, using the virtual propagation losses vectors characterizing the M A centroids, the same selection procedure previously described is applied to select the M A active APs.…”
Section: E Propagation Losses-aware Asomentioning
confidence: 99%
“…In particular, dynamic clustering should take into account the underlying pre-determined clusters that are established by the physical links, while signal processing and power control should be able to smoothly adapt to the dynamic clustering (Paper B). A -means clustering algorithm is proposed in [137] to minimize the pilot contamination within each cluster. [138] devises a clusterization based on the degree of channel hardening, while [116,139] proposes AP selection methods based on the large-scale fading coefficients.…”
Section: Scalability: a Framework For Pilot Assignmentmentioning
confidence: 99%