2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN) 2017
DOI: 10.1109/iccsn.2017.8230153
|View full text |Cite
|
Sign up to set email alerts
|

Density based user grouping for massive MIMO downlink in FDD system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The k-means and hierarchical clustering algorithms are two commonly used user clustering algorithms. The traditional k-means algorithm [24] is a classic user clustering algorithm that is simple in principle, low in complexity and easy to implement. However, it depends on the selection of the initial centre points.…”
Section: A User Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…The k-means and hierarchical clustering algorithms are two commonly used user clustering algorithms. The traditional k-means algorithm [24] is a classic user clustering algorithm that is simple in principle, low in complexity and easy to implement. However, it depends on the selection of the initial centre points.…”
Section: A User Clusteringmentioning
confidence: 99%
“…If problem(26) is feasible and the solution is p * k , replace p k with p * k in(24) to find the optimal LSFD coefficients α * k , and set t min := t.If the problem is not feasible, set tmax := t Stop if tmax − t min < and set α * k = α * k / α * k . Otherwise, go to Step 2 .…”
mentioning
confidence: 99%
“…Interestingly, this result prompted a series of subsequent studies on the problem of user grouping itself, such as agglomerative clustering method [25], density-based clustering [26], [27] etc.…”
Section: Introductionmentioning
confidence: 99%