This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\newcaptionstyle

mystyle2\captionlabel.\captiontext \captionstylemystyle2

Robust Design for IRS-Aided Communication Systems with User Location Uncertainty

Xiaoling Hu, Caijun Zhong, Mohamed-Slim Alouini, and Zhaoyang Zhang X. Hu, C. Zhong and Z. Zhang are with the College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China.(email: [email protected]).M.-S. Alouini is with the Department of Computer, Electrical and Mathematical Science and Engineering, King Abdullah University of Science and Technology, Thuwal 23955, Saudi Arabia.
Abstract

In this paper, we propose a robust design framework for IRS-aided communication systems in the presence of user location uncertainty. By jointly designing the transmit beamforming vector at the BS and phase shifts at the IRS, we aim to minimize the transmit power subject to the worse-case quality of service (QoS) constraint, i.e., ensuring the user rate is above a threshold for all possible user location error realizations. With unit-modulus, this problem is not convex. The location uncertainty in the QoS constraint further increases the difficulty of solving this problem. By utilizing techniques of Taylor expansion, S-Procedure and semidefinite relaxation (SDP), we transform this problem into a sequence of semidefinite programming (SDP) sub-problems. Simulation results show that the proposed robust algorithm substantially outperforms the non-robust algorithm proposed in the literature, in terms of probability of reaching the required QoS target.

Index Terms:
IRS, robust beamforming, SDP.

Robust design for an IRS-aided system under user location uncertainty

I Introduction

Intelligent reflecting surface (IRS) has recently emerged as a promising method to tackle the coverage problem of dead-zone users [1, 2]. The IRS is a meta-surface consisting of a large number of low-cost, passive reflecting elements, each of which can independently reflect the incident signal with adjustable phase shifts. Through proper design of the phase shifts at the IRS [3, 4], the signal received at the user can be significantly enhanced.

To facilitate the design of phase shifts, channel state information (CSI) is compulsory. As such, plenty of works have been devoted to the estimation of IRS-aided channels, including the channel between the BS and IRS, as well as the reflection channel between the IRS and user. In general, the proposed methods can be categorized into two types. The first type is to estimate the cascaded channels[5, 6]. However, with a large number of reflecting elements, the training overhead would become prohibitive. The second type is to directly estimate two channels separately [7], assuming that the IRS has both reflection mode and receive mode. However, this requires a large number of receive radio frequency (RF) chains (equal to the number of reflecting elements), which would significantly increase the hardware cost as well as the power consumption of the IRS.

To tackle the above issues, one possible way is to only estimate the angles of arrivals (AOAs) and angles of departures (DOAs)[8, 9, 10]. Because the locations of the IRS and BS remain fixed, the channel between the BS and IRS varies very slowly and can be accurately estimated by computing the AOAs and AODs [11]. Then, exploiting the user location information provided, for example, by global positioning system (GPS), the angular information of the reflection channel from the IRS to the user can be obtained. However, due to user mobility and the precision of GPS, the user location information may not be accurate, resulting in imperfect angular information.

Motivated by this, this letter proposes a robust design framework in the presence of user location uncertainty.111 Unlike [11] and [12], which adopt conventional error model, the current work first proposes a location-based channel estimation scheme, and then presents a practical channel error model related to location uncertainty. In addition, the method to tackle the optimization problem is also different from [11] and [12]. Specifically, considering a bounded spherical error model, the transmit beamforming vector and phase shifts are jointly designed to minimize the transmit power, subject to the minimum achievable rate constraint for all possible user location errors. To tackle the non-convex worse-case rate constraint, the second-order Taylor expansion is used to approximate the achievable rate, and the S-Procedure is used to convert the resultant semi-definite constraint into a matrix inequality. Then, applying the semi-definite relaxation (SDR) method, an alternating algorithm is designed, which optimizes the transmit beamforming vector and phase shifts iteratively by solving a sequence of semi-definite programming (SDP) sub-problems. Simulation results show that the proposed robust algorithm can guarantee the target rate regardless of the user location errors, which substantially outperforms the non-robust algorithm proposed in [3].

II System Model

We consider an IRS-aided system as illustrated in Fig.1, where one BS with NN antennas communicates with a single-antenna user, which is assisted by an IRS with MM reflecting elements. Like most works on IRS, e.g.,[3, 5], we assume that the IRS operates in the far-field regime. Furthermore, we assume that direct link between the BS and the user does not exist, due to blockage or unfavorable propagation environments. Both the BS and the IRS are equipped with uniform rectangular arrays (URAs) with the size of Ny×NzN_{y}\times N_{z} and My×MzM_{y}\times M_{z} respectively, where NyN_{y} (NzN_{z}) and MyM_{y} (MzM_{z}) denote the numbers of BS antennas and reflecting elements along the yy (zz) axis, respectively.

Refer to caption
Figure 1: Model of the IRS-aided communication system.

II-A Downlink Transmission

During the downlink data transmission phase, the BS transmits the signal 𝐱=𝐰s{\bf x}={\bf w}s, where 𝐰{\bf w} is the beamforming vector and ss is the symbol for the user, satisfying 𝔼{|s|2}=1\mathbb{E}\left\{|s|^{2}\right\}=1.

Then, the signal received at the user is given by

y=𝐠I2UT𝚯𝐆B2I𝐰s+n,\displaystyle y={\bf g}_{\text{I2U}}^{T}{\mbox{\boldmath$\Theta$}}{\bf G}_{\text{B2I}}{\bf w}s+n, (1)

where 𝐠I2UM×1{\bf g}_{\text{I2U}}\in\mathbb{C}^{M\times 1} denotes the channel from the IRS to the user, 𝐆B2IM×N{\bf G}_{\text{B2I}}\in\mathbb{C}^{M\times N} is the channel between the BS and the IRS, and nn is the additive white Gaussian noise (AWGN) which follows the circularly symmetric complex Gaussian distribution with zero mean and variance σ02\sigma_{0}^{2}. The phase shift matrix of the IRS is given by 𝚯=diag(𝝃)M×M{\mbox{\boldmath$\Theta$}}={\text{diag}}\left({\mbox{\boldmath$\xi$}}\right)\in\mathbb{C}^{M\times M} with the phase shift beam 𝝃=[ejϑ1,,ejϑn,,ejϑM]TM×1{\mbox{\boldmath$\xi$}}={[e^{j\vartheta_{1}},...,e^{j\vartheta_{n}},...,e^{j\vartheta_{M}}]}^{T}\in\mathbb{C}^{M\times 1}.

II-B Channel Model

We consider a narrowband millimeter-wave (mmWave) system, and adopt the narrowband geometric channel model. As such, the channel from the IRS to the BS can be expressed as

𝐆B2I=l=1Dβl𝐛(ϑz-B2Ia,l,ϑy-B2Ia,l)𝐚T(ϑz-B2I,l,ϑy-B2I,l),\displaystyle{\bf G}_{\text{B2I}}\!=\!\sum\limits_{l=1}^{D}\beta_{l}{\bf b}(\vartheta_{\text{z-B2Ia},l},\vartheta_{\text{y-B2Ia},l}){\bf a}^{T}(\vartheta_{\text{z-B2I},l},\vartheta_{\text{y-B2I},l}), (2)

where DD is the number of paths, βl\beta_{l} is the channel coefficient of the ll-th path, 𝐚{\bf a} and 𝐛{\bf b} are the array response vectors of the BS and IRS respectively. The effective angles of departure (AODs) of the ll-th path, i.e., the phase differences between two adjacent antennas along zz and yy axes, are given by ϑz-B2I,l=2πdBSλsinθB2I,l\vartheta_{\text{z-B2I},l}=-\frac{2\pi d_{\text{BS}}}{\lambda}\sin\theta_{\text{B2I},l} and ϑy-B2I,l=2πdBSλcosθB2I,lsinϕB2I,l\vartheta_{\text{y-B2I},l}=-\frac{2\pi d_{\text{BS}}}{\lambda}\cos\theta_{\text{B2I},l}\sin\phi_{\text{B2I},l}, respectively, where dBSd_{\text{BS}} is the distance between two adjacent BS antennas, λ\lambda is the carrier wavelength, θB2I,l\theta_{\text{B2I},l} and ϕB2I,l\phi_{\text{B2I},l} are the elevation and azimuth AODs, respectively. Similarly, the two effective angles of arrival (AOAs) can be written as ϑz-B2Ia,l=2πdIRSλcosθB2Ia,lcosϕB2Ia,l\vartheta_{\text{z-B2Ia},l}=\frac{2\pi d_{\text{IRS}}}{\lambda}\cos\theta_{\text{B2Ia},l}\cos\phi_{\text{B2Ia},l} and ϑy-B2Ia=2πdIRSλcosθB2Ia,lsinϕB2Ia,l\vartheta_{\text{y-B2Ia}}=\frac{2\pi d_{\text{IRS}}}{\lambda}\cos\theta_{\text{B2Ia},l}\sin\phi_{\text{B2Ia},l}, respectively, where dIRSd_{\text{IRS}} is the distance between two adjacent reflecting elements, θB2Ia,l\theta_{\text{B2Ia},l} and ϕB2Ia,l\phi_{\text{B2Ia},l} are the elevation and azimuth AOAs, respectively. We further assume that dBS=dIRS=λ2d_{\text{BS}}=d_{\text{IRS}}=\frac{\lambda}{2}.

The ss-th element of 𝐚(ϑz,ϑy)N×1{\bf a}\left(\vartheta_{\text{z}},\vartheta_{\text{y}}\right)\in\mathbb{C}^{N\times 1} and the ii-th element of 𝐛(ϑz,ϑy)M×1{\bf b}\left(\vartheta_{\text{z}},\vartheta_{\text{y}}\right)\in\mathbb{C}^{M\times 1} are respectively given by

[𝐚(ϑz,ϑy)]s=ejπ{(sm1)ϑz+(sn1)ϑy},\displaystyle\left[{\bf a}\left(\vartheta_{\text{z}},\vartheta_{\text{y}}\right)\right]_{s}=e^{j\pi\left\{(s_{m}-1)\vartheta_{\text{z}}+(s_{n}-1)\vartheta_{\text{y}}\right\}}, (3)
[𝐛(ϑz,ϑy)]i=ejπ{(im1)ϑz+(in1)ϑy},\displaystyle\left[{\bf b}\left(\vartheta_{\text{z}},\vartheta_{\text{y}}\right)\right]_{i}=e^{j\pi\left\{(i_{m}-1)\vartheta_{\text{z}}+(i_{n}-1)\vartheta_{\text{y}}\right\}}, (4)
sm=s(s/Nz1)Nz,sn=s/Nz,\displaystyle s_{m}=s-(\lceil{s}/{N_{z}}\rceil-1)N_{z},\ s_{n}=\lceil{s}/{N_{z}}\rceil, (5)
im=i(i/Mz1)Mz,in=i/Mz,\displaystyle i_{m}=i-(\lceil{i}/{M_{z}}\rceil-1)M_{z},\ i_{n}=\lceil{i}/{M_{z}}\rceil, (6)

where j=1j=\sqrt{-1}, and we use [𝐳]i[{\bf z}]_{i} to denote the ii-th entry of a vector 𝐳{\bf z}.

Since the IRS is usually deployed near the user, a LOS channel model is assumed to model the reflection channel between the IRS and the user. Specifically, the channel from the IRS to the user is given by

𝐠I2UT=αI2U𝐛T(ϑz-I2U,ϑy-I2U),\displaystyle{\bf g}_{\text{I2U}}^{T}=\alpha_{\text{I2U}}{\bf b}^{T}\left(\vartheta_{\text{z-I2U}},\vartheta_{\text{y-I2U}}\right), (7)

where αI2U\alpha_{\text{I2U}} is the channel coefficient, the two effective AODs from the IRS to the user ϑz-I2U\vartheta_{\text{z-I2U}} and ϑy-I2U\vartheta_{\text{y-I2U}} are respectively defined as [15]

ϑz-I2U=2dIRSλsinθI2U=sinθI2U,\displaystyle\vartheta_{\text{z-I2U}}\!=\!-\frac{2d_{\text{IRS}}}{\lambda}\sin\theta_{\text{I2U}}\!=\!-\sin\theta_{\text{I2U}}, (8)
ϑy-I2U=2dIRSλcosθI2UsinϕI2U=cosθI2UsinϕI2U,\displaystyle\vartheta_{\text{y-I2U}}\!=\!-\frac{2d_{\text{IRS}}}{\lambda}\cos\theta_{\text{I2U}}\sin\phi_{\text{I2U}}\!=-\!\cos\theta_{\text{I2U}}\sin\phi_{\text{I2U}}, (9)

where θI2U\theta_{\text{I2U}} and ϕI2U\phi_{\text{I2U}} are respectively the elevation and azimuth AODs, as shown in Fig. 1.

II-C Performance Measure

Assuming Gaussian signaling, the achievable rate of the system can be expressed as

R=log2(1+|𝐠I2UT𝚯𝐆B2I𝐰|2/σ02).\displaystyle R=\log_{2}\left(1+{{\left|{\bf g}_{\text{I2U}}^{T}{\mbox{\boldmath$\Theta$}}{\bf G}_{\text{B2I}}{\bf w}\right|}^{2}}/{\sigma_{0}^{2}}\right). (10)

III Location-Based Channel Estimation

In the IRS-aided communication system, due to the fixed location of the IRS, the channel from the BS to the IRS, i.e., 𝐆B2I{\bf G}_{\text{B2I}}, usually remains constant over a long period, and thus can be accurately estimated. Therefore, we assume that 𝐆B2I{\bf G}_{\text{B2I}} is perfectly known. In contrast, due to user mobility, the reflection channel 𝐠I2U{\bf g}_{\text{I2U}} varies over the time, hence should be estimated. As such, we propose to exploit user location information to estimate the reflection channel 𝐠I2U{\bf g}_{\text{I2U}}.

The elevation and azimuth AODs (θI2U\theta_{\text{I2U}} and ϕI2U\phi_{\text{I2U}}) have the following relationship with the locations of the IRS and user:

yUyI=dI2UcosθI2UsinϕI2U,zUzI=dI2UsinθI2U,\displaystyle y_{\text{U}}\!-\!y_{\text{I}}\!=\!d_{\text{I2U}}\cos\theta_{\text{I2U}}\sin\phi_{\text{I2U}},\ z_{\text{U}}\!-\!z_{\text{I}}=d_{\text{I2U}}\sin\theta_{\text{I2U}}, (11)

where dI2Ud_{\text{I2U}} is the distance between the IRS and the user, (xI,yI,zI)(x_{\text{I}},y_{\text{I}},z_{\text{I}}) and (xU,yU,zU)(x_{\text{U}},y_{\text{U}},z_{\text{U}}) are locations of the IRS and the user respectively. Substituting (11) into (8) and (9), we obtain the relationship between the effective AODs (ϑz-I2U\vartheta_{\text{z-I2U}} and ϑy-I2U\vartheta_{\text{y-I2U}}) and locations of the IRS and the user:

ϑy-I2U=(yIyU)/dI2U,ϑz-I2U=(zIzU)/dI2U.\displaystyle\vartheta_{\text{y-I2U}}=\left(y_{\text{I}}-y_{\text{U}}\right)/{d_{\text{I2U}}},\ \ \vartheta_{\text{z-I2U}}=\left(z_{\text{I}}-z_{\text{U}}\right)/{d_{\text{I2U}}}. (12)

In general, user location information obtained from the GPS is imperfect. Let (x^U,y^U,z^U)(\hat{x}_{\text{U}},\hat{y}_{\text{U}},\hat{z}_{\text{U}}) denote the estimated location of the user and 𝚫[ΔxU,ΔyU,ΔzU]T{\bf\Delta}\triangleq[\Delta x_{\text{U}},\Delta y_{\text{U}},\Delta z_{\text{U}}]^{T} denote the estimation error. The estimated effective AODs from the IRS to the user are given by

ϑ^y-I2U\displaystyle\hat{\vartheta}_{\text{y-I2U}} =(yIy^U)/d^I2U,ϑ^z-I2U=(zIz^U)/d^I2U.\displaystyle=(y_{\text{I}}-\hat{y}_{\text{U}})/{\hat{d}_{\text{I2U}}},\ \hat{\vartheta}_{\text{z-I2U}}=(z_{\text{I}}-\hat{z}_{\text{U}})/{\hat{d}_{\text{I2U}}}. (13)
Proposition 1.

The effective AODs from the IRS to the user can be approximately decomposed as

ϑz-I2U=ϑ^z-I2U+ϵz-I2U,ϑy-I2U=ϑ^y-I2U+ϵy-I2U,\displaystyle\vartheta_{\text{z-I2U}}=\hat{\vartheta}_{\text{z-I2U}}+\epsilon_{\text{z-I2U}},\ \vartheta_{\text{y-I2U}}=\hat{\vartheta}_{\text{y-I2U}}+\epsilon_{\text{y-I2U}}, (14)

where

ϵz-I2U=(ϑ^z-I2U21)ΔzU+ϑ^z-I2Uϑ^y-I2UΔyU+ϑ^z-I2Uϑ^x-I2UΔxUd^I2U,\displaystyle\epsilon_{\text{z-I2U}}\!=\!\frac{\left(\hat{\vartheta}^{2}_{\text{z-I2U}}-1\right)\Delta z_{\text{U}}\!+\!\hat{\vartheta}_{\text{z-I2U}}\hat{\vartheta}_{\text{y-I2U}}\Delta y_{\text{U}}\!+\!\hat{\vartheta}_{\text{z-I2U}}\hat{\vartheta}_{\text{x-I2U}}\Delta x_{\text{U}}}{\hat{d}_{\text{I2U}}},
ϵy-I2U=(ϑ^y-I2U21)ΔyU+ϑ^y-I2Uϑ^z-I2UΔzU+ϑ^y-I2Uϑ^x-I2UΔxUd^I2U,\displaystyle\epsilon_{\text{y-I2U}}\!=\!\frac{\left(\hat{\vartheta}^{2}_{\text{y-I2U}}\!-\!1\right)\Delta y_{\text{U}}\!+\!\hat{\vartheta}_{\text{y-I2U}}\hat{\vartheta}_{\text{z-I2U}}\Delta z_{\text{U}}\!+\!\hat{\vartheta}_{\text{y-I2U}}\hat{\vartheta}_{\text{x-I2U}}\Delta x_{\text{U}}}{\hat{d}_{\text{I2U}}},

where (xU,yU,zU)(x_{\text{U}},y_{\text{U}},z_{\text{U}}) denotes the accurate location of the user, ϑ^x-I2UxIx^Ud^I2U\hat{\vartheta}_{\text{x-I2U}}\triangleq\frac{x_{\text{I}}-\hat{x}_{\text{U}}}{\hat{d}_{\text{I2U}}}, ΔxU=xUx^U\Delta x_{\text{U}}=x_{\text{U}}-\hat{x}_{\text{U}}, ΔyU=yUy^U\Delta y_{\text{U}}=y_{\text{U}}-\hat{y}_{\text{U}} and ΔzU=zUz^U\Delta z_{\text{U}}=z_{\text{U}}-\hat{z}_{\text{U}} are location errors along xx, yy and zz axes, respectively.

Proof.

Starting from (13), we can obtain the desired result. ∎

Invoking the results given by Proposition 1, the reflection channel can be expressed as

𝐠I2U=𝐠^I2U𝐞I2U,\displaystyle{\bf g}_{\text{I2U}}=\hat{\bf g}_{\text{I2U}}\odot{\bf e}_{\text{I2U}}, (15)

where \odot stands for Hadamard product, 𝐠^I2U=αI2U𝐛(ϑ^z-I2U,ϑ^y-I2U)\hat{\bf g}_{\text{I2U}}=\alpha_{\text{I2U}}{\bf b}(\hat{\vartheta}_{\text{z-I2U}},\hat{\vartheta}_{\text{y-I2U}}) is the estimated channel, and 𝐞I2U{\bf e}_{\text{I2U}} is the estimation error with [𝐞I2U]i=ejπ𝐟iT𝚫\left[{\bf e}_{\text{I2U}}\right]_{i}=e^{j\pi{\bf f}_{i}^{T}{\mbox{\boldmath$\Delta$}}}, where 𝐟i=[aimin,bimin,cimin]T{\bf f}_{i}=[a_{i_{m}i_{n}},b_{i_{m}i_{n}},c_{i_{m}i_{n}}]^{T} with

aimin(im1)ϑ^z-I2Uϑ^x-I2Ud^I2U+(in1)ϑ^y-I2Uϑ^x-I2Ud^I2U,\displaystyle a_{i_{m}i_{n}}\triangleq(i_{m}-1)\frac{\hat{\vartheta}_{\text{z-I2U}}\hat{\vartheta}_{\text{x-I2U}}}{\hat{d}_{\text{I2U}}}+(i_{n}-1)\frac{\hat{\vartheta}_{\text{y-I2U}}\hat{\vartheta}_{\text{x-I2U}}}{\hat{d}_{\text{I2U}}}, (16)
bimin(im1)ϑ^z-I2Uϑ^y-I2Ud^I2U+(in1)ϑ^y-I2U21d^I2U,\displaystyle b_{i_{m}i_{n}}\triangleq(i_{m}-1)\frac{\hat{\vartheta}_{\text{z-I2U}}\hat{\vartheta}_{\text{y-I2U}}}{\hat{d}_{\text{I2U}}}+(i_{n}-1)\frac{\hat{\vartheta}^{2}_{\text{y-I2U}}-1}{\hat{d}_{\text{I2U}}}, (17)
cimin(im1)ϑ^z-I2U21d^I2U+(in1)ϑ^y-I2Uϑ^z-I2Ud^I2U,\displaystyle c_{i_{m}i_{n}}\triangleq(i_{m}-1)\frac{\hat{\vartheta}^{2}_{\text{z-I2U}}-1}{\hat{d}_{\text{I2U}}}+(i_{n}-1)\frac{\hat{\vartheta}_{\text{y-I2U}}\hat{\vartheta}_{\text{z-I2U}}}{\hat{d}_{\text{I2U}}}, (18)
im=i(iMz1)Mz,in=iMz.\displaystyle i_{m}=i-(\lceil\frac{i}{M_{z}}\rceil-1)M_{z},\ i_{n}=\lceil\frac{i}{M_{z}}\rceil. (19)

IV Robust Beamforming Design

Assuming that the location error is bounded by a sphere with the radius Υ\Upsilon, i.e.,𝚫2Υ2\|{\bf\Delta}\|^{2}\leq\Upsilon^{2}, we aim to minimize the total transmit power through joint design of beamforming vector 𝐰{\bf w} and phase shift vector 𝝃\xi under the worst-case QoS constraint, namely, the achievable rate should be above a threshold rr. Mathematically, the worst-case robust design problem can be formulated as

min{𝐰,𝝃}𝐰2\displaystyle\min\limits_{\left\{{\bf w},\ {\mbox{\boldmath$\xi$}}\right\}}\left\|{\bf{w}}\right\|^{2} (20)
s.t.Rr,𝚫2Υ2,|ξi|=1,i=1,,M.\displaystyle\operatorname{s.t.}R\geq r,\forall\|{\bf\Delta}\|^{2}\leq\Upsilon^{2},\ |\xi_{i}|=1,i=1,\ldots,M.

Substituting (10) and (15) into (20), we have

min{𝐰,𝝃}𝐰2\displaystyle\min\limits_{\left\{{\bf w},\ {\mbox{\boldmath$\xi$}}\right\}}\left\|{\bf{w}}\right\|^{2} (21)
s.t.|(𝐠^I2U𝐞I2U)T𝚯𝐆B2I𝐰|2(2r1)σ02,𝚫2Υ2,|ξi|=1,i=1,,M.\displaystyle\operatorname{s.t.}\begin{array}[t]{lll}{|(\hat{\bf g}_{\text{I2U}}\odot{\bf e}_{\text{I2U}})^{T}{\mbox{\boldmath$\Theta$}}{\bf G}_{\text{B2I}}{\bf w}|}^{2}\!\geq\!(2^{r}-1)\sigma_{0}^{2},\forall\|{\bf\Delta}\|^{2}\!\leq\!\Upsilon^{2},\\ |\xi_{i}|=1,i=1,\ldots,M.\end{array} (24)

IV-A Problem Transformation

Denote 𝐝diag(𝐠^I2U)𝚯𝐆B2I𝐰{\bf d}\triangleq\text{diag}(\hat{\bf g}_{\text{I2U}}){\mbox{\boldmath$\Theta$}}{\bf G}_{\text{B2I}}{\bf w} and 𝚫¯𝚫d^I2U\bar{\bf\Delta}\triangleq\frac{{\bf\Delta}}{\hat{d}_{\text{I2U}}}. The robust constraint in (21) is reformulated as

|𝐞I2UT𝐝|2(2r1)σ02,𝚫¯2Υ2d^I2U2.\displaystyle{\left|{\bf e}_{\text{I2U}}^{T}{\bf d}\right|}^{2}\geq\left(2^{r}-1\right)\sigma_{0}^{2},\forall\|\bar{\bf\Delta}\|^{2}\leq\frac{\Upsilon^{2}}{\hat{d}_{\text{I2U}}^{2}}. (25)

Constraint (25) is a non-convex constraint involving infinitely many inequality constraints due to the continuity of the location uncertainty set. To handle the infinite inequalities, we give an approximation of the left hand side of (25), which is shown in the following proposition.

Proposition 2.

The left hand side of (25) can be approximated as |𝐞I2UT𝐝|2Q+2ϕT𝚫¯+𝚫¯T𝚽𝚫¯,{\left|{\bf e}_{\text{I2U}}^{T}{\bf d}\right|}^{2}\approx Q+2{\mbox{\boldmath$\phi$}}^{T}\bar{\mbox{\boldmath$\Delta$}}+\bar{\mbox{\boldmath$\Delta$}}^{T}{\mbox{\boldmath$\Phi$}}\bar{\mbox{\boldmath$\Delta$}}, where Q=|𝟏T𝐝|2Q={\left|{\bf 1}^{T}{\bf d}\right|}^{2}, ϕ=m=1Mn=1M[𝐝]m[𝐝]n(𝐟¯m𝐟¯n){\mbox{\boldmath$\phi$}}=\sum\limits_{m=1}^{M}\sum\limits_{n=1}^{M}[{\bf d}]_{m}[{\bf d}]_{n}^{*}\left(\bar{\bf f}_{m}-\bar{\bf f}_{n}\right), [𝚽]sl=m=1Mn=1M[𝐝]m[𝐝]n[𝐟¯m𝐟¯n]s[𝐟¯m𝐟¯n]l\left[{\mbox{\boldmath$\Phi$}}\right]_{sl}=\sum\limits_{m=1}^{M}\sum\limits_{n=1}^{M}[{\bf d}]_{m}[{\bf d}]_{n}^{*}\left[\bar{\bf f}_{m}-\bar{\bf f}_{n}\right]_{s}\left[\bar{\bf f}_{m}-\bar{\bf f}_{n}\right]_{l} with [𝚽]sl\left[{\mbox{\boldmath$\Phi$}}\right]_{sl} representing the entry in the ss-th row and the ll-th column of 𝚽\Phi and 𝐟¯mjπd^I2U𝐟m\bar{\bf f}_{m}\triangleq j\pi\hat{d}_{\text{I2U}}{\bf f}_{m}.

Proof.

By applying second-order Taylor expansion, we can obtain the desired result. ∎

Based on Proposition 2, (25) can be rewritten as

Q+2ϕT𝚫¯+𝚫¯T𝚽𝚫¯(2r1)σ02,𝚫¯2Υ2d^I2U2.\displaystyle Q+2{\mbox{\boldmath$\phi$}}^{T}\bar{\mbox{\boldmath$\Delta$}}+\bar{\mbox{\boldmath$\Delta$}}^{T}{\mbox{\boldmath$\Phi$}}\bar{\mbox{\boldmath$\Delta$}}\geq\left(2^{r}-1\right)\sigma_{0}^{2},\forall\|\bar{\bf\Delta}\|^{2}\leq\frac{\Upsilon^{2}}{\hat{d}_{\text{I2U}}^{2}}. (26)

Then, we leverage the following lemma to convert constraint (26) into an equivalent form involving one matrix inequality.

Lemma 1.

(General S-Procedure) Consider the quadratic matrix inequality (QMI)[13]:

h(𝐗)=𝐗H𝐀𝐗+2Re(𝐁H𝐗)+𝐂𝟎,\displaystyle h({\bf X})={\bf X}^{H}{\bf A}{\bf X}+2\text{Re}\left({\bf B}^{H}{\bf X}\right)+{\bf C}\succeq{\bf 0}, (27)
𝐗{𝐘|tr(𝐃𝐘𝐘H)1,𝐃𝟎},\displaystyle\forall{\bf X}\in\left\{{\bf Y}|\text{tr}\left({\bf D}{\bf Y}{\bf Y}^{H}\right)\leq 1,{\bf D}\succeq{\bf 0}\right\},

where tr()\text{tr}\left(\cdot\right) represents the trace, 𝐀,𝐃m{\bf A},{\bf D}\in{\mathbb{H}}^{m} with m{\mathbb{H}}^{m} being the set of m×mm\times m Hermitain matrices, 𝐗,𝐁m×n{\bf X},{\bf B}\in{\mathbb{C}}^{m\times n} and 𝐂n{\bf C}\in{\mathbb{H}}^{n}. This QMI holds if there exists μ0\mu\geq 0 such that

[𝐂𝐁H𝐁𝐀]μ[𝐈n𝟎𝟎𝐃]𝟎,\displaystyle\begin{bmatrix}{\bf C}&{\bf B}^{H}\\ {\bf B}&{\bf A}\end{bmatrix}-\mu\begin{bmatrix}{\bf I}_{n}&{\bf 0}\\ {\bf 0}&-{\bf D}\end{bmatrix}\succeq{\bf 0}, (28)

provided that there exists a point 𝐗¯\bar{\bf X} such that h(𝐗¯)𝟎h(\bar{\bf X})\succeq{\bf 0}.

By applying Lemma 1, the constraint (26) is transformed into

[Q(2r1)σ02μϕTϕ𝚽+μd^I2U2Υ2𝐈3]𝟎,\displaystyle\begin{bmatrix}Q-\left(2^{r}-1\right)\sigma_{0}^{2}-\mu&{\mbox{\boldmath$\phi$}}^{T}\\ {\mbox{\boldmath$\phi$}}&{\mbox{\boldmath$\Phi$}}+\mu\frac{\hat{d}_{\text{I2U}}^{2}}{\Upsilon^{2}}{\bf I}_{3}\end{bmatrix}\succeq{\bf 0}, (29)

where μ0{\mu}\geq 0 is a slack variable.

The transformed constraint (29) involves only one matrix inequality constraint, which is more amenable for algorithm design compared to the infinitely many constraints in the original constraint (25). However, the resulting optimization problem is still not jointly convex with respect to 𝐰{\bf{w}} and 𝝃\xi. Therefore, we adopt an alternating optimization method to optimize 𝐰{\bf{w}} and 𝝃\xi iteratively.

IV-B Optimization of 𝐰{\bf w}

Specifically, for given phase shift beam 𝝃\xi, the sub-problem of problem (21) corresponding to the beamforming vector 𝐰{\bf w} is formulated as

min{𝐰,μ}𝐰2,s.t.(29),μ0.\displaystyle\begin{array}[]{ll}\min\limits_{\left\{{\bf w},{\mu}\right\}}\left\|{\bf{w}}\right\|^{2},\ \text{s.t.}\begin{array}[t]{lll}(\ref{c111}),\mu\geq 0.\end{array}\end{array} (32)

However, the constraint (29) is non-convex. To proceed, we recast the optimization problem as a rank-constrained SDP problem. By applying the change of variables 𝐖¯=𝐰𝐰H\bar{\bf W}={\bf w}{\bf w}^{H}, problem (32) can be rewritten as

min{𝐖¯𝕊+N,μ}tr(𝐖¯)\displaystyle\min\limits_{\left\{\bar{\bf W}\in{\mathbb{S}}_{+}^{N},\ {\mu}\right\}}\text{tr}\left(\bar{\bf W}\right) (33)
s.t.[Q¯(2r1)σ02μϕ¯Tϕ¯𝚽¯+μd^I2U2Υ2𝐈3]𝟎,rank(𝐖¯)=1,μ0,\displaystyle\operatorname{s.t.}\begin{array}[t]{llll}\begin{bmatrix}\bar{Q}-\left(2^{r}-1\right)\sigma_{0}^{2}-\mu&\bar{\mbox{\boldmath$\phi$}}^{T}\\ \bar{\mbox{\boldmath$\phi$}}&\bar{\mbox{\boldmath$\Phi$}}+\mu\frac{\hat{d}_{\text{I2U}}^{2}}{\Upsilon^{2}}{\bf I}_{3}\end{bmatrix}\succeq{\bf 0},\\ \text{rank}\left(\bar{\bf W}\right)=1,\mu\geq 0,\end{array} (36)

where 𝕊+N{\mathbb{S}}_{+}^{N} denotes the set of N×NN\times N positive semidefinite Hermitain matrices, Q¯=𝟏MT𝐓𝐖¯𝐓H𝟏M\bar{Q}={\bf 1}_{M}^{T}{\bf T}\bar{\bf W}{\bf T}^{H}{\bf 1}_{M}, [ϕ¯]q=tr(𝐃q𝐓𝐖¯𝐓H)\left[\bar{\mbox{\boldmath$\phi$}}\right]_{q}=\text{tr}\left({\bf D}_{q}{\bf T}\bar{\bf W}{\bf T}^{H}\right), [𝚽¯]sl=tr(𝐀sl𝐓𝐖¯𝐓H)\left[\bar{\mbox{\boldmath$\Phi$}}\right]_{sl}=\text{tr}\left({\bf A}_{sl}{\bf T}\bar{\bf W}{\bf T}^{H}\right), where 𝟏M{\bf 1}_{M} denotes a M×1M\times 1 vector whose elements all equal to 1, 𝐓=diag(𝐠^I2U)𝚯𝐆B2I{\bf T}=\text{diag}(\hat{\bf g}_{\text{I2U}}){\mbox{\boldmath$\Theta$}}{\bf G}_{\text{B2I}}, 𝐃qM×M{\bf D}_{q}\in{\mathbb{R}}^{M\times M} and 𝐀slM×M{\bf A}_{sl}\in{\mathbb{R}}^{M\times M} with entries in the mm-th row and the nn-th column given by [𝐃q]mn=[𝐟¯m𝐟¯n]q[{\bf D}_{q}]_{mn}=\left[\bar{\bf f}_{m}-\bar{\bf f}_{n}\right]_{q} and [𝐀sl]mn=[𝐟¯m𝐟¯n]s[𝐟¯m𝐟¯n]l[{\bf A}_{sl}]_{mn}=\left[\bar{\bf f}_{m}-\bar{\bf f}_{n}\right]_{s}\left[\bar{\bf f}_{m}-\bar{\bf f}_{n}\right]_{l}.

As such, the only remaining non-convexity of problem (14) is due to the rank constraint. Generally, solving such a rank-constrained problem is known to be NP-hard. To overcome this issue, we adopt the SDR technique and drop the rank constraint.

min{𝐖¯𝕊+N,μ}tr(𝐖¯)\displaystyle\min\limits_{\left\{\bar{\bf W}\in{\mathbb{S}}_{+}^{N},\ {\mu}\right\}}\text{tr}\left(\bar{\bf W}\right) (37)
s.t.[Q¯(2r1)σ02μϕ¯Tϕ¯𝚽¯+μd^I2U2Υ2𝐈3]𝟎,μ0,\displaystyle\operatorname{s.t.}\begin{array}[t]{llll}\begin{bmatrix}\bar{Q}-\left(2^{r}-1\right)\sigma_{0}^{2}-\mu&\bar{\mbox{\boldmath$\phi$}}^{T}\\ \bar{\mbox{\boldmath$\phi$}}&\bar{\mbox{\boldmath$\Phi$}}+\mu\frac{\hat{d}_{\text{I2U}}^{2}}{\Upsilon^{2}}{\bf I}_{3}\end{bmatrix}\succeq{\bf 0},\ \mu\geq 0,\end{array} (39)

Therefore, the resulting problem becomes a convex SDP problem, and thus can be efficiently solved by standard convex program solvers such as CVX. While there is no guarantee that the solution obtained by SDR satisfies the rank constraint, the Gaussian randomization can be used to obtain a feasible solution to problem (32) based on the higher-rank solution obtained by solving (37).

IV-C Optimization of 𝛏\xi

For given beamforming vector 𝐰{\bf w}, the sub-problem of problem (21) corresponding to the phase shift beam 𝝃\xi becomes a feasibility-check problem. To further improve optimization performance, we introduce a slack variable v{v}, which is interpreted as the “SINR residual” of the user. Hence, the feasibility-check problem of 𝝃\xi is formulated as follows

max{𝝃,v,μ}v,\displaystyle\max\limits_{\left\{{\mbox{\boldmath$\xi$}},{v},{\mu}\right\}}v, (40)
s.t.Modified-(29),v0,μ0,|ξi|=1,i=1,,M,\displaystyle\operatorname{s.t.}\text{Modified-}(\ref{c111}),{v}\geq 0,{\mu}\geq 0,|\xi_{i}|=1,i=1,\ldots,M,

where the Modified-(29) is obtained from (29) by replacing (2r1)σ02(2^{r}-1){\sigma}_{0}^{2} with (2r1)σ02+v(2^{r}-1){\sigma}_{0}^{2}+v.

To address the non-convexity of both the constraint (29) and the unit-modulus constraint, we apply change of variables 𝚵=𝝃𝝃H\mbox{\boldmath$\Xi$}={\mbox{\boldmath$\xi$}}{\mbox{\boldmath$\xi$}}^{H}. Hence, the problem (40) can be transformed into a rank-constrained (SDP) problem as follows:

max{𝚵,μ,v}v,\displaystyle\max\limits_{\left\{{\mbox{\boldmath$\Xi$}},{\mu},v\right\}}v, (41)
s.t.[Q~(2r1)σ02μvϕ~Tϕ~𝚽~+μd^I2U2Υ2𝐈3]𝟎,[𝚵]ii=1,i=1,,M,rank(𝚵)=1,𝚵𝕊+M,v0,μ0,\displaystyle\operatorname{s.t.}\begin{array}[t]{llll}\begin{bmatrix}\widetilde{Q}-\left(2^{r}-1\right)\sigma_{0}^{2}-\mu-v&\widetilde{\mbox{\boldmath$\phi$}}^{T}\\ \widetilde{\mbox{\boldmath$\phi$}}&\widetilde{\mbox{\boldmath$\Phi$}}+\mu\frac{\hat{d}_{\text{I2U}}^{2}}{\Upsilon^{2}}{\bf I}_{3}\end{bmatrix}\succeq{\bf 0},\\ \left[\mbox{\boldmath$\Xi$}\right]_{ii}=1,i=1,\ldots,M,\\ \text{rank}\left({\mbox{\boldmath$\Xi$}}\right)=1,\ {\mbox{\boldmath$\Xi$}}\in{\mathbb{S}}_{+}^{M},\ {v}\geq 0,{\mu}\geq 0,\end{array} (45)

where Q~=𝟏MT𝚷𝚵𝚷H𝟏M\widetilde{Q}={\bf 1}_{M}^{T}{\mbox{\boldmath$\Pi$}}{\mbox{\boldmath$\Xi$}}{\mbox{\boldmath$\Pi$}}^{H}{\bf 1}_{M}, [ϕ~]q=tr(𝐃q𝚷𝚵𝚷H)[\widetilde{\mbox{\boldmath$\phi$}}]_{q}=\text{tr}({\bf D}_{q}{\mbox{\boldmath$\Pi$}}{\mbox{\boldmath$\Xi$}}{\mbox{\boldmath$\Pi$}}^{H}), [𝚽~]sl=tr(𝐀sl𝚷𝚵𝚷H)[\widetilde{\mbox{\boldmath$\Phi$}}]_{sl}=\text{tr}({\bf A}_{sl}{\mbox{\boldmath$\Pi$}}{\mbox{\boldmath$\Xi$}}{\mbox{\boldmath$\Pi$}}^{H}), and 𝚷=diag(diag(𝐠^I2U)𝚯𝐆B2I𝐰){\mbox{\boldmath$\Pi$}}=\text{diag}(\text{diag}(\hat{\bf g}_{\text{I2U}}){\mbox{\boldmath$\Theta$}}{\bf G}_{\text{B2I}}{\bf w}).

To handle the non-convexity of the rank constraint in (41), we adopt the SDR technique and drop the rank constraint.

max{𝚵,μ,v}v,\displaystyle\max\limits_{\left\{{\mbox{\boldmath$\Xi$}},{\mu},v\right\}}v, (46)
s.t.[Q~(2r1)σ02μvϕ~Tϕ~𝚽~+μd^I2U2Υ2𝐈3]𝟎,[𝚵]ii=1,i=1,,M,𝚵𝕊+M,v0,μ0.\displaystyle\operatorname{s.t.}\begin{array}[t]{llll}\begin{bmatrix}\widetilde{Q}-\left(2^{r}-1\right)\sigma_{0}^{2}-\mu-v&\widetilde{\mbox{\boldmath$\phi$}}^{T}\\ \widetilde{\mbox{\boldmath$\phi$}}&\widetilde{\mbox{\boldmath$\Phi$}}+\mu\frac{\hat{d}_{\text{I2U}}^{2}}{\Upsilon^{2}}{\bf I}_{3}\end{bmatrix}\succeq{\bf 0},\\ \left[\mbox{\boldmath$\Xi$}\right]_{ii}=1,i=1,\ldots,M,\ {\mbox{\boldmath$\Xi$}}\in{\mathbb{S}}_{+}^{M},{v}\geq 0,{\mu}\geq 0.\end{array} (49)

As such, the resulting problem becomes a convex SDP problem, which can be efficiently solved by CVX. Then, we apply the Gaussian randomization to obtain a feasible solution to problem (40) based on the higher-rank solution obtained by solving (46).

IV-D Alternating Optimization of 𝐰{\bf w} and 𝛏\xi

Problem (20) is tackled by solving two sub-problems (37) and (46) in an iterative manner, the details of which are summarized in Algorithm 1.

Algorithm 1 Alternating Optimization Algorithm
1:𝐈𝐧𝐢𝐭𝐢𝐚𝐥𝐢𝐳𝐚𝐭𝐢𝐨𝐧:\mathbf{Initialization:} Given feasible initial solutions 𝝃0{\mbox{\boldmath$\xi$}}_{0}, 𝐰0{\bf w}_{0} and the iteration index i=0i=0.
2:repeat
3:     For given phase shifts 𝝃i{\mbox{\boldmath$\xi$}}_{i}, solve problem (37) and then invoke Gaussian randomization to obtain a feasible beamforming vector 𝐰i+1{\bf w}_{i+1}.
4:     For given beamforming vector 𝐰i+1{\bf w}_{i+1}, solve problem (46) and then exploit Guassian randomization to get a feasible phase shift vector 𝝃i+1{\mbox{\boldmath$\xi$}}_{i+1}.
5:     ii+1i\leftarrow i+1.
6:until The fractional decrease of the objective value in (37) is below a threshold ε>0\varepsilon>0.
7:𝐎𝐮𝐭𝐩𝐮𝐭:\mathbf{Output:} 𝝃=𝝃i{\mbox{\boldmath$\xi$}}^{\star}={\mbox{\boldmath$\xi$}}_{i} and 𝐰=𝐰i{\bf w}^{\star}={\bf w}_{i}.
Remark 1.

Note that all considered sub-problems are SDP problems, which can be solved by interior point method. Therefore, the approximate complexity of problem (37) is o1=𝒪(5((N(N+1)2+2)3+16(N(N+1)2+2)2+64(N(N+1)2+2))){o}_{1}=\mathcal{O}(\sqrt{5}((\frac{N(N+1)}{2}+2)^{3}+16(\frac{N(N+1)}{2}+2)^{2}+64(\frac{N(N+1)}{2}+2))), and that of problem (46) is o2=𝒪(5((M(M1)2+2)3+16(M(M1)2+2)2+64(M(M1)2+2))){o}_{2}=\mathcal{O}(\sqrt{5}((\frac{M(M-1)}{2}+2)^{3}+16(\frac{M(M-1)}{2}+2)^{2}+64(\frac{M(M-1)}{2}+2))). Finally, the approximate complexity of Algorithm 2 per iteration is o1+o2{o}_{1}+{o}_{2}. With such complexity, it is required that the BS has strong computational capacity so that the transmit beam and IRS phase shifts can be computed in real time.

Remark 2.

Since a SDR technique followed by Gaussian randomization is adopted when solving the two sub-problems, the strict convergence of the proposed alternating algorithm can not be guaranteed. But for each sub-problem, such a SDR approach followed by a sufficiently large number of randomizations guarantees at least a π4\frac{\pi}{4}-approximation of the optimal objective value.

V Simulation results

In this section, we provide numerical results to evaluate the performance of the proposed algorithm. The considered system is assumed to operate at 2828 GHz with bandwidth of 100 MHz and noise spectral power density of -169 dBm/Hz. The IRS is at the origin (0,0,0)(0,0,0) of a Cartesian coordinate system. The locations of the BS and the user are (100,100,0)(100,-100,0) and (20,20,20)(20,20,-20), respectively. Unless otherwise specified, the following setup is used: N=16N=16, M=100M=100 and Υ=4\Upsilon=4.222As pointed out in [16], synchronously operating a large number of phase shifters is a non-trivial task. The IRS may suffer from phase errors. It have been shown in [17] that the average received SNR is attenuated by ϕ2\phi^{2} where ϕ𝔼{ejθ}\phi\triangleq\mathbb{E}\left\{e^{j\theta}\right\} with θ\theta being the phase error. One possible way to reduce the phase error is to use phase shifters with adaptive tuning capability.

Fig. 2 compares the proposed robust scheme with a “Non-robust” optimization scheme [3]. It is worth noting that the target rate rr is a predefined threshold, while the x-axis in Fig.2 (RR) is the rate achieved under different location errors of each channel realization. The proposed robust beamforming scheme requires that the achievable rate under all possible location errors should exceed the threshold rr, while the non-robust beamforming scheme regards the estimated channels as perfect channels, and aims to maximize the achievable rate without location uncertainty, using the same power as the proposed beamforming scheme. As can be readily seen, the variation of the user rate with robust optimization is much smaller than that with non-robust optimization. Moreover, the target rate can be always guaranteed regardless of user location errors. By contrast, with non-robust optimization, the user rate varies over a wide range. For instance, with r=6r=6, the user rate ranges from near 0 bits/s/Hz to about 7.2 bits/s/Hz. Moreover, there is a high probability (over 80%80\%) that the target rate can not be achieved.

Refer to caption
Figure 2: Comparison of the proposed robust optimization and the non-robust optimization.

Fig. 3 presents the transmit power versus the target rate with different location uncertainty and numbers of reflecting elements. Obviously, to achieve a higher target rate, more power is required. Also, as location uncertainty (measured by Υ\Upsilon) increases, the required transmit power becomes larger so that the target rate can be achieved for all possible location errors. Besides, since both the beamforming gain and the aperture gain of the IRS grow with the number of reflecting elements, the transmit power drops significantly with the number of reflecting elements, implying the benefit of the IRS in power saving.

Refer to caption
Figure 3: Transmit power versus the target rate.

VI Conclusion

In this paper, considering user location uncertainty, we study the robust beamforming design for an IRS-aided communication system. We first handle the location uncertainty by exploiting techniques of Taylor expansion and S-Procedure. Then SDR is used to transform the non-convex problem into a sequence of SDP sub-problems, which can be efficiently solved via some optimization tools, for example, CVX. Simulation results demonstrate that with our proposed robust algorithm, the QoS requirement is always met regardless of location uncertainty, while with a non-robust optimization algorithm [3] which has the same transmit power as the proposed algorithm, the QoS requirement is met with a probability below 20%20\%.

References

  • [1] S. Dang, O. Amin, B. Shihada, and M. Alouini, “What should 6G be?” Nature Electronics, vol. 3, pp. 20–29, 2020.
  • [2] Q. Wu and R. Zhang, “Towards smart and reconfigurable environment: intelligent reflecting surface aided wireless network,” IEEE Commun. Mag., vol. 58, no. 1, pp. 106–112, Jan. 2020.
  • [3] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,” IEEE Trans. Commun., vol. 18, no. 11, pp. 5394–5409, 2019.
  • [4] X. Hu, C. Zhong, Y. Zhu, X. Chen, and Z. Zhang, “Programmable metasurface based multicast systems: Design and analysis,” IEEE J. Selected Areas Commun., vol. 38, no. 8, pp. 1763-1776, Aug. 2020.
  • [5] B. Zheng and R. Zhang, “Intelligent reflecting surface-enhanced OFDM: Channel estimation and reflection optimization,” IEEE Wireless Commun. Lett., vol. 9, no. 4, pp. 518–522, Apr. 2020.
  • [6] Z. He and X. Yuan, “Cascaded channel estimation for large intelligent metasurface assisted massive MIMO,” IEEE Wireless Commun. Lett., vol. 9, no. 2, pp. 210–214, Feb. 2020.
  • [7] A. Taha, M. Alrabeiah, and A. Alkhateeb, “Enabling large intelligent surfaces with compressive sensing and deep learning,” [Online]. Available: https://arxiv.org/abs/1904.10136.
  • [8] X. Hu, C. Zhong, Y. Zhang, X. Chen, and Z. Zhang, “Location information aided multiple intelligent reflecting surface systems,” accepted to appear in IEEE Trans. Commun., 2020.
  • [9] Y. Han, W. Tang, S. Jin, C.-K. Wen, and X. Ma, “Large intelligent surface-assisted wireless communication exploiting statistical CSI, ”IEEE Trans. Veh. Technol., vol. 68, no. 8, pp. 8238–8242, 2019.
  • [10] X. Hu, J. Wang, and C. Zhong, “Statistical CSI based design for intelligent reflecting surface assisted MISO systems,” accepted to appear in Science China: Information Science, 2021.
  • [11] G. Zhou, C. Pan, H. Ren, K. Wang, M. Di Renzo, and A. Nallanathan, “Robust beamforming design for intelligent reflecting surface aided MISO communication systems,” [Online]. Available: https://arxiv.org/abs/1911.06237.
  • [12] J. Zhang, Y. Zhang, C. Zhong and Z. Zhang, “Robust design for intelligent reflecting surfaces assisted MISO systems,” IEEE Commun. Lett., Early Access, doi: 10.1109/LCOMM.2020.3002557.
  • [13] Z.-Q. Luo, J. F. Sturm, and S. Zhang, “Multivariate nonnegative quadratic mappings,” SIAM Journal on Optimization, vol. 14, no. 4, pp. 1140–1162, 2004.
  • [14] A. Ben-Tal and A. Nemirovski, Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Siam, 2001, vol. 2.
  • [15] H. L. V. Trees,Detection, Estimation, and Modulation Theory: Optimum Array Processing. Wiley, 2002.
  • [16] H. Tataria, F. Tufvesson, and O. Efors, “Real-Time implementation aspects of large intelligent surfaces,” ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Barcelona, Spain, 2020, pp. 9170-9174.
  • [17] M.-A. Badiu, and J. P. Coon, “Communication through a large reflecting surface with phase errors,” IEEE Wireless Commun. Lett., vol. 9, no. 2, pp. 184–188, Feb. 2020.