2016 IEEE Global Communications Conference (GLOBECOM) 2016
DOI: 10.1109/glocom.2016.7841532
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Algorithm for Energy Efficiency Maximization in Massive MIMO Networks

Abstract: Abstract-In this paper, we propose a novel iterative algorithm based on successive convex approximation for the nonconvex energy efficiency optimization problem in massive MIMO networks. The stationary points of the original problem are found by solving a sequence of successively refined approximate problems, and the proposed algorithm has the following advantages: 1) fast convergence as the structure of the original energy efficiency function is preserved as much as possible in the approximate problem, and 2)… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 18 publications
0
9
0
Order By: Relevance
“…Furthermore, several iterative algorithms are proposed to solve the problem of EE maximization in NOMA networks, e.g., in single cell NOMA system [19], in NOMA HetNets [20] and for massive MIMO networks in [26]. Although the iterative approach has been applied to various scenarios, the network setting that we consider in this paper is very different, making the existing solutions not directly applicable.…”
Section: B Motivation and Contributionmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, several iterative algorithms are proposed to solve the problem of EE maximization in NOMA networks, e.g., in single cell NOMA system [19], in NOMA HetNets [20] and for massive MIMO networks in [26]. Although the iterative approach has been applied to various scenarios, the network setting that we consider in this paper is very different, making the existing solutions not directly applicable.…”
Section: B Motivation and Contributionmentioning
confidence: 99%
“…Although the iterative approach has been applied to various scenarios, the network setting that we consider in this paper is very different, making the existing solutions not directly applicable. For example, if some rules of fairness requirement is strictly imposed in order to guarantee the fairness among all users, the solutions developed in [19], [20], [26] are no longer applicable. To this end, we adopt the sequential successive convex approximation (SCA) techniques to systematically address the critical issue of the inter/intra interference of users in the MC-NOMA networks to maximize users with lowest EE performance.…”
Section: B Motivation and Contributionmentioning
confidence: 99%
See 1 more Smart Citation
“…wheref k (Q k ; Q t ) is defined in (6). Note that each subproblem in (8) is pseudoconvex, and B k Q t is unique as we will explain later.…”
Section: The Proposed Iterative Algorithm For Socially Optimal Dmentioning
confidence: 99%
“…Since a special instance of the GEE and the SEE, namely, sum rate maximization in such an interference-limited system, is a nonconvex problem and NP-hard [1], most studies (with [2] as an exception) focus on efficient iterative algorithms that can find a stationary point. For the GEE maximization problem, many algorithms are developed, see [2][3][4][5][6][7][8] and the references therein. By comparison, less attention has been paid to the SEE maximization and max-min fairness problems, see [9][10][11][12] and [2,13] and the references therein.…”
Section: Introductionmentioning
confidence: 99%