Open Access

Energy-efficient precoding in multicell networks with full-duplex base stations

EURASIP Journal on Wireless Communications and Networking20172017:48

https://doi.org/10.1186/s13638-017-0831-5

Received: 2 July 2016

Accepted: 23 February 2017

Published: 14 March 2017

Abstract

This paper considers multi-input multi-output (MIMO) multicell networks, where the base stations (BSs) are full-duplex transceivers, while uplink and downlink users are equipped with multiple antennas and operate in a half-duplex mode. The problem of interest is to design linear precoders for BSs and users to optimize the network’s energy efficiency. Given that the energy efficiency objective is not a ratio of concave and convex functions, the commonly used Dinkelbach-type algorithms are not applicable. We develop a low-complexity path-following algorithm that only invokes one simple convex quadratic program at each iteration, which converges at least to the local optimum. Numerical results demonstrate the performance advantage of our proposed algorithm in terms of energy efficiency.

Keywords

Energy efficiencyCooperative multicell networkFull-duplexing transceiverPrecoder designPath-following convex quadratic programming

1 Introduction

Energy saving has become a pressing ecological/economical concern in dealing with global warming. From this perspective, it is important to reduce the amount of carbon emissions associated with operating modern and sophisticated communication networks [1, 2]. Energy saving also helps to reduce the operational cost since energy consumption constitutes a significant portion of the network expenditure. Green cellular networks (see, e.g., [3, 4]), which aim at optimizing energy efficiency (EE) for communications in terms of bits per joule per hertz have drawn considerable research interests in recent years (see, e.g., [58] and the references therein). In fact, EE has been recognized as the new figure-of-merit in assessing the quality and efficiency of future communication networks and beyond (see, e.g., [911]). For multicell networks, EE requires new approaches for interference management as compared to the more traditional performance metrics [1217], which mainly aim at maximizing the spectral efficiency (SE) in terms of bits per second per hertz.

Full-duplex (FD) communication, which allows simultaneous transmission and reception (over the same frequency band) to and from multiple downlink users (DLUs) and multiple uplink users (ULUs), respectively, has emerged as one of the key techniques for the fifth-generation (5G) networks [1823]. Nevertheless, a challenging issue in realizing FD communication is that the interference is very severe, not only because of the residual FD self-interference (SI) but also the cross interference between the uplink and the downlink transmissions. In this paper, we consider the design of linear precoders to optimize energy efficiency under quality-of-service (QoS) constraints in FD multi-input multi-output (MIMO) multicell networks. Specifically, the BSs are equipped with multiple antennas and operate in the FD mode. There are two separate groups of multi-antenna users (UEs) in each cell, the ULUs and the DLUs, and both groups operate in the hall-duple (HD) mode. To the authors’ best knowledge, such precoder design problem has not been thoroughly addressed, even for MIMO cooperative multicell networks with half-duplex base stations.

It is pointed out that, since the rate function of the users is nonconcave, the QoS in terms of user’s minimum rate constitutes difficult nonconvex constraints, which are addressed very recently in [24] in a different optimization problem. On the other hand, the EE objective is not a ratio of concave and convex functions in order to facilitate the Dinkelbach-type algorithm [25], which is the main tool for obtaining computational solutions of EE optimization problems (see, e.g. [2628] and the references therein). To get around such nonconvexity issue, references [29] and [30] consider the specific zero-forcing precoders to completely cancel the interferences so that the user’s rate function becomes concave and the QoS constraints become convex, while the EE objective becomes a ratio of concave and convex functions. This then allows the application of the Dinkelbach-type algorithm. It should be noted, however, that although having the convex QoS constraints on zero-forcing precoders, the EE optimization problems are still very difficult and there are no polynomial-time algorithms available to solve them. Furthermore, EE optimization for zero-forcing precoders only applies to the case that the number of antennas at each BS is much larger than the total number of users’ antennas. As for the FD cooperative multicell networks considered in this paper, the interference cannot be completely canceled out due to the presence of self-interference [19, 21, 22]; hence, the Dinkelbach-type algorithm is not applicable.

Motivated from the above observations, the aim of this paper is to develop a novel solution approach that directly tackles the nonconvexity of the concerned EE optimization problem. The proposed algorithm is a path-following computational procedure, which invokes a simple convex quadratic program at each iteration. The rest of the paper is structured as follows. Section 2 provides the problem formulation. Section 3 develops its computational solution. Section 4 is devoted to numerical examples. Section 5 concludes the paper.

Notation. All variables are denoted by mathematical sans serif letters. Vectors and matrices are boldfaced. I n denotes the identity matrix of size n×n, while 1 n×m is the all-one matrix of size n×m. The notation (·) H stands for the Hermitian transpose, |A| denotes the determinant of a square matrix A, and Trace(A) denotes the trace of a matrix A. The inner product 〈X,Y〉 is defined as Trace(X H Y), and therefore, the Frobenius squared norm of a matrix X is ||X||2=Trace(X X H ). The notation AB (AB, respectively) means that AB is a positive semidefinite (definite, respectively) matrix. \(\mathbb {E}[\!\cdot ]\) denotes the expectation operator and {·} denotes the real part of a complex number.

2 System model and optimization problem formulations

We consider an MIMO cooperative network consisting of I cells. As illustrated in Fig. 1, the BS of cell i{1,…,I} serves a group of D DLUs in the downlink (DL) channel and a group of U ULUs in the uplink (UL) channel. Each BS operates in the FD mode and is equipped with \({N} \triangleq N_{1}+N_{2}\) antennas, where N 1 antennas are used to transmit and the remaining N 2 antennas to receive signals. In cell i, DLU (i,j D ) and ULU (i,j U ) operate in the HD mode and each is equipped with N r antennas. Similar to other works on precoding and interference suppression (see, e.g., [6, 12, 13, 1517, 29] and references therein), it is assumed in this paper that there are high-performance channel estimation mechanisms in place and a central processing unit is available to collect and disseminate the relevant CSI.
Fig. 1

Illustration of FD multicell network

In the DL, a complex-valued vector \(\mathbf {s}_{i,j_{\mathsf {D}}}\in \mathbb {C}^{d_{1}}\) is the symbols intended for DLU (i,j D ), where \(\mathbb {E}\left [\mathbf {s}_{i,j_{\mathsf {D}}}(\mathbf {s}_{i,j_{\mathsf {D}}})^{H}\right ]=\mathbf {I}_{d_{1}}\), d 1 is the number of concurrent data streams, and d 1≤ min{N 1,N r }. Denote by \(\mathsf {V}_{i,j_{\mathsf {D}}}\in \mathbb {C}^{{N}_{1}\times d_{1}}\) the complex-valued precoding matrix for DLU (i,j D ). Similarly, in the UL, \(\mathbf {s}_{i,j_{\mathsf {U}}}\in \mathbb {C}^{d_{2}}\) is the symbols sent by ULU (i,j U ), where \(\mathbb {E}\left [\mathbf {s}_{i,j_{\mathsf {U}}}(\mathbf {s}_{i,j_{\mathsf {U}}})^{H}\right ]=\mathbf {I}_{d_{2}}\), d 2 is the number of concurrent data streams, and d 2≤ min{N 2,N r }. The precoding matrix of ULU (i,j U ) is denoted as \(\mathsf {V}_{i,j_{\mathsf {U}}}\in \mathbb {C}^{N_{r}\times d_{2}}\). Define
$$ \begin{array}{lll} {\mathcal{I}} &\triangleq& \{1,2,\dots,I\}; \quad {\mathcal{D}} \triangleq \{1_{\mathsf{D}},2_{\mathsf{D}},\dots,D_{\mathsf{D}}\};\\ {\mathcal{U}} &\triangleq& \{1_{\mathsf{U}},2_{\mathsf{U}},\dots,U_{\mathsf{U}}\};\quad {\mathcal{S}}_{1} \triangleq {\mathcal{I}}\times {\mathcal{D}}; \quad {\mathcal{S}}_{2} \triangleq {\mathcal{I}}\times {\mathcal{U}};\\ \mathsf{V} &\triangleq& [\!\mathsf{V}_{i,j}]_{(i,j)\in {\mathcal{S}}_{1}\cup{\mathcal{S}}_{2}}. \end{array} $$
(1)
In the DL channel, the received signal at DLU (i,j D ) is expressed as:
$$\begin{array}{@{}rcl@{}} y_{i,j_{\mathsf{ D}}} &\triangleq& \underbrace{\mathbf{H}_{i,i,j_{\mathsf{D}}}\mathsf{V}_{i,j_{\mathsf{D}}} \mathbf{s}_{i,j_{\mathsf{D}}}}_{{\mathsf{desired\,\, signal}}} +\underbrace{\sum_{(m,\ell_{\mathsf{D}})\in{\mathcal S}_{1}\setminus (i,j_{\mathsf{D}})} \mathbf{H}_{m,i,j_{\mathsf{D}}}\mathsf{V}_{m,\ell_{\mathsf{D}}} \mathbf{s}_{m,\ell_{\mathsf{D}}}}_{{\mathsf{DL\,\, interference}}}\\ &&+\underbrace{\sum_{\ell_{\mathsf{U}}\in{\mathcal U}}\mathbf{H}_{i,j_{\mathsf{D}},\ell_{\mathsf{U}}}\mathsf{V}_{i,\ell_{\mathsf{U}}}\mathbf{s}_{i,\ell_{\mathsf {U}}}}_{{\mathsf{UL intracell\,\, interference}}} + \mathbf{n}_{i,j_{\mathsf{D}}}, \end{array} $$
(2)
where \(\mathbf {H}_{m,i,j_{\mathsf {D}}}\in \mathbb {C}^{N_{r}\times {N}_{1}}\) and \(\mathbf {H}_{i,j_{\mathsf {D}},\ell _{\mathsf {U}}}\in \mathbb {C}^{N_{r}\times N_{r}}\) are the channel matrices from BS m to DLU (i,j D ) and from ULU (i, U ) to DLU (i,j D ), respectively. Also, \(\mathbf {n}_{i,j_{\mathsf {D}}}\) is the additive white Gaussian noise (AWGN) sample, modeled as circularly symmetric complex Gaussian random variable with variance \(\sigma _{\mathsf {D}}^{2}\). Suppose that each BS i employs dirty-paper coding (DPC)-based transmission strategy (see, e.g., [31]) in broadcasting signals to its users. Then the corresponding DL throughput for user (i,j D ) is [32, eq. (4)]
$$ f_{i,j_{\mathsf{D}}}(\mathsf{V}) \triangleq \ln\left|\mathbf{I}_{N_{r}}+{\mathcal L}_{i,j_{\mathsf{D}}}(\mathsf{V}_{i,j_{\mathsf{D}}}){\mathcal L}_{i,j_{\mathsf{D}}}^{H}(\mathsf{V}_{i,j_{\mathsf {D}}}) \Psi_{i,j_{\mathsf{D}}}^{-1}(\mathsf{V})\right|, $$
(3)
where \({\mathcal {L}}_{i,j_{\mathsf {D}}}(\mathsf {V}_{i,j_{\mathsf {D}}}) \triangleq \mathbf {H}_{i,i,j_{\mathsf {D}}}\mathsf {V}_{i,j_{\mathsf {D}}}\) and
$$\begin{array}{@{}rcl@{}} {\mathcal{L}}_{i,j_{\mathsf{D}}}(\mathsf{V}_{i,j_{\mathsf{D}}}){\mathcal L}^{H}_{i,j_{\mathsf{D}}}(\mathsf{V}_{i,j_{\mathsf{D}}}) &=& \mathbf{H}_{i,i,j_{\mathsf{D}}}\mathsf{V}_{i,j_{\mathsf{D}}}\mathsf{V}_{i,j_{\mathsf{D}}}^{H}\mathbf{H}_{i,i,j_{\mathsf{D}}}^{H}, \end{array} $$
(4)
$$\begin{array}{@{}rcl@{}} \Psi_{i,j_{\mathsf{D}}}(\mathsf{V}) &\triangleq &\sum_{(m,\ell_{\mathsf{D}})\in{\mathcal S}_{1}\setminus\{(i,\ell_{\mathsf{D}}), \ell=j, \ldots,D\}} \mathbf{H}_{m,i,j_{\mathsf{D}}}\mathsf{V}_{m,\ell_{\mathsf{D}}}\mathsf{V}_{m,\ell_{\mathsf{D}}}^{H}\mathbf{H}_{m,i,j_{\mathsf {D}}}^{H} \\ &&+\sum_{\ell_{\mathsf{U}}\in{\mathcal{U}}}\mathbf{H}_{i,j_{\mathsf{D}},\ell_{\mathsf{U}}}\mathsf{V}_{i,\ell_{\mathsf {U}}}\mathsf{V}_{i,\ell_{\mathsf{U}}}^{H}\mathbf{H}_{i,j_{\mathsf{D}},\ell_{\mathsf{U}}}^{H}+ \sigma_{\mathsf{D}}^{2}\mathbf{I}_{N_{r}}. \end{array} $$
(5)
Note that DPC-based broadcasting is a capacity achieving transmission, which enables user (i,j D ) view the term \(\sum _{k_{{\mathsf {D}}}<j_{{\mathsf {D}}}}\mathbf {H}_{i,i,j_{{\mathsf {D}}}}\mathsf {V}_{i,k_{{\mathsf { D}}}}\mathbf {s}_{i,k_{{\mathsf {D}}}}\) as known non-causally and thus reduces it from the interference in (3) [33, Lemma 1]. This term is still present under conventional broadcast, for which the interference mapping \(\Psi _{i,j_{\mathsf {D}}}(\mathsf {V})\) in (3) becomes
$$\begin{array}{@{}rcl@{}} \Psi_{i,j_{\mathsf{D}}}(\mathsf{V}) &\triangleq &\sum_{(m,\ell_{\mathsf{D}})\in{\mathcal S}_{1}\setminus\{(i,j_{\mathsf{D}})\}} \mathbf{H}_{m,i,j_{\mathsf{D}}}\mathsf{V}_{m,\ell_{\mathsf{D}}}\mathsf{V}_{m,\ell_{\mathsf{D}}}^{H}\mathbf{H}_{m,i,j_{\mathsf{D}}}^{H} \\ &&+\sum_{\ell_{\mathsf{U}}\in{\mathcal U}}\mathbf{H}_{i,j_{\mathsf{D}},\ell_{\mathsf{U}}}\mathsf{V}_{i,\ell_{\mathsf{U}}}\mathsf{V}_{i,\ell_{\mathsf{U}}}^{H}\mathbf{H}_{i,j_{\mathsf{D}},\ell_{\mathsf{U}}}^{H}+ \sigma_{\mathsf{D}}^{2}\mathbf{I}_{N_{r}}. \end{array} $$
(6)

It is pointed out that our below development is still applicable to the case of conventional broadcast.

In the UL channel, the received signal at BS i can be expressed as
$${\kern-16.5pt} \begin{aligned} y_{i} \triangleq& \underbrace{\sum_{\ell_{\mathsf{U}}\in{\mathcal U}} \mathbf{H}_{i,\ell_{\mathsf{U}},i}\mathsf{V}_{i,\ell_{\mathsf{U}}} \mathbf{s}_{i,\ell_{\mathsf{U}}}}_{{\mathsf{desired\,\, signal}}} +\underbrace{\sum_{m\in{\mathcal I}\setminus \{i\}}\sum_{\ell_{\mathsf{U}}\in{\mathcal U}}\mathbf{H}_{m,\ell_{\mathsf{U}},i}\mathsf{V}_{m,\ell_{\mathsf{U}}} \mathbf{s}_{m,\ell_{\mathsf{U}}}}_{{\mathsf{UL\,\, interference}}}\\ &\!\!+\underbrace{\mathbf{H}_{i}^{{\mathcal S}{\mathcal I}}\sum_{\ell_{\mathsf{D}}\in{\mathcal D}}\mathsf{V}_{i,\ell_{\mathsf{D}}} \tilde{\mathbf{s}}_{i,\ell_{\mathsf{D}}}}_{{\mathsf{residual\,\, SI}}} +\!\underbrace{\sum_{m\in{\mathcal I}\setminus\{i\}}\!\mathbf{H}_{m,i}^{{\mathcal B}}\sum_{j_{\mathsf{D}}\in{\mathcal D}}\!\mathsf{V}_{m,j_{\mathsf{D}}}\mathbf{s}_{m,\mathbf{s}_{\mathsf{D}}}}_{{\mathsf {DL intercell\,\, interference}}}+ \mathbf{n}_{i}, \end{aligned} $$
(7)

where \(\mathbf {H}_{m,\ell _{\mathsf {U}},i}\in \mathbb {C}^{{N}_{2}\times N_{r}}\) and \(\mathbf {H}^{{\mathcal B}}_{m,i}\in \mathbb {C}^{{N}_{2}\times {N}_{1}}\) are the channel matrices from ULU (m, U ) to BS i and from BS m to BS i, respectively. The channel matrix \(\mathbf {H}_{i}^{{\mathcal S}{\mathcal I}}\in \mathbb {C}^{{N}_{2}\times {N}_{1}}\) represents the residual self-loop channel from the transmit antennas to the receive antennas at BS i after all real-time interference cancelations in both analog and digital domains [22, 34] are accounted for (more detailed discussion on modelling the SI channel can be found in [22, 34]). The additive Gaussian noise vector \(\tilde {\mathbf {s}}_{i,\ell _{\mathsf {D}}}\) with \(\mathbb {E}\left [\tilde {\mathbf {s}}_{i,j_{\mathsf {D}}}(\tilde {\mathbf {s}}_{i,j_{\mathsf {D}}})^{H}\right ]=\sigma _{\text {SI}}^{2}\mathbf {I}_{d_{1}}\) models the effects of the analog circuit’s non-ideality and the limited dynamic range of the analog-to-digital converter (ADC) [19, 23, 34, 35]. The SI level \(\sigma _{\text {SI}}^{2}\) is the ratio of the average SI powers before and after the SI cancelation process. Lastly, n i is the AWGN sample, modeled as circularly-symmetric complex Gaussian random variable with variance \(\sigma _{\mathsf {U}}^{2}\).

By treating the entries of the self-loop channel \(\mathbf {H}_{i}^{{\mathcal {S}}{\mathcal {I}}}\) in (7) as independent circularly symmetric complex Gaussian random variables with zero mean and unit variance, the power of the residual SI in (7) is
$${} {{\begin{aligned} \sigma_{\text{SI}}^{2}\mathbb{E}\left\{\mathbf{H}_{i}^{{\mathcal{S}}{\mathcal I}}\left(\sum_{\ell_{D}\in{\mathsf{D}}}\mathsf{V}_{i,\ell_{D}}\mathsf{V}_{i,\ell_{D}}^{H}\right)(\mathbf{H}_{i}^{{\mathcal S}{\mathcal I}})^{H}\right\} = \sigma_{\text{SI}}^{2}\left(\sum_{\ell_{D}\in{\mathsf{D}}}||\mathsf{V}_{i,\ell_{D}}||^{2}\right) \mathbf{I}_{N_{r}}. \end{aligned}}} $$
(8)

It is important to point out that the above power expression only depends on the BS transmit power, and it cannot be changed by precoder matrices \(\mathsf {V}_{i,\ell _{\sf D}}\).

Given that the minimum mean square error–successive interference cancelation (MMSE-SIC) detector is the most popular detection method in uplink communications, this type of receiver is also adopted in this paper. Under the MMSE-SIC receiver, the achievable uplink throughput at BS i is given as [36]
$$\begin{array}{*{20}l} f_{i}(\mathsf{V}) &\triangleq \ln\left|\mathbf{I}_{{N}_{2}} + {\mathcal L}_{i}(\mathsf{V}_{{\mathsf{U}} i}){\mathcal L}_{i}^{H}(\mathsf{V}_{{\mathsf{U}} i})\Psi_{i}^{-1}(\mathsf{V})\right|, \end{array} $$
(9)
where
$$ \begin{aligned} \mathsf{V}_{{\mathsf{U}} i} &\triangleq (\mathsf{V}_{i,\ell_{\mathsf{U}}})_{\ell_{\mathsf{U}}\in{\mathcal U}}, {\mathcal L}_{i}(\mathsf{V}_{{\mathsf{U}} i})\\ &\triangleq \left[ \mathbf{H}_{i,1_{\mathsf{U}},i}\mathsf{V}_{i,1_{\mathsf{U}}}, \mathbf{H}_{i,2_{\mathsf{U}},i}\mathsf{V}_{i,2_{\mathsf{U}}}, \dots, \mathbf{H}_{i,U_{\mathsf{U}},i}\mathsf{V}_{i,U_{\mathsf{U}}} \right], \end{aligned} $$
(10)
and
$$ \begin{aligned} {\mathcal{L}}_{i}(\mathsf{V}_{{\mathsf{U}} i}){\mathcal L}_{i}^{H}(\mathsf{V}_{{\mathsf{U}} i}) &= \sum_{\ell=1}^{U}\mathbf{H}_{i,\ell_{\mathsf{U}},i}\mathsf{V}_{i,\ell_{\mathsf{U}}}\mathsf{V}_{i,\ell_{\mathsf{U}}}^{H}\mathbf{H}_{i,\ell_{\mathsf{U}},i}^{H}, \end{aligned} $$
(11)
$${\kern-16.5pt} \begin{aligned} \Psi_{i}(\mathsf{V}) \triangleq& \sum_{m\in{ I}\setminus \{i\}}\sum_{\ell_{\mathsf{U}}\in{\mathcal U}}\mathbf{H}_{m,\ell_{\mathsf{U}},i}\mathsf{V}_{m,\ell_{\mathsf{U}}} \mathsf{V}_{m,\ell_{\mathsf{U}}}^{H}\mathbf{H}_{m,\ell_{\mathsf{U}},i}^{H}\\&+\sigma_{\text{SI}}^{2}(\sum_{\ell_{D}\in{\mathsf{D}}}||\mathsf{V}_{i,\ell_{D}}||^{2}) \mathbf{I}_{N_{r}}\\ &+\sum_{m\in{\mathcal I}\setminus\{i\}}\mathbf{H}_{m,i}^{{\mathcal B}}\!\left(\sum_{j_{\mathsf{D}}\in{\mathcal D}}\mathsf{V}_{m,j_{\mathsf{D}}}\mathsf{V}_{m,j_{\mathsf{D}}}^{H}\!\!\right)\!(\mathbf{H}_{m,i}^{{\mathcal B}})^{H} +\sigma_{\mathsf{U}}^{2}\mathbf{I}_{{N}_{2}}. \end{aligned} $$
(12)
Following [37], the consumed power \(P^{\text {tot}}_{i}\) of cell i can be modeled as
$$ P^{\text{tot}}_{i}(\mathsf{V}) = \zeta P^{t}_{i}(\mathsf{V}) + P^{\text{BS}} + UP^{\text{UE}}, $$
(13)
where \(P^{t}_{i}(\mathsf {V})\triangleq \underset {{j_{\mathsf {D}}\in {\mathcal D}}}{\sum } ||\mathsf {V}_{i,j_{\mathsf {D}}}||^{2}+\underset {j_{\mathsf {U}}\in {\mathcal U}}{\sum } ||\mathsf {V}_{i,j_{\mathsf {U}}}||^{2}\) is the total transmit power of BS and UEs in cell i and ζ is the reciprocal of drain efficiency of power amplifier. Alo P BS=N 1 P b and P UE=N r P u are the circuit powers of BS and UE, respectively, where P b and P u represent the per-antenna circuit power of BS and UEs, respectively. Consequently, the energy efficiency of cell i is defined by
$$ \frac{\underset{j_{\sf D}\in{\mathcal D}}{\sum}f_{i,j_{\sf D}}(\mathsf{V})+f_{i}(\mathsf{V})}{P^{\text{tot}}_{i}(\mathsf{V})}. $$
(14)
In this paper, we consider the following precoder design to optimize the network’s energy efficiency:
$$\begin{array}{*{20}l} \max_{\mathsf{V}}\ \min_{i\in {\mathcal I}}\frac{\underset{j_{\mathsf{D}}\in{\mathcal D}}{\sum}f_{i,j_{\mathsf{D}}}(\mathsf{V})+f_{i}(\mathsf{V})} {P^{\text{tot}}_{i}(\mathsf{V})} & \mathrm{s.t.} \end{array} $$
(15a)
$$\begin{array}{*{20}l} \sum_{j_{\mathsf{D}}\in{\mathcal D}}|| \mathsf{V}_{i,j_{\mathsf{D}}}||^{2} \le P^{\max}_{\text{BS}}, \ i\in{\mathcal I},& \end{array} $$
(15b)
$$\begin{array}{*{20}l} ||\mathsf{V}_{i,j_{\mathsf{U}}}||^{2} \le P^{\max}_{\text{UE}}, \ (i,j_{\mathsf{U}})\in{\mathcal S}_{2},& \end{array} $$
(15c)
$$\begin{array}{*{20}l} f_{i,j_{\mathsf{D}}}(\mathsf{V}) \ge r_{i,j_{\sf D}}^{\min}, \ (i,j_{\mathsf{D}})\in{\mathcal S}_{1} & \end{array} $$
(15d)
$$\begin{array}{*{20}l} f_{i}(\mathsf{V}) \ge r_{i}^{{\mathsf{U}},\min}, \ i\in{\mathcal I},& \end{array} $$
(15e)

where (15b)-(15c) limit the transmit powers for each BS and ULU, while (15d)-(15e) are the QoS constraints for both downlink and uplink transmissions.

On the other hand, the problem of optimizing the energy efficiency in DL transmission only is formulated as follows:
$$\begin{array}{*{20}l} {}\max_{\mathsf{V}^{\text{DL}}=[\mathsf{V}_{i,j_{{\mathsf{D}}}}]_{(i,j_{{\mathsf{D}}})\in{\mathcal S}_{1}}}\min_{i\in {\mathcal I}}\frac{\underset{j_{\mathsf{D}} \in{\mathcal D}}{\sum}f_{i,j_{\mathsf{D}}}^{\text{DL}}(\mathsf{V}^{\text{DL}})} {\zeta\underset{j_{\mathsf{ D}}\in{\mathcal D}}{\sum}||\mathsf{V}_{i,j_{\mathsf{ D}}}||^{2} + P^{\text{BS}}}\ \mathrm{s.t.}\,\,\,(15b),& \end{array} $$
(16a)
$$\begin{array}{*{20}l} f_{i,j_{\mathsf{ D}}}^{\text{DL}}(\mathsf{V}^{\text{DL}})\ge r_{i,j_{\mathsf{ D}}}^{\min}, \ (i,j_{\mathsf{ D}})\in{\mathcal S}_{1}& \end{array} $$
(16b)
with
$$\begin{array}{@{}rcl@{}} f_{i,j_{\mathsf{D}}}^{\text{DL}}(\mathsf{V}^{\text{DL}})&\triangleq&\ln\left|\mathbf{I}_{N_{r}}+\mathbf{H}_{i,i,j_{\mathsf {D}}}\mathsf{V}_{i,j_{\mathsf{D}}}\mathsf{V}_{i,j_{\mathsf{D}}}^{H} \mathbf{H}_{i,i,j_{\mathsf{D}}}^{H}\right.\\ &&\times (\sum_{(m,\ell_{\mathsf{ D}})\in{\mathcal S}_{1}\setminus\{(i,\ell_{\mathsf {D}}), \ell=j, \ldots,D\}} \mathbf{H}_{m,i,j_{\mathsf{ D}}}\mathsf{V}_{m,\ell_{\mathsf{ D}}}\\ &&\times \left.\left.\mathsf{V}_{m,\ell_{\mathsf{ D}}}^{H}\mathbf{H}_{m,i,j_{\mathsf{ D}}}^{H}+\sigma_{\mathsf{ D}}^{2}\mathbf{I}_{N_{r}} \right)^{-1}\right|. \end{array} $$
(17)
Likewise, the problem of optimizing the energy efficiency in the UL transmission only is
$$\begin{array}{*{20}l} \max_{\mathsf{V}^{\text{UL}}=[\mathsf{V}_{i,\ell_{{\mathsf{ U}}}}]_{(i,\ell_{{\mathsf{ U}}})\in{\mathcal S}_{2}}}\min_{i\in {\mathcal I}}\frac{f_{i}^{\text{UL}}(\mathsf{V}^{\text{UL}})} {\zeta\underset{\ell_{\sf U}\in{\mathcal U}}{\sum} ||\mathsf{V}_{i,\ell_{\mathsf{U}}}||^{2} + UP^{\text{UE}}}\ \ \mathrm{s.t.}\,\,\,\, {(15c)},& \end{array} $$
(18a)
$$\begin{array}{*{20}l} f_{i}^{\text{UL}}(\mathsf{V}^{\text{UL}})\geq r_{i}^{{\mathsf{ U}},\min}, \ i\in{\mathcal I},& \end{array} $$
(18b)
with
$${} {{\begin{aligned} f_{i}^{\text{UL}}(\mathsf{V}^{\text{UL}})&\triangleq \ln\left|{\vphantom{\left(\underset{m\in{\mathcal I}\setminus \{i\}}{\sum}\sum_{\ell_{\mathsf{ U}}\in{\mathcal U}}\mathbf{H}_{m,\ell_{\mathsf{ U}},i}\mathsf{V}_{m,\ell_{\mathsf{ U}}} \mathsf{V}_{m,\ell_{\mathsf{U}}}^{H}\mathbf{H}_{m,\ell_{\mathsf{ U}},i}^{H}+\sigma_{\mathsf{ U}}^{2}\mathbf{I}_{{N}_{2}}\right)}}\mathbf{I}_{{N}_{2}} +\sum_{\ell=1}^{U}\mathbf{H}_{i,\ell_{\mathsf{ U}},i}\mathsf{V}_{i,\ell_{\mathsf{U}}}\mathsf{V}_{i,\ell_{\mathsf{ U}}}^{H}\mathbf{H}_{i,\ell_{\mathsf{U}},i}^{H}\right.\\ &\left.\quad\!\times\left(\underset{m\in{\mathcal I}\setminus \{i\}}{\sum}\sum_{\ell_{\mathsf{ U}}\in{\mathcal U}}\!\mathbf{H}_{m,\ell_{\mathsf{ U}},i}\mathsf{V}_{m,\ell_{\mathsf{ U}}} \mathsf{V}_{m,\ell_{\mathsf{U}}}^{H}\mathbf{H}_{m,\ell_{\mathsf{ U}},i}^{H}+\sigma_{\mathsf{ U}}^{2}\mathbf{I}_{{N}_{2}}\!\!\right)^{-1}\right|. \end{aligned}}} $$
(19)
As discussed before, for the downlink EE optimization problem (16), references [29] and [30] apply zero-forcing precoders so that all the interference terms in (5) are completely canceled, making \(f_{i,j_{\sf D}}^{\text {DL}}(\mathsf {V}^{\text {DL}})=\ln \left |\mathbf {I}_{N_{r}}+\mathbf {H}_{i,i,j_{\mathsf {D}}}\mathsf {V}_{i,j_{\mathsf { D}}}\mathsf {V}_{i,j_{\mathsf { D}}}^{H} \mathbf {H}_{i,i,j_{\mathsf { D}}}^{H}/\sigma _{{\mathsf { D}}}^{2}\right |\). Then by making the variable change \(\mathsf {X}_{i,j_{\mathsf { D}}}=\mathsf {V}_{i,j_{\mathsf { D}}}\mathsf {V}_{i,j_{\mathsf { D}}}^{H}\), the EE optimization for zero-forcing precoders becomes:
$$\begin{array}{*{20}l} &\!\!\!\!\!\!\!\!\!\!\!\!\max_{\mathsf{X}^{\text{DL}}=[\mathsf{X}_{i,j_{{\mathsf{D}}}}]_{(i,j_{{\mathsf{ D}}})\in{\mathcal S}_{1}}}\min_{i\in {\mathcal I}}\\ &\times\frac{\underset{j_{\sf D}\in{\mathcal D}}{\sum} \ln\left|\mathbf{I}_{N_{r}}+\mathbf{H}_{i,i,j_{\mathsf{ D}}}\mathsf{X}_{i,j_{\mathsf{ D}}}^{H} \mathbf{H}_{i,i,j_{\mathsf{ D}}}^{H}/\sigma_{{\mathsf{ D}}}^{2}\right|} {\zeta\underset{j_{\sf D}\in{\mathcal D}}{\sum}\text{Trace}(\mathsf{X}_{i,j_{\mathsf {D}}}) + P^{\text{BS}}}\quad \mathrm{s.t.}\quad \end{array} $$
(20a)
$$\begin{array}{*{20}l} &\sum_{j_{\mathsf {D}}\in{\mathcal D}}\text{Trace}(\mathsf{X}_{i,j_{\mathsf{ D}}}) \le P^{\max}_{\text{BS}}, \ i\in{\mathcal I}, \end{array} $$
(20b)
$$\begin{array}{*{20}l} &\ln\left|\mathbf{I}_{N_{r}}+\mathbf{H}_{i,i,j_{\mathsf{ D}}}\mathsf{X}_{i,j_{\mathsf{ D}}}^{H} \mathbf{H}_{i,i,j_{\mathsf{D}}}^{H}/\sigma_{{\mathsf{ D}}}^{2}\right|\ge r_{i,j_{\mathsf{ D}}}^{\min}, \ (i,j_{\mathsf{D}})\in{\mathcal S}_{1}, \end{array} $$
(20c)
$$\begin{array}{*{20}l} &\mathsf{X}^{\text{DL}}\in Z_{zf}, \end{array} $$
(20d)
where the last linear constraint (20d) is to explicitly specify a zero-forcing precoder. Since the numerator in the objective (20a) is concave in \(\mathsf {X}_{i,j_{\sf D}}\), the problem expressed in (20) is maximin optimization of concave-convex function ratios. To solve such problem, references [29] and [30] use the Dinkelbach-type algorithm [25]. Specifically, the optimal value of (20) is found as the maximum of γ for which the optimal value of the following convex program is nonnegative:
$${} {{\begin{aligned} \max_{\mathsf{X}^{\text{DL}}=[\mathsf{X}_{i,j_{{\mathsf{ D}}}}]_{(i,j_{{\mathsf {D}}})\in{\mathcal S}_{1}}}\min_{i\in {\mathcal I}} \left[\sum_{j_{\sf D}\in{\mathcal D}} \ln\left|\mathbf{I}_{N_{r}}+\mathbf{H}_{i,i,j_{\mathsf{D}}}\mathsf{X}_{i,j_{\mathsf{ D}}}^{H} \mathbf{H}_{i,i,j_{\mathsf{ D}}}^{H}/\sigma_{{\mathsf{ D}}}^{2}\right|\right.\\\left. -\gamma\left(\zeta\sum_{j_{\mathsf{ D}}\in{\mathcal D}}\text{Trace}(\mathsf{X}_{i,j_{\mathsf {D}}}) + P^{\text{BS}}\right)\right] \quad \mathrm{s.t.}\ \ \ (20b), (20c), (20d). \end{aligned}}} $$
(21)

It should be noted that, although being convex for fixed γ, the program (21) is still computationally difficult. This is because the concave objective function and convex constraints (20c) in (21) involve log-det functions. In fact, no polynomial-time algorithms are known to find the solution. Another issue is that the zero-forcing constraint (20d) in (21) would rule out the effectiveness of the optimization, unless the total number (N·I) of the BSs’ antennas is much larger than the total number (I·D·N r ) of DLUs’ antennas.

The optimal value of (7) is still the maximum of γ>0 such that the optimal value of the following program is nonnegative
$${\kern-15.9pt} {{\begin{aligned} \max_{\mathsf{V}}\ \min_{i\in {\mathcal I}}\ \left[\underset{j_{\mathsf{D}}\in{\mathcal D}}{\sum}f_{i,j_{\mathsf{ D}}}(\mathsf{V})+f_{i}(\mathsf{V})-\gamma P^{\text{tot}}_{i}(\mathsf{V})\right]\quad\mathrm{s.t.}\quad \protect{(15b)-(15e)}. \end{aligned}}} $$
(22)

However, problem (22) is a very difficult nonconvex optimization even for a fixed γ>0 because its objective function is obviously nonconcave while its constraints (15e) are highly nonconvex. In fact, one can see that (22) for a fixed γ is not easier than the original nonconvex optimization problem (15). In the next section we will develop a path-following procedure for computing the solution of (15) that avoids the setting (22).

3 Path-following quadratic programming

With the newly introduced variable t=(t 1,…,t I ), t i >0,i=1,2,…,I and under the convex quadratic constraints
$$ \zeta\underset{j_{\sf D}\in{\mathcal D}}{\sum}|| \mathsf{V}_{i,j_{\mathsf{D}}}||^{2}+\sum_{j_{\mathsf{U}}\in{\mathcal U}} ||\mathsf{V}_{i,j_{\mathsf{U}}}||^{2}+P^{\text{BS}}+UP^{\text{UE}}\leq \mathsf{t}_{i}, i\in{\mathcal I}, $$
(23)
problem (15) is equivalently expressed by
$$\begin{array}{@{}rcl@{}} &\underset{\mathsf{V},\mathsf{t}}{\max}\ {\mathcal P}(\mathsf{V},\mathsf{t})\triangleq \min_{i\in {\mathcal I}}\frac{\sum_{j_{\mathsf{ D}}\in{\mathcal D}}f_{i,j_{\mathsf{ D}}}(\mathsf{V})+f_{i}(\mathsf{V})} {\mathsf{t}_{i}}&\\ & \mathrm{s.t.}\quad \protect{(15b), (15c), (15d), (15e), (23)}. \end{array} $$
(24)
Let
$$ \begin{array}{lll} {\mathcal M}_{i,j_{\mathsf{ D}}}(\mathsf{V}) &\triangleq&{\mathcal L}_{i,j_{\mathsf{ D}}}(\mathsf{V}_{i,j_{\mathsf{ D}}}){\mathcal L}_{i,j_{\mathsf{ D}}}^{H}(\mathsf{V}_{i,j_{\mathsf{ D}}}) +\Psi_{i,j_{\mathsf{ D}}}(\mathsf{V})\\ & \succeq& \Psi_{i,j_{\mathsf{ D}}}(\mathsf{V}), \end{array} $$
(25)
and
$$ \begin{array}{lll} {\mathcal M}_{i}(\mathsf{V}) &\triangleq& {\mathcal L}_{i}(\mathsf{V}_{{\mathsf{ U}} i}){\mathcal L}_{i}^{H}(\mathsf{V}_{{\mathsf{U}} i})+\Psi(\mathsf{V}_{i})\\ & \succeq& \Psi(\mathsf{V}_{i}). \end{array} $$
(26)
At \(\mathbf {V}^{(\kappa)}\triangleq \left [\mathbf {V}^{(\kappa)}_{i,j}\right ]_{(i,j)\in {\mathcal S}_{1}\cup {\mathcal S}_{2}}\), which is feasible to (15b)-(15e), define the following quadratic functions in V:
$${} {{\begin{aligned} \Theta^{(\kappa)}_{i,j_{\mathsf {D}}}(\mathsf{V}) &\triangleq a_{i,j_{\mathsf{ D}}}^{(\kappa)}+2\Re\left\{\langle \Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i,j_{\mathsf{ D}}}(\mathbf{V}^{(\kappa)}_{i,j_{\mathsf{ D}}}),{\mathcal L}_{i,j_{\mathsf{ D}}}(\mathsf{V}_{i,j_{\mathsf{ D}}})\rangle\right\}\\ &\quad-\langle \Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}) -{\mathcal M}_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}), {\mathcal M}_{i,j_{\mathsf{ D}}}(\mathsf{V})\rangle\\ &=a_{i,j_{\mathsf{ D}}}^{(\kappa)}+2\Re\left\{\text{Trace}\left((\mathbf{V}^{(\kappa)}_{i,j_{\mathsf {D}}})^{H}\mathbf{H}_{i,i,j_{\mathsf{ D}}}^{H} \Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)})\mathbf{H}_{i,i,j_{\mathsf{ D}}}\mathsf{V}_{i,j_{\mathsf{ D}}}\right)\right\}\\ &\quad-\sum_{(m,\ell_{\mathsf{ D}})\in{\mathcal S}_{1}\setminus\{(i,\ell_{\mathsf{ D}}), \ell=j+1, \ldots,D\}}\! \text{Trace} \left(\mathsf{V}_{m,\ell_{\mathsf{ D}}}^{H}\mathbf{H}_{m,i,j_{\mathsf{ D}}}^{H}\left(\Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)})\right.\right.\\ &\quad\left.\left.\!-{\mathcal M}_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)})\right)\mathbf{H}_{m,i,j_{\mathsf{ D}}}\mathsf{V}_{m,\ell_{\mathsf{ D}}}\right)\\ &\quad-\sum_{\ell_{\mathsf{ U}}\in{\mathcal U}}\text{Trace}\left(\mathsf{V}_{i,\ell_{\mathsf{ U}}}^{H} \mathbf{H}_{i,j_{\mathsf{ D}},\ell_{\mathsf{ U}}}^{H} \left(\Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)})\right.\right.\\ &\quad\left.\left.-{\mathcal M}_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)})\right) \mathbf{H}_{i,j_{\mathsf {D}},\ell_{\mathsf{ U}}} \mathsf{V}_{i,\ell_{\mathsf{ U}}}\right)\\ &\quad-\sigma_{\sf D}^{2}\text{Trace}\left(\Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}) -{\mathcal M}_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)})\right) \end{aligned}}} $$
(27)
and
$${} {{\begin{aligned} \Theta^{(\kappa)}_{i}(\mathsf{V}) &\triangleq a_{i}^{(\kappa)}+2\Re\left\{\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i}(\mathbf{V}^{(\kappa)}_{{\mathsf {U}} i}),{\mathcal L}_{i}(\mathsf{V}_{{\mathsf{ U}} i})\rangle\right\}\\ &\quad-\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)}),{\mathcal M}_{i}(\mathsf{V}) \rangle\\ &= a_{i}^{(\kappa)}+2\sum_{\ell=1}^{U}\!\Re\!\left\{\text{Trace}\left((\mathbf{V}^{(\kappa)}_{i,\ell_{\mathsf {U}}})^{H}\mathbf{H}_{i,\ell_{\mathsf{ U}},i}^{H} \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})\mathbf{H}_{i,\ell_{\mathsf{ U}},i}\mathsf{V}_{i,\ell_{\mathsf{ U}}}\right)\!\right\}\\ &\quad-\sum_{m\in{\mathcal I}}\sum_{\ell_{\mathsf{ U}}\in{\mathcal U}}\text{Trace}\left(\mathsf{V}_{m,\ell_{\mathsf{ U}}}^{H}\mathbf{H}_{m,\ell_{\mathsf{ U}},i}^{H} (\Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})\right.\\ &\left.\quad-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)}))\mathbf{H}_{m,\ell_{\mathsf {U}},i}\mathsf{V}_{m,\ell_{\mathsf{ U}}} \right)\\ &\quad-\sigma_{\text{SI}}^{2}\text{Trace}(\left(\Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)})\right)\sum_{\ell_{\mathsf{D}}\in{\mathcal D}}||\mathsf{V}_{i,\ell_{\mathsf{ D}}}||^{2}\\ &\quad-\sum_{m\in{\mathcal I}\setminus\{i\}}\sum_{j_{\mathsf{ D}}\in{\mathcal D}}\text{Trace}\left(\mathsf{V}_{m,j_{\mathsf{ D}}}^{H}(\mathbf{H}_{m,i}^{{\mathcal B}})^{H} (\Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})\right.\\ &\left.\quad-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)}))\mathbf{H}_{m,i}^{{\mathcal B}}\mathsf{V}_{m,j_{\sf D}}\right)\\ &\quad-\sigma_{\sf U}^{2}\text{Trace}\left(\Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)}) \right). \end{aligned}}} $$
(28)
These functions are concave because \(\Psi _{i,j_{\mathsf { D}}}^{-1}(\mathbf {V}^{(\kappa)}) -{\mathcal M}_{i,j_{\mathsf { D}}}^{-1}(\mathbf {V}^{(\kappa)})\succeq 0\) and \(\Psi _{i}^{-1}(\mathbf {V}^{(\kappa)})-{\mathcal M}_{i}^{-1}(\mathbf {V}^{(\kappa)})\succeq 0\). Also
$${} \begin{aligned} 0>a_{i,j_{\mathsf{ D}}}^{(\kappa)}&= f_{i,j_{\mathsf{ D}}}(\mathbf{V}^{(\kappa)})- \langle \Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i,j_{\mathsf{ D}}}(\mathbf{V}^{(\kappa)}_{i,j_{\mathsf{ D}}}),{\mathcal L}_{i,j_{\mathsf{ D}}}(\mathbf{V}^{(\kappa)}_{i,j_{\mathsf{ D}}})\rangle\\ 0>a_{i}^{(\kappa)} &= f_{i}(\mathbf{V}^{(\kappa)})-\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i}(\mathbf{V}^{(\kappa)}_{{\mathsf{ U}} i}),{\mathcal L}_{i}(\mathbf{V}^{(\kappa)}_{{\mathsf{ U}} i})\rangle, \end{aligned} $$
(29)
which follows from the inequality1
$$ \ln|\mathbf{I}+\mathbf{X}|\leq \text{Trace}(\mathbf{X}),\quad \forall\ \mathbf{X}\succeq 0. $$
(30)

The following result shows that the highly nonlinear and nonconcave functions \(f_{i,j_{\mathsf {D}}}(\cdot)\) and f i (·) in problem (15) can be globally and locally approximated by concave quadratic functions.

Theorem 1

It is true that [24]
$$\begin{array}{*{20}l} f_{i,j_{{\mathsf{D}}}}(\mathbf{V}^{(\kappa)})=\Theta^{(\kappa)}_{i,j_{{\mathsf {D}}}}(\mathbf{V}^{(\kappa)})&\, \text{and} \, f_{i,j_{{\mathsf{D}}}}(\mathsf{V})\geq\Theta^{(\kappa)}_{i,j_{{\mathsf{D}}}}(\mathsf{V})\quad\forall\ \mathsf{V}, \end{array} $$
(31)
$$\begin{array}{*{20}l} f_{i}(\mathbf{V}^{(\kappa)})=\Theta^{(\kappa)}_{i}(\mathbf{V}^{(\kappa)})&\,\text{and}\, f_{i}(\mathsf{V})\geq\Theta^{(\kappa)}_{i}(\mathsf{V})\quad\forall\ \mathsf{V}. \end{array} $$
(32)
It follows from the above theorem that the nonconvex QoS constraints (15d) and (15e) can be innerly approximated by the following convex quadratic constraints:
$$ \Theta^{(\kappa)}_{i,j_{\sf D}}(\mathsf{V}) \geq r_{i,j_{\sf D}}^{\min}, \ (i,j_{\sf D})\in{\mathcal S}_{1}; \quad \Theta^{(\kappa)}_{i}(\mathsf{V}) \geq r_{i}^{{\sf U},\min}, \ i\in{\mathcal I}. $$
(33)
These constraints also yield
$${} {{\begin{aligned} \Re\left\{\langle \Psi_{i,j_{\sf D}}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i,j_{\sf D}}(\mathbf{V}^{(\kappa)}_{i,j_{\sf D}}),{\mathcal L}_{i,j_{\sf D}}(\mathsf{V}_{i,j_{\sf D}})\rangle\right\}&\geq\\ -a_{i,j_{\sf D}}^{(\kappa)}+\langle \Psi_{i,j_{\sf D}}^{-1}(\mathbf{V}^{(\kappa)}) -{\mathcal M}_{i,j_{\sf D}}^{-1}(\mathbf{V}^{(\kappa)}), {\mathcal M}_{i,j_{\sf D}}(\mathsf{V})\rangle&\geq 0, \ (i,j_{\sf D})\in{\mathcal S}_{1}, \end{aligned}}} $$
(34)
and
$${} {{\begin{aligned} \Re\left\{\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i}(\mathbf{V}^{(\kappa)}_{{\sf U} i}),{\mathcal L}_{i}(\mathsf{V}_{{\mathsf{U}} i})\rangle\right\}&\geq&\\ -a_{i}^{(\kappa)}+\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)}),{\mathcal M}_{i}(\mathsf{V}) \rangle&\geq& 0, \ i\in{\mathcal I}. \end{aligned}}} $$
(35)
Therefore, by using the inequality2
$${} {{\begin{aligned} \frac{x}{t_{i}}\geq 2\frac{\sqrt{x^{(\kappa)}}\sqrt{x}}{t_{i}^{(\kappa)}}-\frac{x^{(\kappa)}}{(t_{i}^{(\kappa)})^{2}}t_{i}\quad\forall x>0, x^{(\kappa)}>0, t_{i}>0, t_{i}^{(\kappa)}>0, \end{aligned}}} $$
(36)
we obtain
$${} \begin{array}{rll} \displaystyle\frac{\Re\left\{\langle \Psi_{i,j_{\sf D}}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i,j_{\sf D}}(\mathbf{V}^{(\kappa)}_{i,j_{\sf D}}), {\mathcal L}_{i,j_{\mathsf{ D}}}(\mathsf{V}_{i,j_{\mathsf{ D}}})\rangle\right\}}{\mathsf{t}_{i}} &\geq&\varphi_{i,j_{\mathsf{ D}}}^{(\kappa)}(\mathsf{V}_{i,j_{\mathsf{ D}}},\mathsf{t}_{i}),\\ \frac{\Re\left\{\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i}(\mathbf{V}^{(\kappa)}_{{\mathsf{ U}} i}),{\mathcal L}_{i}(\mathsf{V}_{{\mathsf{ U}} i})\rangle\right\}}{\mathsf{t}_{i}}&\geq&\varphi^{(\kappa)}_{i}(\mathsf{V}_{{\mathsf{ U}} i},\mathsf{t}_{i}) \end{array} $$
(37)
for
$${} {{\begin{aligned} \varphi_{i,j_{\mathsf{D}}}^{(\kappa)}(\mathsf{V}_{i,j_{\mathsf{D}}},\mathsf{t}_{i})&\triangleq 2b_{i,j_{\mathsf{D}}}^{(\kappa)}\sqrt{\Re\left\{\langle \Psi_{i,j_{\mathsf{D}}}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i,j_{\mathsf{D}}}(\mathbf{V}^{(\kappa)}_{i,j_{\mathsf{D}}}),{\mathcal L}_{i,j_{\mathsf{D}}}(\mathsf{V}_{i,j_{\mathsf{D}}})\rangle\right\}}- c_{i,j_{\mathsf{D}}}^{(\kappa)}\mathsf{t}_{i}\\ \varphi^{(\kappa)}_{i}(\mathsf{V}_{{\mathsf{U}} i},\mathsf{t}_{i})&\triangleq 2b_{i}^{(\kappa)}\sqrt{\Re\left\{\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)}){\mathcal L}_{i}(\mathbf{V}^{(\kappa)}_{{\mathsf{U}} i}),{\mathcal L}_{i}(\mathsf{V}_{{\mathsf{U}} i})\rangle\right\}} -c_{i}^{(\kappa)}\mathsf{t}_{i}, \end{aligned}}} $$
(38)
where
$$ \begin{aligned} b_{i,j_{\mathsf{D}}}^{(\kappa)}&=\frac{\sqrt{\langle \Psi_{i,j_{\sf D}}^{-1}\left(\mathbf{V}^{(\kappa)}\right){\mathcal{L}}_{i,j_{\mathsf{D}}}\left(\mathbf{V}^{(\kappa)}_{i,j_{\mathsf{D}}}\right),{\mathcal L}_{i,j_{\mathsf{ D}}}\left(\mathbf{V}^{(\kappa)}_{i,j_{\mathsf{ D}}}\right)\rangle} }{\mathsf{t}_{i}^{(\kappa)}}\\ &\quad>0,\ c_{i,j_{\mathsf{ D}}}^{(\kappa)}=\left(b_{i,j_{\mathsf{ D}}}^{(\kappa)}\right)^{2}>0,\\ b_{i}^{(\kappa)}&=\frac{\sqrt{\Re\left\{\langle \Psi_{i}^{-1}\left(\mathbf{V}^{(\kappa)}\right){\mathcal L}_{i}\left(\mathbf{V}^{(\kappa)}_{{\mathsf{ U}} i}\right),{\mathcal L}_{i}\left(\mathbf{V}^{(\kappa)}_{{\mathsf{ U}} i}\right)\rangle\right\}}}{\mathsf{t}_{i}^{(\kappa)}}\\ &\quad>0,\ c_{i}^{(\kappa)}=\left(b_{i}^{(\kappa)}\right)^{2}>0. \end{aligned} $$
(39)
It is pointed out that functions \(\varphi _{i,j_{\sf D}}^{(\kappa)}\) and \(\varphi ^{(\kappa)}_{i}\) are concave [38]. Furthermore, define functions
$$ \begin{aligned} g^{(\kappa)}_{i,j_{\mathsf{D}}}(\mathsf{V},\mathsf{t}_{i})&\triangleq \frac{a_{i,j_{\mathsf {D}}}^{(\kappa)}}{\mathsf{t}_{i}}+2\varphi_{i,j_{\mathsf{ D}}}^{(\kappa)}(\mathsf{V}_{i,j_{\mathsf {D}}},\mathsf{t}_{i})\\ &\quad- \frac{\langle \Psi_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}) -{\mathcal M}_{i,j_{\mathsf{ D}}}^{-1}(\mathbf{V}^{(\kappa)}), {\mathcal M}_{i,j_{\mathsf {D}}}(\mathsf{V})\rangle}{\mathsf{t}_{i}},\\ g^{(\kappa)}_{i}(\mathsf{V},\mathsf{t}_{i}) &\triangleq \frac{a_{i}^{(\kappa)}}{\mathsf{t}_{i}} +2\varphi^{(\kappa)}_{i}(\mathsf{V}_{{\mathsf{U}} i},\mathsf{t}_{i})\\ &\quad-\frac{\langle \Psi_{i}^{-1}(\mathbf{V}^{(\kappa)})-{\mathcal M}_{i}^{-1}(\mathbf{V}^{(\kappa)}),{\mathcal M}_{i}(\mathsf{V}) \rangle}{\mathsf{t}_{i}}, \end{aligned} $$
(40)

which are concave. This can be justified by observing that the first terms of these two functions, \(a_{i,j_{\mathsf {D}}}^{(\kappa)}/\mathsf {t}_{i}\) and \(a_{i}^{(\kappa)}/\mathsf {t}_{i}\), are concave as \(a_{i,j_{\mathsf { D}}}^{(\kappa)}<0\) and \(a_{i}^{(\kappa)}<0\) by (29), while their second terms have been shown to be concave as above, and their third terms are concave according to [39].

We now address the nonconvex problem (15) by successively solving the following convex quadratic program (QP):
$${} \begin{aligned} \max_{\mathsf{V},\mathsf{t}}\ {\mathcal P}^{(\kappa)}&(\mathsf{V},\mathsf{t})\triangleq \min_{i\in{\mathcal I}} \left[\sum_{j_{\mathsf{D}}\in{\mathcal D}}g^{(\kappa)}_{i,j_{\mathsf{ D}}}(\mathsf{V},\mathsf{t}_{i}) +g^{(\kappa)}_{i}(\mathsf{V},\mathsf{t}_{i})\right]\\&\mathrm{s.t.}\quad {(15b), (15c), (23), (33)}. \end{aligned} $$
(41)

Note that (41) involves n=2(N 1·d 1·I·D+N r ·d 2·I·U)+I scalar real variables and m=I·D+3·I+I·U quadratic constraints so its computational complexity is \(\mathcal {O}(n^{2}m^{2.5}+m^{3.5})\).

Proposition 1

Let (V (κ),t (κ))be a feasible point to (24). The optimal solution (V (κ+1),t (κ+1)) of convex program (41) is feasible to the nonconvex program (24) and it is better than (V (κ),t (κ)), i.e.,
$$ {\mathcal P}(\mathbf{V}^{(\kappa+1)}, \mathbf{t}^{(\kappa)})\geq {\mathcal P}(\mathbf{V}^{(\kappa)}, \mathbf{t}^{(\kappa)}). $$
(42)
as long as (V (κ+1),t (κ+1))≠(V (κ),t (κ)). Consequently, once initialized from a feasible point (V (0),t (0)) to (24), the κ-th QP iteration (41) generates a sequence {V (κ)} of feasible and improved points toward the nonconvex program (24), which converges to an optimal solution of (15). Under the stopping criterion
$${} \left|\left({\mathcal P}(\mathbf{V}^{(\kappa+1)}, \mathbf{t}^{(\kappa+1)})- {\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})\right)/{\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})\right| \leq \epsilon $$
(43)

for a given tolerance ε>0, the QP iterations will terminate after finitely many iterations.

Proof

The proof of the above proposition is based on the theory of sequential optimization [40]. For completeness, it is provided in the Appendix section. □

The proposed path-following quadratic prgramming that solves problem (15) is summarized in Algorithm 1.

Before closing this section, it is pointed out that a feasible initial point (V (0),t (0)) to (24) can be founded by solving
$$ \max_{\mathsf{V}}\min_{(i,j_{\mathsf{ D}})\in{\mathcal S}_{1}}\ \left\{\frac{f_{i,j_{\mathsf{ D}}}(\mathsf{V})}{r_{i,j_{{\mathsf{D}}}}^{\min}},\frac{f_{i}(\mathsf{V})}{r_{i}^{{\mathsf{U}},\min}}\right\}\ :\ \protect{(15b), (15c)}, $$
(44)
with iterations
$$ \max_{\mathsf{V}}\min_{(i,j_{\mathsf{ D}})\in{\mathcal S}_{1}}\ \left\{\frac{\Theta^{(\kappa)}_{i,j_{\mathsf{ D}}}(\mathsf{V})}{r_{i,j_{{\mathsf{ D}}}}^{\min}},\frac{\Theta^{(\kappa)}_{i}(\mathsf{V})}{r_{i}^{{\mathsf{ U}},\min}}\right\}\ :\ {(15b), (15c)}, $$
(45)
which terminate as soon as
$${} f_{i,j_{\mathsf{ D}}}(\mathbf{V}^{(\kappa)})/r_{i,j_{\mathsf{ D}}}^{\min} \geq 1 \ \text{and} \ f_{i}(\mathbf{V}^{(\kappa)})/r_{i}^{{\mathsf{ U}},\min}\geq 1, \ \forall (i,j_{\mathsf{ D}})\in{\mathcal S}_{1}. $$
(46)

4 Numerical results

For the purpose of illustrating the performance advantage (in terms of the EE) of the proposed FD precoder design, the FD BSs can be reconfigured to operate in the HD mode with N=N 1+N 2 antennas at each BS. In particular, each BS operating in the HD mode serves all the DLUs in the downlink and all the ULUs in the uplink, albeit in two separate resource blocks (e.g., time or frequency). We then apply Algorithm 1 to solve the EE optimization problems (16) and (18). Suppose that V opt,DL and V opt,UL are their optimal solutions. Accordingly, we compare the optimal value of (15) with
$$ \min_{i\in {\mathcal I}}\frac{\left(\underset{j_{\mathsf{ D}}\in{\mathcal D}}{\sum}f_{i,j_{\mathsf{D}}}(\mathbf{V}^{\mathrm{opt,DL}})+f_{i}^{\text{UL}}(\mathbf{V}^{\mathrm{opt,UL}}) \right)/2} {\zeta\left(\underset{j_{\mathsf{D}}\in{\mathcal D}}{\sum}||\mathbf{V}^{\text{opt}}_{i,j_{\mathsf{ D}}}||^{2} +\underset{j_{\mathsf{U}}\in{\mathcal U}}{\sum}|| \mathbf{V}^{\text{opt}}_{i,\ell_{\mathsf{ U}}}||^{2}\right) +P^{\text{BS}}+ UP^{\text{UE}}}, $$
(47)

where the fraction 1/2 in the numerator accounts for the fact that two time slots are used in HD downlink and uplink communications and P BS=(N 1+N 2)P b .

The channel matrix between a BS and a user at a distance d is generated according to the path loss model for line-of-sight (LOS) communications as \(10^{-{PL}_{\text {LOS}}/20}\tilde {H}\), where P L LOS=103.8+20.9 log10d and each entry of \(\tilde {H}\) is an independent circularly symmetric Gaussian random variable with zero mean and unit variance [41]. The channel matrix from a ULU to a DLU at a distance d is assumed to follow the non-line-of-sight (NLOS) path loss model as \(10^{-{PL}_{\text {NLOS}}\slash 20}\tilde {H}\) with P L NLOS=145.4+37.5 log10d [41].

For the FD mode, the number N 1 of transmit antennas and the number N 2 of receive antennas at a BS are 4 and 2, respectively. The numbers of concurrent downlink and uplink data streams are assumed to be equal to the number of antennas at a DLU/ULU, i.e., d 1=d 2=N r . The precoding matrices \(\mathsf {V}_{i,j_{\mathsf {D}}}\) and \(\mathsf {V}_{i,j_{\mathsf {U}}}\) in (2) and (7) are of dimensions N 1×N r and N r ×N r , respectively. The rate constraints in (15d) and (15e) are set as \(r_{i,j_{\mathsf {D}}}^{\min }=2\) bps/Hz and \(r_{i}^{{\mathsf {U}},\min }=2\) bps/Hz, respectively. The circuit powers for each antenna in BS and UE are P b =1.667 W and P u =50 mW, respectively [37]. To arrive at the final figures, 100 simulation runs are carried out and the results are averaged. Table 1 lists other 3GPP LTE network parameters that are used in all simulations [41]. For simplicity, the drain efficiency of power amplifier ζ is assumed to be 100 % for both the downlink and uplink transmissions.
Table 1

Simulation parameters used in all numerical examples

Parameter

Value

Carrier frequency

2 GHz

System bandwidth

10 MHz

Maximum BS transmit power, \(P^{\max }_{\text {BS}}\)

20 W

Maximum user transmit power, \(P^{\max }_{\text {UE}}\)

150 mW

Noise power density

−174 dBm/Hz

Noise figure at a DLU receiver

9 dB

Noise figure at a BS receiver

5 dB

4.1 Effect of SI in a single-cell network with fixed users

The example network in Fig. 2 is used to study the energy efficiency performance of Algorithm 1. By considering a single-cell network with fixed-location users, one can focus on the effect of SI while isolating those of the intracell and intercell interferences. Figure 3 shows the energy efficiency results for two cases of N r =1 and N r = 2. It is clear that the EE under the FD mode degrades as \(\sigma ^{2}_{\text {SI}}\) increases. In particular, FD EE is more than double the HD EE when \(\sigma _{\text {SI}}^{2} \le -100\) dB. Figures 4 and 5 further illustrate the data rates of FD and HD modes for N r =2 and N r =1, respectively. It can be seen that, due to the adverse effect of SI, the data rates of DL and UL in the FD model degrade with increasing of \(\sigma ^{2}_{\text {SI}}\). For the case of N r =2, Fig. 4 shows that the data rates in the FD mode are higher than that of the HD mode when \(\sigma _{\text {SI}}^{2}~\le ~-120\) dB. Similarly, it is clear from Fig. 5 that the data rates in the FD mode with N r =1 are superior than that in the HD mode when \(\sigma _{\text {SI}}^{2} \le -110\) dB.
Fig. 2

A single-cell network with 2 DLUs and 2 ULUs

Fig. 3

Energy efficiency of the single-cell network for FD and HD modes

Fig. 4

Data rates of DL and UL for FD and HD modes with N r =2 in the single-cell network

Fig. 5

Data rates of DL and UL for FD and HD modes with N r =1 in the single-cell network

4.2 Effect of intracell interference in a single-cell network

The example network in Fig. 6 is examined to study the EE performance of Algorithm 1 when the intracell interference changes but \(\sigma _{\text {SI}}^{2}\) is fixed at \(\sigma _{\text {SI}}^{2}=-110\) dB. The location of the DLU is fixed at point B but the location of the ULU is varied. For each position of the ULU at a point A on a circle of radius 90 m, the EE quantity is found by Algorithm 1. By keeping the small-scale fading parameter unchanged, a small angle \(\widehat {\text {AOB}}\) in Fig. 6 results in a small path loss and accordingly a large intracell interference level.
Fig. 6

A single-cell network with one fixed DLU and one moving ULU. The DLU location is fixed at point B, whereas the ULU is located at any point A on the circle of radius of 90 m

It can be observed from Fig. 7 that the FD EE is always much higher than the HD EE if the intracell interference is sufficiently small. The largest gain in EE is achieved when the ULU-DLU distance is maximum (i.e., \(\widehat {\text {AOB}}=\pi \)), in which case, the intracell interference is smallest. In addition, Figs. 8 and 9 plot the data rates of FD and HD modes for N r =2 and N r =1, respectively. For the case of N r =2, the data rates of FD DL at \(\widehat {\text {AOB}}=0\) are smaller than that of the HD DL. This is expected since when the ULU is very close to DLU at \(\widehat {\text {AOB}}=0\), the intracell interference is strongest. When the ULU-DLU distance becomes larger, the data rates of FD are significantly higher than the data rates of HD. In the case of N r =1, the data rates of FD DL are only smaller than that of HD DL at \(\widehat {\text {AOB}}=0\), while the data rates of FD UL are higher than that of HD UL at every position of the ULU.
Fig. 7

Energy efficiency of the single-cell network under FD and HD modes

Fig. 8

Data rates of DL and UL for FD and HD modes with N r =2 in the single-cell network

Fig. 9

Data rates of DL and UL for FD and HD modes with N r =1 in the single-cell network

4.3 Multi-cell networks

In the last simulation scenario, we compare the FD EE and HD EE for a three-cell network as depicted by Fig. 10. The positions of the ULU and DLU in each cell are fixed at distances 2r/3=66.67 m and r/2=50 m from their serving BS, respectively. Figure 11 shows that the EE decreases with the increasing level of SI.
Fig. 10

A three-cell network with 1 DLU and 1 ULU. The cell radius is r=100 m

Fig. 11

Effect of SI on the energy efficiency in a three-cell network

The convergence behavior of Algorithm 1 is demonstrated in Fig. 12 for the network in Fig. 10, where the error tolerance for convergence is set as ε = 10−3. As can be seen, the proposed algorithm monotonically improves the objective value after every iteration. Table 2 shows that the convergence occurs within about 32 iterations. Note also that each iteration only involves one simple convex QP, which can be solved very efficiently by any available convex solvers such as CVX [42]. The data rates of the minimum cell energy efficiency for N r =2 and N r =1 are provided in Figs. 13 and 14, respectively. For the case of N r =2, the data rates of FD DL are slightly smaller than that of HD DL, but the gap between FD UL and HD UL data rates becomes larger as \(\sigma ^{2}_{\text {SI}}\) increases. In the case of N r =1, although the data rates of FD DL are higher than that of the HD DL, it decreases with increasing \(\sigma ^{2}_{\text {SI}}\). On the contrary, the data rates of FD UL are smaller than that of the HD UL.
Fig. 12

Convergence of Algorithm 1 for the FD energy efficiency with ε = 10−3

Fig. 13

Data rates of DL and UL for FD and HD modes with N r =2 in a three-cell network

Fig. 14

Data rates of DL and UL for FD and HD modes with N r =1 in a three-cell network

Table 2

The average number of iterations required by Algorithm 1

\(\sigma _{\text {SI}}^{2}\) (dB)

-150

-130

-110

-90

Average number of iterations

32.4

20.3

25.7

18.5

5 Conclusions

We have designed novel linear precoders for base stations and users in order to maximize the energy efficiency of a multicell network in which full-duplex BSs simultaneously transmit to and receive from their half-duplex users. The precoders are found by a low-complexity iterative algorithm that requires solving only one simple convex quadratic program at each iteration. It has also been proved that the proposed path-following algorithm is guaranteed to monotonically converge. Simulation results have been presented in various network scenarios to demonstrate the performance advantage of the proposed precoders in terms of energy efficiency.

6 Endnotes

1 Function ln|I+X| is concave in X0 so its first-order approximation at 0, which is Trace(X), is its upper bound [38].

2 Function x 2/t is convex on x>0 and t>0, so its first-order approximation at \((\bar {x},\bar {t})\), which is \(2\bar {x}\mathsf {x}/\bar {t}-\bar {x}\mathsf {t}/\bar {t}^{2}\), is its lower bound [38].

7 Appendix

7.1 Proof of Proposition 1

By (31) and (32), any (V,t) feasible to the convex program (41) is also feasible to the nonconvex program (24). As (V (κ),t (κ)) is feasible to (41), it follows that
$$ \begin{aligned} {\mathcal P}(\mathbf{V}^{(\kappa+1)},\mathbf{t}^{(\kappa+1)})&\geq {\mathcal P}^{(\kappa)}(\mathbf{V}^{(\kappa+1)},\mathbf{t}^{(\kappa+1)})\\ &> {\mathcal P}^{(\kappa)}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})= {\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)}) \end{aligned} $$
(48)

as far as (V (κ+1),t (κ+1))≠(V (κ),t (κ)), hence showing (42).

Since the sequence {(V (κ),t (κ))} is bounded by constraint (15c), by Cauchy’s theorem, there is a convergent subsequence \(\{(\mathbf {V}^{(\kappa _{\nu })},\mathbf {t}^{(\kappa _{\nu })})\}\), i.e.,
$${\lim}_{\nu\rightarrow +\infty}\left[{\mathcal P}(\mathbf{V}^{(\kappa_{{\nu}+1})},\mathbf{t}^{(\kappa_{\nu+1})})- {\mathcal P}(\mathbf{V}^{(\kappa_{\nu})},\mathbf{t}^{(\kappa_{\nu})})\right]=0. $$
(49)
For every κ, there is ν such that κ ν κ and κ+1≤κ ν+1. It follows from (42) that
$$ \begin{array}{lll} 0& \leq &\underset{\kappa\rightarrow+\infty}{\lim}\left[{\mathcal P}(\mathbf{V}^{(\kappa+1)},\mathbf{t}^{(\kappa+1)})-{\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})\right]\\ &\leq&\underset{\nu\rightarrow+\infty}{\lim}\left[{\mathcal P}(\mathbf{V}^{(\kappa_{{\nu}+1})},\mathbf{t}^{(\kappa+1)})-{\mathcal P}(\mathbf{V}^{(\kappa_{\nu})},\mathbf{t}^{(\kappa_{\nu})})\right]\\ &=&0, \end{array} $$
(50)
showing
$$ {\lim}_{\kappa\rightarrow+\infty}\left[{\mathcal P}(\mathbf{V}^{(\kappa+1)},\mathbf{t}^{(\kappa+1)})-{\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})\right]=0. $$
(51)
For a given tolerance ε > 0, the iterations will therefore terminate after finitely many iterations under the stopping criterion
$$\begin{array}{*{20}l}{} \left|\left({\mathcal P}_{1}(\mathbf{V}^{(\kappa+1)},\mathbf{t}^{(\kappa+1)})- {\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})\right)/{\mathcal P}(\mathbf{V}^{(\kappa)},\mathbf{t}^{(\kappa)})\right| \leq \epsilon. \end{array} $$
(52)

Each accumulation point \((\bar {\mathbf {V}},\bar {\mathbf {t}})\) of the sequence {(V (κ),t (κ))} satisfies the minimum principle necessary condition for optimality [40].

Declarations

Acknowledgements

The work is supported by NSF of China (61271213, 61673253) and the Ph.D. Programs Foundation of Ministry of Education of China (20133108110014).

Competing interests

The authors declare that they have no competing interests.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors’ Affiliations

(1)
School of Communication and Information Engineering, Shanghai University
(2)
Faculty of Engineering and Information Technology, University of Technology Sydney
(3)
Department of Electrical and Computer Engineering, University of Saskatchewan

References

  1. A Fehske, G Fettweis, J Malmodin, G Biczok, The global footprint of mobile communications: the ecological and economic perspective. IEEE Commun. Mag.49(8), 55–62 (2011).View ArticleGoogle Scholar
  2. G Auer, et al., How much energy is needed to run a wireless network?. IEEE Wireless Cmmun. Mag.18:, 5 (2011).View ArticleGoogle Scholar
  3. Y Chen, S Zhang, S Xu, G Li, Fundamental trade-offs on green wireless networks. IEEE Commun. Mag.49(6), 30–37 (2011).View ArticleGoogle Scholar
  4. Z Hasan, H Boostainimehr, VK Bhargava, Green cellular networks: a survey, some research issues and challenges. IEEE Commun. Surv. Tutorials. 13(4), 524–540 (2011).View ArticleGoogle Scholar
  5. YS Soh, TQS Quek, M Kountouris, H Shin, Energy efficient heterogeneous cellular networks. IEEE J. Sel. Areas Commun.31(5) (2013).Google Scholar
  6. Z Xu, C Yang, GY Li, Y Liu, S Xu, Energy-efficient CoMP precoding in heterogeneous networks. IEEE Trans. Signal Process.62(4), 1005–1017 (2014).MathSciNetView ArticleGoogle Scholar
  7. E Bjornson, L Sanguinetti, J Hoydis, M Debbah, Optimal design of enerygy-efficient multi-user MIMO systems: is massive MIMO the answer. IEEE Trans. Wireless Commun.14(6), 3059–3075 (2015).View ArticleGoogle Scholar
  8. Y Xin, D Wang, J Li, H Zhu, J Wang, X You, Area spectral efficiency and area energy efficiency of massive MIMO cellular systems. IEEE Trans. Vehic. Technol. 65(5), 3243–3254 (2016).View ArticleGoogle Scholar
  9. RLG Cavalcante, S Stanczak, M Schubert, A Eisenlatter, U Turke, Toward energy-efficienct 5G wireless communications technologies. IEEE Sig. Process. Mag. 13(11), 24–34 (2014).View ArticleGoogle Scholar
  10. I C-L, C Rowell, S Han, Z Xu, G Li, Z Pan, Toward green and soft: a 5G perspective. IEEE Commun. Mag. 13(2), 66–73 (2014).Google Scholar
  11. S Buzzi, I C-L, TE Klein, HV Poor, C Yang, A Zappone, A survey of energy-efficient techniques for 5G networks and challenges ahead. IEEE J. Sel. Areas Commun.34(4), 697–709 (2016).View ArticleGoogle Scholar
  12. CTK Ng, H Huang, Linear precoding in cooperative MIMO cellular networks with limited coordination clusters. IEEE J. Sel. Areas Commun.28(9), 1446–1454 (2010).View ArticleGoogle Scholar
  13. SS Christensen, R Agarwal, E Carvalho, JM Cioffi, Weighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design. IEEE Trans. Wirel. Commun.7(12), 4792–4799 (2008).View ArticleGoogle Scholar
  14. K Wang, X Wang, W Xu, X Zhang, Coordinated linear precoding in downlink multicell MIMO-OFDMA networks. IEEE Trans. Sig. Process.60(8), 4264–4277 (2012).MathSciNetView ArticleGoogle Scholar
  15. B Song, RL Cruz, BD Rao, Network duality for multiuser MIMO beamforming networks and applications. IEEE Trans. Commun.55(3), 618–630 (2007).View ArticleGoogle Scholar
  16. DWH Cai, TQS Quek, CW Tan, SH Low, Max-min SINR coordinated multipoint downlink transmission - Duality and algorithms. IEEE Trans. Sig. Process.60(10), 5384–5395 (2012).MathSciNetView ArticleGoogle Scholar
  17. Y Huang, CW Tan, BD Rao, Joint beamforming and power control in coordinated multicell: max-min duality, effective network and large system transition. IEEE Trans. Wirel. Commun.12(6), 2730–2742 (2013).View ArticleGoogle Scholar
  18. Y-S Choi, H Shirani-Mehr, Simultaneous transmission and reception: algorithm, design and system level performance. IEEE Trans. Wirel. Commun.12(12), 5992–6010 (2013).View ArticleGoogle Scholar
  19. A Sabharwal, et al., In-band full-duplex wireless: challenges and opportunities. IEEE J. Sel. Areas Commun.32(9), 1637–1652 (2014).View ArticleGoogle Scholar
  20. M Heino, et al., Recent advances in antenna design and interference cancellation algorithms for in-band full duplex relays. IEEE Commun. Mag.5:, 91–101 (2015).View ArticleGoogle Scholar
  21. E Everett, A Sahai, A Sabharwal, Passive self-interference suppression for full-duplex infrastructure nodes. IEEE Trans. Wirel. Commun.13(2), 680–694 (2014).View ArticleGoogle Scholar
  22. M Duarte, A Sabharwal, V Aggarwal, R Jana, KK Ramakrishnan, CW Rice, NK Shankaranarayanan, Design and characterization of a full-duplex multiantenna system for WiFi networks. IEEE Trans. Veh. Technol.63(3), 1160–1177 (2014).View ArticleGoogle Scholar
  23. L Anttila, et al., in Modeling and efficient cancelation of nonlinear self-interference in MIMO full-duplex transceivers. Proc. of Globecom (IEEEAustin, 2014), pp. 777–783.Google Scholar
  24. HHM Tam, HD Tuan, DT Ngo, Successive convex quadratic programming for quality-of-service management in full-duplex MU-MIMO multicell networks. IEEE Trans. Comm.64: (2016).Google Scholar
  25. W Dinkelbach, On nonlinear fractional programming. Manag. Sci.13(7), 492–498 (1967).MathSciNetView ArticleMATHGoogle Scholar
  26. DWK Ng, ES Lo, R Schober, Energy-efficient resource allocation in multi-cell OFDMA systems with limited feedback capacity. IEEE Trans. Wirel. Commun.11(10), 3618–3631 (2012).View ArticleGoogle Scholar
  27. A Zappone, E Jorswieck, Energy efficiency in wireless networks via fractional programming theory. Found Trends Comm Inf Theory. 11(3-4), 185–396 (2015).View ArticleMATHGoogle Scholar
  28. A Zappone, L Sanguinetti, G Bacci, E Jorswieck, M Debbah, Energy-efficient power control: a look at 5G wireless technologies. IEEE Trans. Sig. Process.64(4), 1668–1683 (2016).MathSciNetView ArticleGoogle Scholar
  29. O Tervo, LN Tran, M Juntti, Optimal energy-efficient transmit beamforming for multi-user MISO downlink. IEEE Trans. Sig. Process.63(10), 5574–5588 (2015).MathSciNetView ArticleGoogle Scholar
  30. QD Vu, LN Tran, R Farrell, EK Hong, Energy-efficient zero-forcing precoding design for small-cell networks. IEEE Trans. Commun.64(2), 790–804 (2016).View ArticleGoogle Scholar
  31. H Weingarten, Y Steinberg, S Shamai, The capacity region of the Gaussian multiple-input multiple-output broadcast channel. IEEE Trans. Inf. Theory. 52(9), 3936–3964 (2006).MathSciNetView ArticleMATHGoogle Scholar
  32. L-N Tran, M Juntti, M Bengtsson, B Ottersten, Weighted sum rate maximization for MIMO broadcast channels using dirty paper coding and zero-forcing methods. IEEE Trans. Commun.61(6), 2362–2372 (2013).View ArticleGoogle Scholar
  33. W Yu, JM Cioffi, Sum capacity of Gaussian vector broadcast channels. IEEE Trans. Inf. Theory. 50(9), 1875–1892 (2004).MathSciNetView ArticleMATHGoogle Scholar
  34. M Duarte, C Dick, A Sabharwal, Experiment-driven characterization of full-duplex wireless systems. IEEE Trans. Wirel. Commun.11(12), 4296–4307 (2012).View ArticleGoogle Scholar
  35. D Korpi, et al., Full-duplex transceiver system calculations: analysis of adc and linearity challenges. IEEE Trans. Wirel. Commun.13(7), 3821–3836 (2014).View ArticleGoogle Scholar
  36. D Tse, P Viswanath, Fundamentals of wireless communication (Cambridge University Press, New York, 2005).View ArticleMATHGoogle Scholar
  37. C Xiong, GY Li, S Zhang, Y Chen, S Xu, Energy-efficient resource allocation in OFDMA networks. IEEE Trans. Commun.60(12), 3767–3778 (2012).View ArticleGoogle Scholar
  38. H Tuy, Convex analysis and global optimization (second Edition) (Springer, Verlag Berlin Heidelberg, 2016).View ArticleMATHGoogle Scholar
  39. B Dacorogna, P Marechal, The role of perspective functions in convexity, polyconvexity, rank-one convexity and separate convexity. J. Convex Anal.15(2), 271–284 (2008).MathSciNetMATHGoogle Scholar
  40. BR Marks, GP Wright, A general inner approximation algorithm for nonconvex mathematical programms. Oper. Res.26(4), 681–683 (1978).MathSciNetView ArticleMATHGoogle Scholar
  41. 3GPP TS 36.814 V9.0.0, 3GPP technical specification group radio access network, evolved universal terrestrial radio access (E-UTRA): Further advancements for E-UTRA physical layer aspects (Release 9) (2010).Google Scholar
  42. M Grant, S Boyd, CVX: Matlab software for disciplined convex programming, version 2.1 (2014). http://cvxr.com/cvx. Accessed 1 May 2016.

Copyright

© The Author(s) 2017