# Energy-Efficient Resource Allocation in Uplink Multiuser Massive MIMO Systems

Authors: Ying Hu; Baofeng Ji; Yongming Huang; Fei Yu; Luxi Yang
Journal: International Journal of Antennas and Propagation
 (2015)

---

## Abstract

Energy-efficient communications, namely, green communications, has attracted increasing attention due to energy shortage
and greenhouse effect. Motivated by this, we consider the uplink energy-efficient resource allocation in multiuser massive
multiple-input multiple-output (MIMO) systems. Specifically, we consider that both the number of antenna arrays at the base station
(BS) and the transmit data rate at UE are adjusted adaptively to maximize the energy efficiency. Firstly, we demonstrate the existence
of a unique resource allocation solution that is globally optimal by exploiting the properties of objective function. Then we develop an
iterative algorithm to solve it. By transforming the originally fractional optimization problem into an equivalent subtractive form using
the properties of fractional programming, we develop another efficient iterative resource allocation algorithm. Simulation results have
validated the effectiveness of the proposed two algorithms and have shown that both algorithms can fast converge to a near-optimal
solution in a small number of iterations.


---

## Body

## 1. Introduction

The amount of energy consumption for information and communication technology (ICT) increases dramatically with the exponential growth of service requirement [1], which directly impact on global greenhouse gas emissions. Therefore, as opposed to traditional spectral efficiency resource allocation [2–6], dynamic resource allocation is designed to maximize energy efficiency [7–13]. On the other side, MIMO technology has been proposed to substantially increase the system performance. Basically, the more antennas the transmitter/receiver are equipped with, the more degrees of freedom the propagation channel can provide, the better the performance in terms of data rate or link reliability is [14–17]. Massive MIMO (also known as large-scale antenna systems, very large MIMO, hyper-MIMO, full-dimension MIMO, and ARGOS) makes a clean break with current practice through the use of a large excess of service antennas over active terminals and time-division duplex operation [18]. Recently, multiuser massive MIMO gains more and more attention, where “massive MIMO” usually means the arrays comprising a few hundred antennas simultaneously serving tens of users in the same time-frequency resource [19]. Lower capacity bounds for maximum-ratio combining (MRC), zero-forcing (ZF), and minimum mean-square error (MMSE) detection in massive multiuser MIMO systems are derived in [19]. Whereas it is pointed out in [20] that although MIMO techniques have been shown to be effective in improving capacity and spectral efficiency (SE) of wireless communication systems, energy consumption also increases.Recently energy-efficient design has emerged as a new trend in wireless communications. The tradeoff between EE (energy efficiency) and SE (spectral efficiency) in downlink multiuser DAS (distributed antenna systems) is addressed in [1]. They first transformed the multicriteria optimization problem with high complexity into a simple single objective optimization problem and proposed a novel power allocation algorithm to achieve maximum EE. In [7], the authors consider the energy-efficient power optimization for a general signal cell SISO-OFDM downlink system where subcarriers are allowed to be shared among users. They first proved that OFDMA is optimal for energy-efficient design of the SISO-OFDM system and then turned the nonconvex energy-efficient power allocation problem into a quasiconvex optimization problem and proposed an efficient power allocation algorithm. In [9], link adaptive transmission for maximized energy efficiency is addressed. The authors demonstrated the existence of a unique globally optimal link adaptation solution and developed iterative binary search assisted ascent (BSAA) algorithm to obtain it. In [10], the authors address the energy-efficient design of uplink MU-MIMO in a single cell environment. They demonstrated that a unique globally optimal power allocation always exists and gave energy-efficient MU-MIMO power allocation (EMMPA) algorithm to obtain it. In [11], we considered energy-efficient design of resource allocation for a multiuser OFDMA and developed schemes of user selection, rate allocation, and power allocation under QoS requirement to maximize the energy efficiency. In [13], resource allocation for energy-efficient communication in multicell OFDMA downlink network with cooperative base stations is studied. They transformed the considered problem in fractional form into an equivalent optimization problem in subtractive form, which enables the derivation of an efficient iterative resource allocation algorithm.It is worth mentioning that all the above works only consider energy-efficient resource in single-antenna or fixed-beam OFDM system. There exist few works on the energy-efficient design concerning antenna selection for the massive MIMO system. In [21], we consider energy-efficient resource allocation in very large multiuser MIMO single cell systems, in which the effect of large-scale fading is ignored for the sake of simplicity. In [22], an energy-efficient iterative resource allocation scheme is proposed for the OFDMA downlink network with a large number of transmit antennas at the BS, which involves multiple-layer iterations and thus is computationally inefficient. Motivated by this, in this paper, we consider uplink energy-efficient resource allocation in multiuser massive MIMO systems. Specifically, in our problem formulation, the number of antenna arrays at BS and the transmit data rate vector at the user are jointly optimized to maximize the energy efficiency, in which the power consumption includes both transmit power and circuit power. Using the energy efficiency lower bound as the optimization criterion, we propose two iterative solutions. We first demonstrate the existence of a unique globally optimal solution by exploiting the properties of objective function; then we develop an iterative algorithm to solve the resource allocation problem. It is proved that the convergence of this iterative algorithm can be guaranteed, but the convergence rate and the performance are sensitive to initial conditions and step length. Herein, we further propose a more efficient iterative algorithm by transforming the considered nonconvex optimization problem in fractional form into an equivalent optimization problem in subtractive form. Its convergence property is also proved. The numerical results show that the proposed algorithms converge to a near-optimal point with a small number of iterations.The remainder of this paper is organized as follows. In Section2, the multiuser massive MIMO system model is described, and the optimization problem for the energy-efficient resource allocation is formulated. In Section 3, we provide two iterative algorithms to obtain the optimal solution. Then, we present numerical results in Section 4. Finally, we conclude the paper in Section 5.


## 2. System Model

As shown in Figure1, a massive MIMO system consisting of one BS equipped with M antennas and K users each equipped with single antenna is investigated in this paper. The received signal at the BS can be expressed as(1)
Y
=
G
·
P
·
x
+
n
,where Y
=
[
y
1
,
y
2
,
…
,
y
M
]
T and [
]
T is the transpose operator. G is M
×
K channel matrix between the BS and the K users. P
=
diag
{
p
1
,
p
2
,
…
,
p
K
} is the power allocation matrix, where p
k is the transmit power of user k. x is K
×
1 transmit signal matrix. n is M
×
1 additive white Gaussian noise (AWGN). Channel matrix G is given by(2)
G
=
H
D
1
/
2
,where H is M
×
K matrix of fast fading coefficients between the BS and the K users and D
=
diag
{
β
1
,
β
2
,
…
,
β
K
}; the component β
k denotes the large-scale channel factor for user k.Figure 1
The system model.As is shown in [19], given the perfect CSI at the receiver when BS adopts zero-forcing (ZF) receiver, provided that M
≥
K
+
1, the achievable uplink rate for the kth user is lower bounded by(3)
r
k
=
log
⁡
2
1
+
p
k
M
-
K
β
k
.We take the noise variance to be 1, to simplify notation, but without loss of generality. With this convention, p
k has the interpretation of normalized “transmit” SNR.Correspondingly, the sum data rate is lower bounded by(4)
R
=
∑
k
=
1
K
r
k
=
∑
k
=
1
K
log
⁡
2
1
+
p
k
M
-
K
β
k
.The overall transmit power can be written as(5)
P
T
R
,
M
=
∑
k
=
1
K
‍
p
k
=
∑
k
=
1
K
‍
2
r
k
-
1
M
-
K
β
k
,where R
=
[
r
1
,
r
2
,
…
,
r
K
]
T is the data rate vector for all users.Then, the overall power consumption can be expressed as(6)
P
R
,
M
=
P
T
R
,
M
+
P
C
M
,where P
C
(
M
)
=
M
×
p
c represents the total circuit power consumed by the BS and p
c is the circuit power of each antenna which includes the energy consumed by all the circuit blocks along the signal path: analog to digital converter (ADC), digital to analog converter (DAC), frequency synthesizer, mixer, lower noise amplifier (LNA), power amplifier, and baseband DSP [23].The energy efficiency of interest is then given by(7)
U
(
R
,
M
)
=
R
P
T
(
R
,
M
)
+
P
C
(
M
)
.Therefore, the resource allocation for the uplink multiuser massive MIMO system can be formulated as the following optimization problem:(8)
M
∗
,
R
∗
=
arg
max
⁡
︸
M
,
R
U
R
,
M
.


## 3. Energy-Efficient Resource Allocation

The objective function is a ratio of two functions which generally is a nonconvex function. Next, we will propose two approaches to address this issue. The basic idea of the first approach is to first demonstrate the existence of a unique globally optimal point for the data rate and antenna selection by exploiting the properties of the objective function and then to develop an iterative algorithm to directly solve the optimization problem. While, in the second approach, we first transform the originally fractional optimization problem into an equivalent subtractive form by exploiting the properties of fractional programming, we then develop an efficient iterative resource allocation algorithm to obtain this optimum.


### 3.1. Direct Optimization Approach

In the following, we first develop Lemma1 to prove that a unique globally optimal data rate vector and the number of antenna arrays always exist and then further investigate the necessary and sufficient conditions for the globally optimal solution. In particular, we allow M to be a positive real value instead of integer. Then, we can take a derivative with respect to M.Lemma 1.
The energy efficiency functionU
(
R
,
M
) is (i) strictly quasiconcave (furthermore, U
(
R
,
M
) is either strictly decreasing or first strictly increasing and then strictly decreasing) with respect to M for a fixed R and (ii) strictly quasiconcave (furthermore, U
(
R
,
M
) is either strictly decreasing or first strictly increasing and then strictly decreasing) with respect to any r
k of R for a fixed M.Proof.
See AppendixA.Theorem 2.
The energy efficiency functionU
(
R
,
M
) is as follows.(i)
There exists a unique globally optimal number of base station antennasM
∗ for fixed R, where M
∗ is given by Table 1.
(ii)
There exists a unique globally optimal transmit rate vectorR
∗
=
r
1
∗
,
r
2
∗
,
…
,
r
K
∗
T for a fixed M, where r
k
∗ is given by Table 1.Table 1
Theorem2(i).
M
*
Conditions
K
+
∑
k
=
1
K
‍
2
r
k
-
1
p
c
β
k
R
[
∑
k
=
1
K
‍
2
r
k
-
1
β
k
-
p
c
]
≥
0, ∂
U
(
R
,
M
)
∂
M
|
M
=
M
*
=
0
K
+
1
R
[
∑
k
=
1
K
‍
2
r
k
-
1
β
k
-
p
c
]
<
0
R
*
Conditions
∂
U
(
R
,
M
)
∂
r
k
|
R
=
R
*
=
0
P
T
(
R
k
(
0
)
,
M
)
+
P
C
(
M
)
-
R
k
(
0
)
P
-
T
′
(
R
,
M
)
≥
0
R
k
(
0
)
=
[
r
1
,
r
2
,
…
,
r
k
-
1
,
0
,
r
k
+
1
,
…
,
r
K
]
T,
R
k
(
0
)
=
∑
j
≠
k
‍
r
j
P
T
(
R
k
(
0
)
,
M
)
+
P
C
(
M
)
-
R
k
(
0
)
P
-
T
′
(
R
,
M
)
<
0,   r
k
*
=
0Theorem2 provides the necessary and sufficient conditions for the rate vector R
∗ and the number of base station antennas M
∗ to be the unique and global optimum. However, it is difficult to directly solve the joint optimization problems. Meanwhile, we can adopt BSAA algorithm [9] to obtain the optimal transmission rate vector R
∗ for fixed M. As a result, we develop an iterative method to search the optimal R
∗ and M
∗ to maximize U
(
R
,
M
). In Algorithm 1, the U
(
R
∗
,
M
∗
) is obtained by exhaustive M
∗; therefore the energy efficiency U
(
R
,
M
) can converge to the optimal U
(
R
∗
,
M
∗
).Algorithm 1
(1)R
=
R
0, M
*
=
M
0, U
max
⁡
=
U
0, initialize η
>
1
(2)while
U
(
R
*
,
M
*
)
>
U
max
⁡
do
U
max
⁡
←
U
(
R
*
,
M
*
);
adoptBSAA algorithm to obtain the the optimal transission rate vector R
*
M
*
=
⌈
η
*
M
*
⌉
ReturnU
max
⁡
,
R
*
,
M
*In Algorithm1, BSAA algorithm uses gradient assisted binary search to find the optimal step size μ
∗ and then adopts R
=
[
R
+
μ
∗
∇
U
(
R
)
]
+ to obtain optimal transmission rate vector R
∗. As shown in flow diagram above, Algorithm 1 gradually increases the transmit rate and the required number of BS antennas to converge to the optimal solution.


### 3.2. Optimization Approach Based on Problem Transformation

Obviously, the convergence rate and accuracy of Algorithm1 depend on the value of initialized optimal transmit rate vector and the number of base station antennas as well as the value of step length η, so we develop the indirect algorithm to search locally optimal R
∗ and M
∗ to maximize U
(
R
,
M
). The fractional objective function in (7) can be classified as a nonlinear fractional program [24]. We can get the following theorem from theorem in [24].Theorem 3.
Consider(9)
q
∗
=
R
∗
P
T
R
∗
,
M
∗
+
P
C
M
∗
=
max
⁡
︸
M
,
R
R
P
T
R
,
M
+
P
C
Mif and only if(10)
max
⁡
︸
M
,
R
R
-
q
∗
P
T
R
,
M
+
P
C
M
max
⁡
︸
M
,
R
=
R
∗
-
q
∗
P
T
R
∗
,
M
∗
+
P
C
M
∗
max
⁡
︸
M
,
R
=
0
,
forR
≥
0 and P
T
(
R
,
M
)
+
P
C
(
M
)
>
0.According to Theorem3, for any optimization problem with an objective function in fractional form, there always exists an equivalent objective function in subtractive form. As a result, we can focus on the equivalent objective function:(11)
F

(
q
)
=
max
⁡
︸
M
,
R
R
-
q
[
P
T
(
R
,
M
)
+
P
C
(
M
)
]in the rest of the paper.The problem above is now joint concave with respect to all variables if2
∑
k
=
1
K
2
r
k
-
1
-
2
r
k
≥
0 (cf. Appendix B).Using standard optimization technique, the number of base station antennas is(12)
M
∗
=
K
/
q
ln
⁡
⁡
2
+
K
/
q
ln
⁡
⁡
2
2
-
4
p
c
∑
k
=
1
K
1
/
β
k
2
p
c
+
K
.And the rate allocation is(13)
r
k
∗
=
log
⁡
2
M
-
K
β
k
q
ln
⁡
⁡
2
.Therefore, we develop an iterative algorithm to search the optimalR, M
∗, and q
∗ to maximize function f.Note that this iterative algorithm guarantees convergence. Please refer to [21] for a proof of convergence. As shown in flow diagram above, with the increment of the value of q, Algorithm 2 gradually decreases the transmit rate and the required number of BS antennas to converge to the optimal solution.Algorithm 2
(1)R
*
=
R
0, M
*
=
M
0, q
*
=
0, initialize ε
=
0.01
(2) whileR
*
-
q
*
[
P
T
(
R
*
,
M
*
)
+
P
C
(
M
*
)
]
>
ε
doq
*
←
R
(
r
*
)
[
P
T
(
R
*
,
M
)
+
P
C
(
M
*
)
]
adopt formula (13) above obtain rate allocation
adopt formula (12) above obtain the number of base station antennas
Returnq
*, r
*, M
*


## 3.1. Direct Optimization Approach

In the following, we first develop Lemma1 to prove that a unique globally optimal data rate vector and the number of antenna arrays always exist and then further investigate the necessary and sufficient conditions for the globally optimal solution. In particular, we allow M to be a positive real value instead of integer. Then, we can take a derivative with respect to M.Lemma 1.
The energy efficiency functionU
(
R
,
M
) is (i) strictly quasiconcave (furthermore, U
(
R
,
M
) is either strictly decreasing or first strictly increasing and then strictly decreasing) with respect to M for a fixed R and (ii) strictly quasiconcave (furthermore, U
(
R
,
M
) is either strictly decreasing or first strictly increasing and then strictly decreasing) with respect to any r
k of R for a fixed M.Proof.
See AppendixA.Theorem 2.
The energy efficiency functionU
(
R
,
M
) is as follows.(i)
There exists a unique globally optimal number of base station antennasM
∗ for fixed R, where M
∗ is given by Table 1.
(ii)
There exists a unique globally optimal transmit rate vectorR
∗
=
r
1
∗
,
r
2
∗
,
…
,
r
K
∗
T for a fixed M, where r
k
∗ is given by Table 1.Table 1
Theorem2(i).
M
*
Conditions
K
+
∑
k
=
1
K
‍
2
r
k
-
1
p
c
β
k
R
[
∑
k
=
1
K
‍
2
r
k
-
1
β
k
-
p
c
]
≥
0, ∂
U
(
R
,
M
)
∂
M
|
M
=
M
*
=
0
K
+
1
R
[
∑
k
=
1
K
‍
2
r
k
-
1
β
k
-
p
c
]
<
0
R
*
Conditions
∂
U
(
R
,
M
)
∂
r
k
|
R
=
R
*
=
0
P
T
(
R
k
(
0
)
,
M
)
+
P
C
(
M
)
-
R
k
(
0
)
P
-
T
′
(
R
,
M
)
≥
0
R
k
(
0
)
=
[
r
1
,
r
2
,
…
,
r
k
-
1
,
0
,
r
k
+
1
,
…
,
r
K
]
T,
R
k
(
0
)
=
∑
j
≠
k
‍
r
j
P
T
(
R
k
(
0
)
,
M
)
+
P
C
(
M
)
-
R
k
(
0
)
P
-
T
′
(
R
,
M
)
<
0,   r
k
*
=
0Theorem2 provides the necessary and sufficient conditions for the rate vector R
∗ and the number of base station antennas M
∗ to be the unique and global optimum. However, it is difficult to directly solve the joint optimization problems. Meanwhile, we can adopt BSAA algorithm [9] to obtain the optimal transmission rate vector R
∗ for fixed M. As a result, we develop an iterative method to search the optimal R
∗ and M
∗ to maximize U
(
R
,
M
). In Algorithm 1, the U
(
R
∗
,
M
∗
) is obtained by exhaustive M
∗; therefore the energy efficiency U
(
R
,
M
) can converge to the optimal U
(
R
∗
,
M
∗
).Algorithm 1
(1)R
=
R
0, M
*
=
M
0, U
max
⁡
=
U
0, initialize η
>
1
(2)while
U
(
R
*
,
M
*
)
>
U
max
⁡
do
U
max
⁡
←
U
(
R
*
,
M
*
);
adoptBSAA algorithm to obtain the the optimal transission rate vector R
*
M
*
=
⌈
η
*
M
*
⌉
ReturnU
max
⁡
,
R
*
,
M
*In Algorithm1, BSAA algorithm uses gradient assisted binary search to find the optimal step size μ
∗ and then adopts R
=
[
R
+
μ
∗
∇
U
(
R
)
]
+ to obtain optimal transmission rate vector R
∗. As shown in flow diagram above, Algorithm 1 gradually increases the transmit rate and the required number of BS antennas to converge to the optimal solution.


## 3.2. Optimization Approach Based on Problem Transformation

Obviously, the convergence rate and accuracy of Algorithm1 depend on the value of initialized optimal transmit rate vector and the number of base station antennas as well as the value of step length η, so we develop the indirect algorithm to search locally optimal R
∗ and M
∗ to maximize U
(
R
,
M
). The fractional objective function in (7) can be classified as a nonlinear fractional program [24]. We can get the following theorem from theorem in [24].Theorem 3.
Consider(9)
q
∗
=
R
∗
P
T
R
∗
,
M
∗
+
P
C
M
∗
=
max
⁡
︸
M
,
R
R
P
T
R
,
M
+
P
C
Mif and only if(10)
max
⁡
︸
M
,
R
R
-
q
∗
P
T
R
,
M
+
P
C
M
max
⁡
︸
M
,
R
=
R
∗
-
q
∗
P
T
R
∗
,
M
∗
+
P
C
M
∗
max
⁡
︸
M
,
R
=
0
,
forR
≥
0 and P
T
(
R
,
M
)
+
P
C
(
M
)
>
0.According to Theorem3, for any optimization problem with an objective function in fractional form, there always exists an equivalent objective function in subtractive form. As a result, we can focus on the equivalent objective function:(11)
F

(
q
)
=
max
⁡
︸
M
,
R
R
-
q
[
P
T
(
R
,
M
)
+
P
C
(
M
)
]in the rest of the paper.The problem above is now joint concave with respect to all variables if2
∑
k
=
1
K
2
r
k
-
1
-
2
r
k
≥
0 (cf. Appendix B).Using standard optimization technique, the number of base station antennas is(12)
M
∗
=
K
/
q
ln
⁡
⁡
2
+
K
/
q
ln
⁡
⁡
2
2
-
4
p
c
∑
k
=
1
K
1
/
β
k
2
p
c
+
K
.And the rate allocation is(13)
r
k
∗
=
log
⁡
2
M
-
K
β
k
q
ln
⁡
⁡
2
.Therefore, we develop an iterative algorithm to search the optimalR, M
∗, and q
∗ to maximize function f.Note that this iterative algorithm guarantees convergence. Please refer to [21] for a proof of convergence. As shown in flow diagram above, with the increment of the value of q, Algorithm 2 gradually decreases the transmit rate and the required number of BS antennas to converge to the optimal solution.Algorithm 2
(1)R
*
=
R
0, M
*
=
M
0, q
*
=
0, initialize ε
=
0.01
(2) whileR
*
-
q
*
[
P
T
(
R
*
,
M
*
)
+
P
C
(
M
*
)
]
>
ε
doq
*
←
R
(
r
*
)
[
P
T
(
R
*
,
M
)
+
P
C
(
M
*
)
]
adopt formula (13) above obtain rate allocation
adopt formula (12) above obtain the number of base station antennas
Returnq
*, r
*, M
*


## 4. Simulations

In this section, we provide the simulation results to evaluate the performance of our proposed algorithms varying with the number of users. Moreover, we also provide the simulation results to evaluate the energy-efficiency performance varying with the number of iterations and the number of BS antennas. In order to reduce the computational complexity of optimal algorithm, throughout the simulations, we assume that the users are divided into three groups according to their distance to the base station; that is,β
=
[
1,0.8,0.5
]. Meanwhile, we consider a static circuit power consumption p
c
=
10 mw and use an initialized optimal transmit rate vector R
0
=
[
0.1
,
…
,
0.1
]
T, η
=
1.02. To examine the gap of the performance of the proposed algorithm to the globally optimal solution, we use exhaustive search method to obtain the optimal performance. The “proposed Algorithm 1 iteration 3” means that we adopt Algorithm 1 with a given number of iterations of 3, and the same to the proposed Algorithm 2 iteration 3.Figure2 shows the energy efficiency of the proposed algorithms versus the number of users. As clearly seen, the energy efficiency increases with the number of users. It is also shown that the performance of both proposed algorithms is very close to the optimum. When the number of iterations is limited to 3, the results show that Algorithm 2 achieves a near-convergence performance when the user number is less than 35, while the gap between Algorithm 2 and optimal solution increases with the user number growing. This is because the number of iterations will increase with the user number growing for achieving the optimal solution. In comparison, the performance of Algorithm 1 with 3 iterations exhibits a large gap to its converged solution.Figure 2
Energy efficiency versus number of users.Figure3 depicts the optimal number of base station antennas M
∗ versus the number of users. As expected, the number of base station antennas required in our resource allocation algorithms increases with the number of users. The convergency performances of our proposed two algorithms are both very close to the global optimum. While the number of iterations is fixed at 3, the performance of two algorithms is quite different. The required number of BS antennas of Algorithm 2 increases with the number of users. But that of Algorithm 1 stays unchanged even though more users are deployed. This is because the required number of BS antennas of Algorithm 1 is updated by M
∗
=
η
∗
M
∗. When the value of η is small, the update speed is very slow. Whereas the required number of BS antennas of Algorithm 2 is updated by M
∗
=
(
(
K
/
q
ln
⁡
2
)
+
(
K
/
q
ln
⁡
2
)
2
-
4
p
c
∑
k
=
1
K
(
1
/
β
k
)
)
/
2
p
c
+
K, the required number of BS antennas of Algorithm 2 increases with the number of users growing. Meanwhile, when the value of q is smaller, the required number of BS antennas is larger. The results also show when serving tens of users, the optimal number of base station antennas needs a hundred or a few hundred.Figure 3
Number of base station antennas versus number of users.Figure4 illustrates the overall transmit power versus the number of users. As clearly seen, the overall transmit power increases with the number of users. Furthermore, it is also shown that the performance of both proposed algorithms is close to the optimum. Whereas the overall transmit power of the proposed algorithms with a given number of iterations is different, when iteration number is fixed at 3, the transmit power of Algorithm 2 is larger than the optimal value, but that of Algorithm 1 is smaller. This is because the transmit rate of Algorithm 2 is updated by r
k
∗
=
log
⁡
2
(
M
-
K
)
β
k
/
q
ln
⁡
2; when the value of q is smaller than the optimal value, the transmit rate is larger, so the transmit power is larger than the optimal value. Whereas the transmit rate of Algorithm 1 is updated by BSAA algorithm when the required number of BS antennas is fixed, the transmit power of Algorithm 1 is smaller than the optimal value.Figure 4
Overall transmit power versus number of users.Figure5 depicts the spectral efficiency versus the number of users. It is seen that the trend of the spectral efficiency versus the number of users is the same as the optimal number of base station antennas M
∗ versus the number of users. It also can be seen that Algorithm 2 iteration 3 attains even higher spectral efficiency than the optimal result. This is because the transmit rate of Algorithm 2 is updated by r
k
∗
=
log
⁡
2
(
M
-
K
)
β
k
/
q
ln
⁡
2; when the value of q is smaller than the optimal value, the transmit rate is larger than the optimal value. In a word, when the iteration number is fixed at 3, the performances of two algorithms are quite different. This is because the convergence manner of the two algorithms is quite different. Algorithm 1 gradually increases the transmit rate and the required number of BS antennas to converge to the optimal solution, whereas Algorithm 2 gradually decreases the transmit rate and the required number of BS antennas to converge to the optimal solution.Figure 5
Spectral efficiency versus number of users.Figure6 shows the energy efficiency versus the number of iterations for K
=
60. It is observed that the proposed Algorithm 2 achieves 97
% of the convergency performance in 4 iterations, while the proposed Algorithm 2 obtains 71
% of the convergency performance with 6 iterations. In a word, most of the potential energy efficiency can be achieved with a few number of iterations.Figure 6
Energy efficiency versus the number of iterations.Figure7 shows the energy efficiency versus optimal number of base station antennas M
∗ for K
=
42. It is observed that there exist a unique globally optimal number of base station antennas M
∗ to maximize energy efficiency.Figure 7
Energy efficiency versus number of base station antennas.Note that we evaluate the energy efficiency via expression (8) in the above, where the fast fading coefficient is ignored. To investigate the accuracy of this expression under real channel environment and further to examine our proposed algorithms with practical receivers, Figure 8 shows the energy efficiency of the proposed algorithms versus the number of users, where fast fading channels and linear ZF/MMSE receivers [12] are considered. The results show that the performance of the proposed two algorithms evaluated with (8) is very close to that achieved with linear receivers under fading channels.Figure 8
Energy efficiency versus number of users.


## 5. Conclusion

In this paper, we have investigated uplink energy-efficient resource allocation in multiuser massive MIMO systems. Our goal is to jointly optimize rate allocation and the number of antenna arrays at BS, in order to make the performance measure in terms of throughput per Joule maximizing, in which the power consumption includes both transmit power and circuit power. We first demonstrate the existence of a unique globally optimal solution by exploiting the properties of objective function and then develop an iterative algorithm to solve the resource allocation problem. Furthermore, we propose a more efficient iterative algorithm by transforming the originally nonconvex optimization problem in fractional form into an equivalent optimization problem in subtractive form. It is proved that the proposed two algorithms guarantee convergence. And the numerical results show that the proposed algorithms converge to a near-optimal point with a small number of iterations.



---

*Source: 873134-2015-05-05.xml*