2016
DOI: 10.1109/lsp.2016.2584099
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Sum Rate Maximization Algorithms for Nonregenerative MIMO Relay Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 31 publications
0
1
0
Order By: Relevance
“…k,j according to (17); 7: t = t + 1; 8: until convergence the formulated problem is NP-hard [40], [41], and nonconvex due to the coupled transmit beams and receive beams, for which finding its optimal solution in polynomial time is difficult. Hence, the problem is split into two subproblems by using the AO method.…”
Section: B Weighted Sum-rate Maximization Designmentioning
confidence: 99%
“…k,j according to (17); 7: t = t + 1; 8: until convergence the formulated problem is NP-hard [40], [41], and nonconvex due to the coupled transmit beams and receive beams, for which finding its optimal solution in polynomial time is difficult. Hence, the problem is split into two subproblems by using the AO method.…”
Section: B Weighted Sum-rate Maximization Designmentioning
confidence: 99%