2021
DOI: 10.1109/access.2020.3037562
|View full text |Cite
|
Sign up to set email alerts
|

DropNet: An Improved Dropping Algorithm Based on Neural Networks for Line-of-Sight Massive MIMO

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…One of the most important NN contributions is the treatment of the SRM problem, which is critical in massive MIMO systems [53], [54]. So, the drop algorithm based on NNs is used in [55] to select users that would be dropped, therefore leading to SRM. In [56], the sampling function NN has been proposed to manage the weights calculation of an adaptive antenna array thus resulting in an improved performance compared to the conventional RBFNN.…”
Section: Literature Review Of Neural Network-based Beamformingmentioning
confidence: 99%
“…One of the most important NN contributions is the treatment of the SRM problem, which is critical in massive MIMO systems [53], [54]. So, the drop algorithm based on NNs is used in [55] to select users that would be dropped, therefore leading to SRM. In [56], the sampling function NN has been proposed to manage the weights calculation of an adaptive antenna array thus resulting in an improved performance compared to the conventional RBFNN.…”
Section: Literature Review Of Neural Network-based Beamformingmentioning
confidence: 99%
“…Hence, the CBS aims to maximize the SINR gain of a particular user and does not guarantee the best achievable overall SINR gain for the whole system. Other classes of algorithms that can be used to perform user selection in massive MIMO are the user grouping algorithms [8], [34], [35] and recently proposed machine learning-based selection algorithms [36]. These algorithms separate users into clusters, serving a reduced number of users per cluster in the same time-frequency resource in order to decrease the interference between users within the same cluster.…”
Section: A User Selection In Massive Mimo Systemsmentioning
confidence: 99%
“…The complexity of SOS presented in Algorithm 1 is measured in terms of the number of operations used to select the best set of users. The most expensive operations are in (35), (36), (38), and (39). At the lth iteration, Algorithm 1 requires 2(M 3 +M 2 −M )(K−l+1) additions and 4M 3 (K−l+1) multiplications to compute (35).…”
Section: A Semi-orthogonal Selectionmentioning
confidence: 99%
See 2 more Smart Citations