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

Intelligent Reflecting Surfaces and Classical Relays: Coexistence and Co-Design

Te-Yi Kan11, Ronald Y. Chang11, and Feng-Tsun Chien22 This work was supported in part by the Ministry of Science and Technology, Taiwan, under Grants MOST 109-2221-E-001-013-MY3 and MOST 110-2221-E-A49-035. 11Research Center for Information Technology Innovation, Academia Sinica, Taiwan
22Institute of Electronics, National Yang Ming Chiao Tung University, Taiwan
Email: dexter.ty.kan@gmail.com, rchang@citi.sinica.edu.tw, ftchien@mail.nctu.edu.tw
Abstract

This paper investigates a multiuser downlink communication system with coexisting intelligent reflecting surface (IRS) and classical half-duplex decode-and-forward (DF) relay. In this system, the IRS and the DF relay interact with each other and assist transmission simultaneously. In particular, active beamforming at the base station (BS) and at the DF relay, and passive beamforming at the IRS, are jointly designed to maximize the sum-rate of all users. The sum-rate maximization problem is nonconvex due to the coupled beamforming vectors. We propose an alternating optimization (AO) based algorithm to tackle this complex co-design problem. Numerical validation and discussion on the superiority of the coexistence system and the tradeoffs therein are presented.

I Introduction

Intelligent reflecting surfaces (IRSs), also known as reconfigurable intelligent surfaces (RISs), passive intelligent mirrors (PIMs), and large intelligent surfaces (LISs), have recently been proposed as a key enabler for next-generation wireless communications [1, 2]. IRSs employ a large number of low-cost passive elements, instead of active transmitters, to “reflect” signals to empower smart and reconfigurable radio environments. It is envisioned that deploying IRSs is less expensive as compared to installing active transmitters such as base stations (BSs) and relays, and operating IRSs is more energy-efficient and eases signal processing and interference management requirements due to its low-cost and passive nature. Thus, IRSs are suitable for dense deployment and are promising to help meet the demands of beyond fifth-generation (B5G) and sixth-generation (6G) communications, such as high data rates, energy efficiency, and ubiquitous connectivity.

There is a wealth of research on IRS focusing on joint transmit beamforming and IRS phase shifts optimization for sum-rate maximization (e.g., [3, 4, 5, 6, 7]) or power minimization (e.g., [8, 9]). IRS-enhanced multi-input single-output (MISO) systems were studied for single-user [3] and multiuser [4] scenarios, where transmit beamforming at the BS and the phase shifts at the IRS were configured by optimizing the received signal power or sum-rate of users. Machine learning-based techniques were also introduced into IRS-aided systems to adjust transmit beamforming and IRS phase shifts [5]. IRS-enhanced broadband orthogonal frequency division multiplexing (OFDM) systems were also studied [6]. In [6], BS beamforming and IRS reflection were jointly designed for the objective of sum-rate maximization or, after transformation, mean square error (MSE) minimization in multiuser MISO systems. IRS-empowered non-orthogonal multiple access (NOMA) systems for signal-to-interference-plus-noise ratio (SINR) improvement were also studied [7]. On the other hand, power minimization problems in IRS-aided systems were considered [8, 9]. In [8], transmit beamforming and IRS beamforming for power minimization subject to user SINR constraints in MISO systems were considered. In [9], transmit power minimization in IRS-empowered NOMA systems was studied. It was shown that incorporating IRSs into NOMA brings merits in decoding and differentiating multiple users due to IRS’s ability to reconfigure wireless channels.

Similarities and differences between IRS and classical decode-and-forward (DF) and amplify-and-forward (AF) relaying have been explored [10, 11, 12, 13]. In [10], comparisons between IRS and DF relaying were conducted analytically and numerically for a SISO system, showing that IRS with sufficient reflecting elements can achieve higher data rates and better energy efficiency in high target data rate regimes than DF relaying. In [11], comparisons between IRS and AF relaying were conducted numerically in an IRS-aided multiuser MISO system. It was shown that replacing the IRS with an AF relay yields higher sum rates but lower energy efficiency due to active power amplification of the AF relay. In [12], IRS and full-duplex/half-duplex AF relaying were compared. It was shown that IRS achieves comparable or even better performance as compared to full-duplex and half-duplex AF relaying when the number of IRS reflecting elements is sufficiently large. In [13], a comprehensive discussion on the subject was presented from various perspectives such as hardware complexity, power consumption, and spectral efficiency. It was similarly concluded that IRS with sufficient reflecting elements has the potential to outperform relay-aided transmission since IRS operates in a full-duplex manner, yet without the loop interference as in full-duplex relays.

In this paper, we consider the practical scenario with coexisting IRS and half-duplex DF relay in a multiuser MISO (MU-MISO) system. The consideration is interesting and new, in especially two aspects. First, the IRS and relay coexistence system is different from the traditional multi-relay (in this case, two-relay) system, since there was no interaction between the relays in a multi-relay system but there is interaction between IRS and relay in the new system. Second, the IRS reflects signals at both phases of half-duplex DF relaying, and there exist tradeoffs in the design of IRS beamforming to cater for both the end users and the DF relay. The complex co-design problem of BS beamforming, relay beamforming, and IRS beamforming for maximum sum rates is examined. Note that these aspects were unexplored in the recent related work [14]. Finally, numerical validation and discussion on the superiority of the coexistence system and tradeoffs therein are presented.

II System Model and Problem Formulation

II-A System Model

Refer to caption
Figure 1: A coexisting IRS and relay assisted MU-MISO system. Solid/dashed lines indicate transmissions in the first/second phases.

As shown in Fig. 1, we consider a downlink MU-MISO communication system that comprises a BS with MM antennas, KK single-antenna end users, an IRS with NN reflecting elements, and a classical half-duplex DF relay with LL antennas. Here, to ensure a sufficient degree of freedom, we assume Kmin{M,L}K\leq\min\{M,L\}. The baseband equivalent channels between two communication nodes among the BS, IRS, relay, and user kk are denoted by self-explanatory notations 𝐇BS,RL×M{\mathbf{H}}_{{\rm BS},{\rm R}}\in{\mathbb{C}}^{L\times M}, 𝐇BS,IRSN×M{\mathbf{H}}_{{\rm BS},{\rm IRS}}\in{\mathbb{C}}^{N\times M}, 𝐡BS,k1×M{\mathbf{h}}_{{\rm BS},k}\in{\mathbb{C}}^{1\times M}, 𝐇R,IRSN×L{\mathbf{H}}_{{\rm R},{\rm IRS}}\in{\mathbb{C}}^{N\times L}, 𝐡R,k1×L{\mathbf{h}}_{{\rm R},k}\in{\mathbb{C}}^{1\times L}, and 𝐡IRS,k1×N{\mathbf{h}}_{{\rm IRS},k}\in{\mathbb{C}}^{1\times N}. All channels are assumed to be quasi-static and Rayleigh flat-fading. The small-scale fading is modeled by complex Gaussian with zero mean and unit variance and the large-scale fading is modeled by κ(d/d0)ϱ,\kappa{\left({d}/{d_{0}}\right)}^{-\varrho}, where dd is the distance between the two end nodes, d0d_{0} is the reference distance, κ\kappa is a large-scale fading constant, and ϱ\varrho is the path-loss exponent. The CSI of all channels is assumed perfectly known at the BS, the IRS controller, and the relay. Due to the presence of the relay, there are two phases in one complete transmission of information, for which the first phase and the second phase are assumed to be within the channel coherence interval. Moreover, in this paper, reflecting elements can be adjusted by the IRS controller once in each complete transmission of the information. Next, we elaborate on the two-phase transmission protocol.

II-A1 First Phase

During the first phase, the BS transmits its signal to all users and the relay via direct link. Meanwhile, the IRS reflects the incident signal from the BS towards the DF relay and all users. The received signal at user kk in the first phase is given by

ykI=𝐡BS,k𝐱+wkI,\displaystyle{y}_{k}^{\rm I}={\mathbf{h}}^{\prime}_{{\rm BS},k}{\mathbf{x}}+w_{k}^{\rm I}, (1)

where 𝐡BS,k𝐡IRS,k𝚯𝐇BS,IRS+𝐡BS,k{\mathbf{h}}^{\prime}_{{\rm BS},k}\triangleq{\mathbf{h}}_{{\rm IRS},k}{\mathbf{\Theta}}{\mathbf{H}}_{{\rm BS},{\rm IRS}}+{\mathbf{h}}_{{\rm BS},k} is the effective channel from the BS to the end user kk, 𝚯diag(𝜽){\mathbf{\Theta}}\triangleq{\rm diag}({\boldsymbol{\theta}}) with 𝜽=[θ1θN]{\boldsymbol{\theta}}=\begin{bmatrix}\theta_{1}&\ldots&\theta_{N}\end{bmatrix} is the diagonal matrix accounting for the passive IRS beamforming, and wkI𝒞𝒩(0,σk2)w_{k}^{\rm I}\sim\mathcal{CN}\left(0,\sigma_{k}^{2}\right) denotes the additive white Gaussian noise (AWGN) at user kk during the first phase. Note that the nn-th reflecting element adjustment θn\theta_{n} is given by θn=βnejψn\theta_{n}=\beta_{n}e^{j\psi_{n}} with the amplitude attenuation βn1\beta_{n}\leq 1 and the phase shift ψn[0,2π)\psi_{n}\in\left[0,2\pi\right).

The transmit signal at the BS is 𝐱=k=1K𝐠ksk=𝐆𝐬{\mathbf{x}}=\sum_{k=1}^{K}{\mathbf{g}}_{k}s_{k}={\mathbf{G}}\cdot{\mathbf{s}}, where 𝐠kM×1{\mathbf{g}}_{k}\in{\mathbb{C}}^{M\times 1} denotes the beamforming vector for user kk with 𝐆[𝐠1,,𝐠K]{\mathbf{G}}\triangleq[{\mathbf{g}}_{1},\ldots,{\mathbf{g}}_{K}] and 𝐬[s1,,sK]T{\mathbf{s}}\triangleq[s_{1},\ldots,s_{K}]^{\rm T}, sks_{k} is the data intended for user kk with zero mean and unit variance. The data streams from different users are assumed independent. Then, the transmit power at the BS is PBStotal=𝔼[𝐱2]=tr(𝐆𝐆H)PBSmax,P_{\rm BS}^{\rm total}={\mathbb{E}}\big{[}{\|{\mathbf{x}}\|}^{2}\big{]}={\rm tr}\left({\mathbf{G}}{\mathbf{G}}^{\rm H}\right)\leq P^{\max}_{\rm BS}, where PBSmaxP^{\max}_{\rm BS} is the maximum available power at the BS. The SINR for user kk in the first phase is

γkI=|𝐡BS,k𝐠k|2j=1,jkK|𝐡BS,k𝐠j|2+σk2.\displaystyle\gamma_{k}^{\rm I}=\frac{{|{\mathbf{h}}^{\prime}_{{\rm BS},k}{\mathbf{g}}_{k}|}^{2}}{\sum_{j=1,j\neq k}^{K}{|{\mathbf{h}}^{\prime}_{{\rm BS},k}{\mathbf{g}}_{j}|}^{2}+\sigma_{k}^{2}}. (2)

On the other hand, the received signal at the DF relay is

𝐲R=𝐇BS,R𝐱+𝐰R,\displaystyle{\mathbf{y}}_{\rm R}={\mathbf{H}}^{\prime}_{{\rm BS},{\rm R}}{\mathbf{x}}+{\mathbf{w}}_{\rm R}, (3)

where 𝐇BS,R𝐇R,IRSH𝚯𝐇BS,IRS+𝐇BS,R{\mathbf{H}}^{\prime}_{{\rm BS},{\rm R}}\triangleq{\mathbf{H}}_{{\rm R},{\rm IRS}}^{\rm H}{\mathbf{\Theta}}{\mathbf{H}}_{{\rm BS},{\rm IRS}}+{\mathbf{H}}_{{\rm BS},{\rm R}} is the effective channel from the BS to the relay and 𝐰R𝒞𝒩(0,σR2𝐈L){\mathbf{w}}_{\rm R}\sim\mathcal{CN}\left(0,\sigma_{R}^{2}{\mathbf{I}}_{L}\right) is the AWGN at the relay. Matched filtering is employed at the relay to decode all users’ signals from the BS. The resulting SINR is [15]

γR,k=𝜶k4j=1,jkK𝜶kH𝜶j𝜶jH𝜶k+σR2𝜶k2,\displaystyle\gamma_{{\rm R},k}=\frac{{\|{\boldsymbol{\alpha}}_{k}\|}^{4}}{\sum_{j=1,j\neq k}^{K}{\boldsymbol{\alpha}}_{k}^{\rm H}{\boldsymbol{\alpha}}_{j}{\boldsymbol{\alpha}}_{j}^{\rm H}{\boldsymbol{\alpha}}_{k}+\sigma_{\rm R}^{2}{\|{\boldsymbol{\alpha}}_{k}\|}^{2}}, (4)

where 𝜶k𝐇BS,R𝐠k{\boldsymbol{\alpha}}_{k}\triangleq{\mathbf{H}}^{\prime}_{{\rm BS},{\rm R}}{\mathbf{g}}_{k} is the filter weight for user kk.

II-A2 Second phase

During the second phase, the relay transmits the signal to all users and the IRS, where the latter also reflects the incident signal towards all users. Here, we assume that the DF relay can perfectly decode the signal for user kk if the SINR γR,k\gamma_{{\rm R},k} for user kk at the relay exceeds a predefined threshold γRth\gamma_{\rm R}^{\rm th}. The transmit signal at the relay is 𝐱R=k=1K𝐟ksk=𝐅𝐬,{\mathbf{x}}_{\rm R}=\sum_{k=1}^{K}{\mathbf{f}}_{k}s_{k}={\mathbf{F}}\cdot{\mathbf{s}}, where 𝐟kL×1{\mathbf{f}}_{k}\in{\mathbb{C}}^{L\times 1} denotes the beamforming vector at the relay for user kk and 𝐅[𝐟1,,𝐟K]{\mathbf{F}}\triangleq[{\mathbf{f}}_{1},\ldots,{\mathbf{f}}_{K}]. The relay’s transmit power is PRtotal=𝔼[𝐱R2]=tr(𝐅𝐅H)PRmax,P_{\rm R}^{\rm total}={\mathbb{E}}\left[{\|{\mathbf{x}}_{\rm R}\|}^{2}\right]={\rm tr}\left({\mathbf{F}}{\mathbf{F}}^{\rm H}\right)\leq P_{\rm R}^{\max}, where PRmaxP_{\rm R}^{\max} denotes the relay’s maximum available power. The received signal at user kk in the second phase can be represented by

ykII=𝐡R,k𝐱R+wkII,\displaystyle y_{k}^{\rm II}={\mathbf{h}}^{\prime}_{{\rm R},k}{\mathbf{x}}_{\rm R}+w_{k}^{\rm II}, (5)

where 𝐡R,k𝐡IRS,k𝚯𝐇R,IRS+𝐡R,k{\mathbf{h}}^{\prime}_{{\rm R},k}\triangleq{\mathbf{h}}_{{\rm IRS},k}{\mathbf{\Theta}}{\mathbf{H}}_{{\rm R},{\rm IRS}}+{\mathbf{h}}_{{\rm R},k} is the effective channel from the relay to user kk and wkII𝒞𝒩(0,σk2)w_{k}^{\rm II}\sim\mathcal{CN}\left(0,\sigma_{k}^{2}\right) is the corresponding AWGN. It follows that the SINR for user kk in the second phase is

γkII=|𝐡R,k𝐟k|2j=1,jkK|𝐡R,k𝐟j|2+σk2.\displaystyle\gamma_{k}^{\rm II}=\frac{{|{\mathbf{h}}^{\prime}_{{\rm R},k}{\mathbf{f}}_{k}|}^{2}}{\sum_{j=1,j\neq k}^{K}{|{\mathbf{h}}^{\prime}_{{\rm R},k}{\mathbf{f}}_{j}|}^{2}+\sigma_{k}^{2}}. (6)

Finally, the resulting SINR after combining the signals from the two phases using the maximal ratio combining is

γk=γkI+γkII.\displaystyle\gamma_{k}=\gamma_{k}^{\rm I}+\gamma_{k}^{\rm II}. (7)

II-B Problem Formulation

In this paper, we aim for maximizing the sum-rate of all the users by jointly optimizing the active beamforming at the BS, the active beamforming at the relay, and the passive beamforming at the IRS. Specifically, the optimization problem is formulated as

max{𝐠k},{𝐟k},𝚯\displaystyle\max_{\{\mathbf{g}_{k}\},\{\mathbf{f}_{k}\},\mathbf{\Theta}} k=1Klog2(1+γk)\displaystyle\sum_{k=1}^{K}{\log_{2}\left(1+\gamma_{k}\right)} (8a)
s.t. PBStotalPBSmax,\displaystyle P_{\rm BS}^{\rm total}\leq P^{\max}_{\rm BS}, (8b)
PRtotalPRmax,\displaystyle P_{\rm R}^{\rm total}\leq P_{\rm R}^{\max}, (8c)
|θn|1,n=1,2,,N,\displaystyle{\left|\theta_{n}\right|}\leq 1,\forall n=1,2,\ldots,N, (8d)
γR,kγRth,k=1,2,,K,\displaystyle\gamma_{{\rm R},k}\geq\gamma_{\rm R}^{\rm th},\forall k=1,2,\ldots,K, (8e)

where the optimization variables and objective function are given in (8a), {𝐠k}\{\mathbf{g}_{k}\} and {𝐟k}\{\mathbf{f}_{k}\} are the sets of the BS beamforming and the relay beamforming vectors for all users, respectively. Constraints (8b) and (8c) denote the available transmit power at the BS and the DF relay, respectively. Constraint (8d) is the reflection constraint for an ideal IRS. Constraint (8e) ensures the decoding SINR requirements for all users’ signals at the relay are satisfied. Note that the pre-log factor of 1/21/2 due to two-phase transmission is dropped in the achievable rate expression, but is considered in all simulations.

Solving the problem in (8) is a challenging task, as the optimization variables are highly coupled, rendering a nonconvex problem. To tackle the problem, we propose an alternating optimization (AO)-based algorithm to decouple (8) into three subproblems, as detailed in the next section.

III AO-Based Beamforming Co-Design

In this section, we elaborate on the three subproblems in the proposed AO-based algorithm: BS beamforming, relay beamforming, and IRS beamforming. The entire AO algorithm runs through optimizing the BS beamforming (in Sec. III-A), relay beamforming (in Sec. III-B), and IRS beamforming (in Sec. III-C), in an alternate fashion.

III-A BS Beamforming Optimization

Given fixed relay beamforming vectors {𝐟k}\{{\mathbf{f}}_{k}\} and IRS beamforming matrix 𝚯\mathbf{\Theta}, the problem in (8) becomes

max{𝐠k}\displaystyle\max_{\{\mathbf{g}_{k}\}} k=1Klog2(C1,k+γkI)\displaystyle\sum_{k=1}^{K}{\log_{2}\left(C_{1,k}+\gamma_{k}^{\rm I}\right)} (9a)
s.t. PBStotalPBSmax,\displaystyle P_{\rm BS}^{\rm total}\leq P^{\max}_{\rm BS}, (9b)
γR,kγRth,k=1,,K,\displaystyle\gamma_{{\rm R},k}\geq\gamma_{\rm R}^{\rm th},k=1,\ldots,K, (9c)

where C1,k=1+γkII,C_{1,k}=1+\gamma_{k}^{\rm II}, k=1,,Kk=1,\ldots,K are considered as constants under the AO-based decomposition. The subproblem (9) is still nonconvex and difficult to solve. In this subsection, we tackle the subproblem in (9) by first transforming the problem of finding 𝐠k\mathbf{g}_{k} into one of finding the rank-one positive semidefinite matrix 𝐆k=𝐠k𝐠kH{\mathbf{G}}_{k}=\mathbf{g}_{k}{\mathbf{g}}_{k}^{\rm H} and then by relaxing the rank-one constraint, which eventually leads to a convex semidefinite programming (SDP) problem. Toward this end, we develop the following four steps 1) introducing slack variables, 2) first-order Taylor approximation, 3) alternating optimization, and 4) semidefinite relaxation, as detailed below.

III-A1 Introducing Slack Variables

We introduce slack variables {𝒮1,k}\{{\mathcal{S}}_{1,k}\}, {1,k}\{{\mathcal{I}}_{1,k}\}, {𝒮R,k}\{{\mathcal{S}}_{{\rm R},k}\}, and {R,k}\{{\mathcal{I}}_{{\rm R},k}\} that satisfy

1𝒮1,k\displaystyle\frac{1}{{\mathcal{S}}_{1,k}} |𝐡BS,k𝐠k|2tr(𝐆k𝐡B,k′′),\displaystyle\triangleq{\left|{\mathbf{h}}^{\prime}_{{\rm BS},k}{\mathbf{g}}_{k}\right|}^{2}\leq{\rm tr}({\mathbf{G}}_{k}{\mathbf{h}}^{\prime\prime}_{{\rm B},k}), (10)
1,k\displaystyle{\mathcal{I}}_{1,k} jk|𝐡BS,k𝐠j|2+σk2jktr(𝐆j𝐡B,k′′)+σk2,\displaystyle\triangleq\sum_{j\neq k}{\left|{\mathbf{h}}^{\prime}_{{\rm BS},k}{\mathbf{g}}_{j}\right|}^{2}+\sigma_{k}^{2}\geq\sum_{j\neq k}{\rm tr}({\mathbf{G}}_{j}{\mathbf{h}}^{\prime\prime}_{{\rm B},k})+\sigma_{k}^{2}, (11)
1𝒮R,k\displaystyle\frac{1}{{\mathcal{S}}_{{\rm R},k}} 𝜶k4[tr(𝐆k𝐇B,R′′)]2,\displaystyle\triangleq{\|{\boldsymbol{\alpha}}_{k}\|}^{4}\leq{[{\rm tr}({\mathbf{G}}_{k}{\mathbf{H}}_{{\rm B},{\rm R}}^{\prime\prime})]}^{2}, (12)
R,k\displaystyle{\mathcal{I}}_{{\rm R},k} jk𝜶kH𝜶j𝜶jH𝜶k+σR2𝜶k2\displaystyle\triangleq\sum_{j\neq k}{\boldsymbol{\alpha}}_{k}^{\rm H}{\boldsymbol{\alpha}}_{j}{\boldsymbol{\alpha}}_{j}^{\rm H}{\boldsymbol{\alpha}}_{k}+\sigma_{\rm R}^{2}{\|{\boldsymbol{\alpha}}_{k}\|}^{2}
jktr(𝐆k𝐇B,R′′𝐆j𝐇B,R′′)+σR2tr(𝐆k𝐇B,R′′),\displaystyle\geq\sum_{j\neq k}{\rm tr}({\mathbf{G}}_{k}{\mathbf{H}}_{{\rm B},{\rm R}}^{\prime\prime}{\mathbf{G}}_{j}{\mathbf{H}}_{{\rm B},{\rm R}}^{\prime\prime})+\sigma_{\rm R}^{2}{\rm tr}({\mathbf{G}}_{k}{\mathbf{H}}_{{\rm B},{\rm R}}^{\prime\prime}), (13)

where 𝐇B,R′′𝐇BS,RH𝐇BS,R{\mathbf{H}}_{{\rm B},{\rm R}}^{\prime\prime}\triangleq{{\mathbf{H}}_{{\rm BS},{\rm R}}^{\prime}}^{\rm H}{\mathbf{H}}_{{\rm BS},{\rm R}}^{\prime} and 𝐡B,k′′𝐡BS,kH𝐡BS,k{\mathbf{h}}^{\prime\prime}_{{\rm B},k}\triangleq{{\mathbf{h}}^{\prime}_{{\rm BS},k}}^{\rm H}{\mathbf{h}}^{\prime}_{{\rm BS},k}. Incorporating these slack variables into (9) gives rise to the following equivalent problem

max\displaystyle\max k=1KR1,k\displaystyle\sum_{k=1}^{K}{R_{1,k}} (14a)
variables: {𝐆k},{R1,k},{𝒮1,k},{1,k},{𝒮R,k},{R,k}\displaystyle\{\mathbf{G}_{k}\},\{R_{1,k}\},\{{\mathcal{S}}_{1,k}\},\{{\mathcal{I}}_{1,k}\},\{{\mathcal{S}}_{{\rm R},k}\},\{{\mathcal{I}}_{{\rm R},k}\}
s.t. R1,klog2(Ck,1+1𝒮1,k1,k)u1(𝐳),\displaystyle R_{1,k}\leq\log_{2}\big{(}C_{k,1}+\frac{1}{{\mathcal{S}}_{1,k}{{\mathcal{I}}_{1,k}}}\big{)}\triangleq u_{1}({\bf z}), (14b)
v1(𝐳R)1𝒮R,kR,kγRth,\displaystyle v_{1}({\bf z}_{\rm R})\triangleq\frac{1}{{\mathcal{S}}_{{\rm R},k}{\mathcal{I}}_{{\rm R},k}}\geq\gamma_{\rm R}^{\rm th}, (14c)
(9b),(10),(11),(12),(13),\displaystyle\eqref{eq_op_AO_BS_cons1},\eqref{S_1},\eqref{I_1},\eqref{S_R},\eqref{I_R}, (14d)
𝐆k0,rank(𝐆k)=1,\displaystyle{\mathbf{G}}_{k}\succeq 0,~{}~{}\text{rank}\left({\mathbf{G}}_{k}\right)=1, (14e)
k=1,2,,K,\displaystyle\quad\quad\forall k=1,2,\ldots,K,

where u1(𝐳)u_{1}({\bf z}) and v1(𝐳R)v_{1}({\bf z}_{\rm R}) with 𝐳=[𝒮1,k,1,k]T{\bf z}=[{\mathcal{S}}_{1,k},{\mathcal{I}}_{1,k}]^{\rm T} and 𝐳R=[𝒮R,k,R,k]T{\bf z}_{\rm R}=[{\mathcal{S}}_{{\rm R},k},{\mathcal{I}}_{{\rm R},k}]^{\rm T} defined in (14b) and (14c), respectively, are for notational convenience and clarity. Note that the optimal solution of (14) meets the constraints (10)–(13) in (14d) with equality. The subproblem in (14) is still nonconvex.

III-A2 First-Order Taylor Approximation

To convexify the constraints (14b) and (14c), we utilize the fact that any convex function can be lower bounded by its first-order Taylor approximation. Since u1(𝐳)u_{1}({\bf z}) and v1(𝐳R)v_{1}({\bf z}_{\rm R}) are convex, from the first-order Taylor representation, we have

u1(𝐳)\displaystyle u_{1}({\bf z}) u1(𝐳loc)+u1(𝐳loc)T(𝐳𝐳loc)R1,klow,\displaystyle\geq u_{1}({\bf z}^{\rm loc})+\nabla u_{1}({\bf z}^{\rm loc})^{\rm T}({\bf z}-{\bf z}^{\rm loc})\triangleq R_{1,k}^{\rm low}, (15)
v1(𝐳R)\displaystyle v_{1}({\bf z}_{\rm R}) v1(𝐳Rloc)+v1(𝐳Rloc)T(𝐳R𝐳Rloc)γR,klow,\displaystyle\geq v_{1}({\bf z}_{\rm R}^{\rm loc})+\nabla v_{1}({\bf z}_{\rm R}^{\rm loc})^{\rm T}({\bf z}_{\rm R}-{\bf z}_{\rm R}^{\rm loc})\triangleq\gamma_{{\rm R},k}^{\rm low}, (16)

where 𝐳loc=[𝒮1,kloc,1,kloc]T{\bf z}^{\rm loc}=[{\mathcal{S}}_{1,k}^{\rm loc},{\mathcal{I}}_{1,k}^{\rm loc}]^{\rm T} and 𝐳Rloc=[𝒮R,kloc,R,kloc]T{\bf z}_{\rm R}^{\rm loc}=[{\mathcal{S}}_{{\rm R},k}^{\rm loc},{\mathcal{I}}_{{\rm R},k}^{\rm loc}]^{\rm T} are local points at which u1(𝐳)u_{1}({\bf z}) and v1(𝐳R)v_{1}({\bf z}_{\rm R}) are differentiable, respectively. The two lower bounds R1,klowR_{1,k}^{\rm low} and γR,klow\gamma_{{\rm R},k}^{\rm low} can be carried out in closed-form from the gradients u1(𝐳loc)\nabla u_{1}({\bf z}^{\rm loc}) and v1(𝐳Rloc)\nabla v_{1}({\bf z}_{\rm R}^{\rm loc}), respectively. Replacing u1(𝐳)u_{1}({\bf z}) in (14b) and v1(𝐳R)v_{1}({\bf z}_{\rm R}) in (14c) with their respective lower bounds in (15) and (16) linearizes and convexifies the constraints (14b) and (14c), converting the problem in (14) to

max\displaystyle\max k=1KR1,k\displaystyle\sum_{k=1}^{K}{R_{1,k}} (17a)
variables: {𝐆k},{R1,k},{𝒮1,k},{1,k},{𝒮R,k},{R,k}\displaystyle\{\mathbf{G}_{k}\},\{R_{1,k}\},\{{\mathcal{S}}_{1,k}\},\{{\mathcal{I}}_{1,k}\},\{{\mathcal{S}}_{{\rm R},k}\},\{{\mathcal{I}}_{{\rm R},k}\}
s.t. R1,kR1,klow,γR,klowγRth,(14d),(14e),\displaystyle R_{1,k}\leq R_{1,k}^{\rm low},~{}\gamma_{{\rm R},k}^{\rm low}\geq\gamma_{\rm R}^{\rm th},~{}\eqref{eq_op_AO_BS_2_cons_supp},\eqref{eq_op_AO_BS_2_cons8}, (17b)
k=1,2,,K.\displaystyle\quad\quad\forall k=1,2,\ldots,K.

Note that the solution set of (17) is a subset of that of the original problem in (14), as lower bounds are used as substitutes in the constraints (14b) and (14c).

III-A3 Alternating Optimization

The interleaving presence of BS beamforming matrices 𝐆k{\mathbf{G}}_{k} and 𝐆j{\mathbf{G}}_{j} still render the constraint (13) in (14d) nonconvex. AO is adopted within the subproblem to solve 𝐆k{\mathbf{G}}_{k}, k=1,,Kk=1,\ldots,K, iteratively. Specifically, in the kk^{\prime}-th iteration, only the kk^{\prime}-th beamforming matrix 𝐆k{\mathbf{G}}_{k^{\prime}} is solved while keeping other 𝐆j{\mathbf{G}}_{j}, jkj\neq k^{\prime} as constants. As such, constraint (13) in (14d) becomes convex.

III-A4 Semidefinite Relaxation

Finally, we relax the rank-one constraint in (14e) which, after combining with the Taylor approximation and alternating optimization, transforms the entire optimization to an SDP problem that can be solved by standard convex optimization software such as CVX [16]. In general, the optimal solutions for 𝐆k{\mathbf{G}}_{k}’s are not necessarily of rank-one. One typical approach to obtaining rank-one solutions is by using the randomization procedure [17] based on the eigen-decomposition of the optimal 𝐆k{\mathbf{G}}_{k}.

III-B Relay Beamforming Optimization

Given fixed {𝐠k}\{{\mathbf{g}}_{k}\} (obtained from the steps in Sec. III-A) and 𝚯\mathbf{\Theta}, the problem of solving the relay beamforming {𝐟k}\{\mathbf{f}_{k}\} in (8) becomes

max{𝐟k}\displaystyle\max_{\{\mathbf{f}_{k}\}} k=1Klog2(C2,k+γkII)\displaystyle\sum_{k=1}^{K}{\log_{2}\left(C_{2,k}+\gamma_{k}^{\rm II}\right)} (18a)
s.t. PRtotalPRmax,\displaystyle P_{\rm R}^{\rm total}\leq P_{\rm R}^{\max}, (18b)

where C2,k=1+γkI,k=1,2,,KC_{2,k}=1+\gamma_{k}^{\rm I},k=1,2,\ldots,K, are kept as constants. The subproblem for finding the relay beamforming vector 𝐟k\mathbf{f}_{k} in (18) is nonconvex. Following similar steps developed in Sec. III-A, we elaborate on how to convexify (18) below.

Let 𝐅k=𝐟k𝐟kH{\mathbf{F}}_{k}={\mathbf{f}}_{k}{\mathbf{f}}_{k}^{\rm H}. Define the slack variables {𝒮2,k}\{{\mathcal{S}}_{2,k}\} and {2,k}\{{\mathcal{I}}_{2,k}\} that satisfy

1𝒮2,k\displaystyle\frac{1}{{\mathcal{S}}_{2,k}} |𝐡R,k𝐟k|2tr(𝐅k𝐡R,k′′),\displaystyle\triangleq{\left|{\mathbf{h}}^{\prime}_{{\rm R},k}{\mathbf{f}}_{k}\right|}^{2}\leq{\rm tr}\left({\mathbf{F}}_{k}{\mathbf{h}}^{\prime\prime}_{{\rm R},k}\right), (19)
2,k\displaystyle{\mathcal{I}}_{2,k} jk|𝐡R,k𝐟j|2+σk2jktr(𝐅j𝐡R,k′′)+σk2,\displaystyle\triangleq\sum_{j\neq k}{\left|{\mathbf{h}}^{\prime}_{{\rm R},k}{\mathbf{f}}_{j}\right|}^{2}+\sigma_{k}^{2}\geq\sum_{j\neq k}{\rm tr}\left({\mathbf{F}}_{j}{\mathbf{h}}^{\prime\prime}_{{\rm R},k}\right)+\sigma_{k}^{2}, (20)

where 𝐡R,k′′𝐡R,kH𝐡R,k{\mathbf{h}}^{\prime\prime}_{{\rm R},k}\triangleq{{\mathbf{h}}^{\prime}_{{\rm R},k}}^{\rm H}{\mathbf{h}}^{\prime}_{{\rm R},k}. With the above slack variables, the subproblem (18) can be equivalently rewritten as

max\displaystyle\max k=1KR2,k\displaystyle\sum_{k=1}^{K}{R_{2,k}} (21a)
variables: {𝐅k},{R2,k},{𝒮2,k},{2,k}\displaystyle\{\mathbf{F}_{k}\},\{R_{2,k}\},\{{\mathcal{S}}_{2,k}\},\{{\mathcal{I}}_{2,k}\}
s.t. R2,klog2(C2,k+1𝒮2,k2,k)u2(𝐳),\displaystyle R_{2,k}\leq\log_{2}\big{(}C_{2,k}+\frac{1}{{\mathcal{S}}_{2,k}{\mathcal{I}}_{2,k}}\big{)}\triangleq u_{2}({\bf z}), (21b)
(18b),(19),(20),𝐅k0,rank(𝐅k)=1,\displaystyle\eqref{eq_op_AO_Relay_cons1},\eqref{S_2},\eqref{I_2},~{}{\mathbf{F}}_{k}\succeq 0,~{}\text{rank}({\mathbf{F}}_{k})=1, (21c)
k=1,2,,K,\displaystyle\quad\quad\forall k=1,2,\ldots,K,

where u2(𝐳)u_{2}(\bf z) is for notational convenience. Similarly, we apply Taylor approximation on u2(𝐳)u_{2}(\bf z) and obtain a lower bound R2,klowR_{2,k}^{\rm low}, which has closed-form expression from u2(𝐳loc)\nabla u_{2}({\bf z}^{\rm loc}). Then, (21) can be converted to

max\displaystyle\max k=1KR2,k\displaystyle\sum_{k=1}^{K}{R_{2,k}} (22a)
variables: {𝐅k},{R2,k},{𝒮2,k},{2,k}\displaystyle\{\mathbf{F}_{k}\},\{R_{2,k}\},\{{\mathcal{S}}_{2,k}\},\{{\mathcal{I}}_{2,k}\}
s.t. R2,kR2,klow,(21c),\displaystyle R_{2,k}\leq R_{2,k}^{\rm low},~{}~{}\eqref{eq_op_AO_Relay_2_cons_supp2}, (22b)
k=1,,K.\displaystyle\forall k=1,\ldots,K.

The solution set of (22) is a subset of the solution set of (21), since the lower bound R2,klowR_{2,k}^{\rm low} is used in the constraint (21b). By relaxing the rank-one constraint in (21c), we can solve the resulting SDP problem with CVX. Finally, as in the case in Sec. III-A, the randomization procedure can be employed to obtain rank-one solutions for {𝐟k}\{{\mathbf{f}}_{k}\}, k=1,,Kk=1,\ldots,K.

III-C IRS Beamforming Optimization

Given fixed BS beamforming {𝐠k}\{{\mathbf{g}}_{k}\} and relay beamforming {𝐟k}\{{\mathbf{f}}_{k}\} (respectively obtained from the steps in Sec. III-A and Sec. III-B), the problem of solving the IRS beamforming matrix 𝚯\boldsymbol{\Theta} (or equivalently its vector form 𝜽\boldsymbol{\theta}) in (8) becomes

max𝚯\displaystyle\max_{\mathbf{\Theta}} k=1Klog2(1+γk)\displaystyle\sum_{k=1}^{K}{\log_{2}\left(1+\gamma_{k}\right)} (23a)
s.t. |θn|1,n=1,,N,\displaystyle{\left|\theta_{n}\right|}\leq 1,\forall n=1,\ldots,N, (23b)
γR,kγRth,k=1,,K.\displaystyle\gamma_{{\rm R},k}\geq\gamma_{\rm R}^{\rm th},\forall k=1,\ldots,K. (23c)

We adopt similar steps as in Secs. III-A and III-B to solve (23). To facilitate finding the optimal IRS beamforming matrix 𝚯\boldsymbol{\Theta}, we re-arrange the order of 𝚯\boldsymbol{\Theta} in (1) and in (5) respectively to ykI=ϕH𝐇B,I,k𝐱+wkI{y}_{k}^{\rm I}={\boldsymbol{\phi}}^{\rm H}{\mathbf{H}}_{{\rm B},{\rm I},k}{\mathbf{x}}+w_{k}^{\rm I} and ykII=ϕH𝐇R,I,k𝐱R+wkII,y_{k}^{\rm II}={\boldsymbol{\phi}}^{\rm H}{\mathbf{H}}_{{\rm R},{\rm I},k}{\mathbf{x}}_{\rm R}+w_{k}^{\rm II}, where ϕ=[𝜽1]H{\boldsymbol{\phi}}={\begin{bmatrix}{\boldsymbol{\theta}}&1\end{bmatrix}}^{\rm H}, 𝐇B,I,k=[diag(𝐡IRS,k)𝐇BS,IRS𝐡BS,k]{\mathbf{H}}_{{\rm B},{\rm I},k}=\begin{bmatrix}{\rm diag}({\mathbf{h}}_{{\rm IRS},k}){\mathbf{H}}_{{\rm BS},{\rm IRS}}\\ {\mathbf{h}}_{{\rm BS},k}\end{bmatrix}, and 𝐇R,I,k=[diag(𝐡IRS,k)𝐇R,IRS𝐡R,k]{\mathbf{H}}_{{\rm R},{\rm I},k}=\begin{bmatrix}{\rm diag}({\mathbf{h}}_{{\rm IRS},k}){\mathbf{H}}_{{\rm R},{\rm IRS}}\\ {\mathbf{h}}_{{\rm R},k}\end{bmatrix}. With the reordering, the slack variables {𝒮1,k}\{{\mathcal{S}}_{1,k}\}, {1,k}\{{\mathcal{I}}_{1,k}\}, {𝒮2,k}\{{\mathcal{S}}_{2,k}\}, and {2,k}\{{\mathcal{I}}_{2,k}\} respectively in (10), (11), (19), and (20) can be rewritten as

1𝒮1,k\displaystyle\frac{1}{{\mathcal{S}}_{1,k}} =|ϕH𝐇B,I,k𝐠k|2tr(𝚽𝐇B,I,k𝐠k𝐠kH𝐇B,I,kH),\displaystyle={\left|{\boldsymbol{\phi}}^{\rm H}{\mathbf{H}}_{{\rm B},{\rm I},k}{\mathbf{g}}_{k}\right|}^{2}\leq{\rm tr}\left(\mathbf{\Phi}{\mathbf{H}}_{{\rm B},{\rm I},k}{\mathbf{g}}_{k}{\mathbf{g}}_{k}^{\rm H}{\mathbf{H}}_{{\rm B},{\rm I},k}^{\rm H}\right), (24)
1,k\displaystyle{\mathcal{I}}_{1,k} jktr(𝚽𝐇B,I,k𝐠j𝐠jH𝐇B,I,kH)+σk2,\displaystyle\geq\sum_{j\neq k}{\rm tr}\left(\mathbf{\Phi}{\mathbf{H}}_{{\rm B},{\rm I},k}{\mathbf{g}}_{j}{\mathbf{g}}_{j}^{\rm H}{\mathbf{H}}_{{\rm B},{\rm I},k}^{\rm H}\right)+\sigma_{k}^{2}, (25)
1𝒮2,k\displaystyle\frac{1}{{\mathcal{S}}_{2,k}} =|ϕH𝐇R,I,k𝐟k|2tr(𝚽𝐇R,I,k𝐟k𝐟kH𝐇R,I,kH),\displaystyle={\left|{\boldsymbol{\phi}}^{\rm H}{\mathbf{H}}_{{\rm R},{\rm I},k}{\mathbf{f}}_{k}\right|}^{2}\leq{\rm tr}(\mathbf{\Phi}{\mathbf{H}}_{{\rm R},{\rm I},k}{\mathbf{f}}_{k}{\mathbf{f}}_{k}^{\rm H}{\mathbf{H}}_{{\rm R},{\rm I},k}^{\rm H}), (26)
2,k\displaystyle{\mathcal{I}}_{2,k} jktr(𝚽𝐇R,I,k𝐟j𝐟jH𝐇R,I,kH)+σk2,\displaystyle\geq\sum_{j\neq k}{\rm tr}\left(\mathbf{\Phi}{\mathbf{H}}_{{\rm R},{\rm I},k}{\mathbf{f}}_{j}{\mathbf{f}}_{j}^{\rm H}{\mathbf{H}}_{{\rm R},{\rm I},k}^{\rm H}\right)+\sigma_{k}^{2}, (27)

where 𝚽ϕϕH\mathbf{\Phi}\triangleq{\boldsymbol{\phi}}{\boldsymbol{\phi}}^{\rm H}. Similarly, we can re-arrange the order of 𝚯\boldsymbol{\Theta} in (3), by which the slack variables {𝒮R,k}\{{\mathcal{S}}_{{\rm R},k}\} and {R,k}\{{\mathcal{I}}_{{\rm R},k}\} in (12) and (13) can be rewritten in terms of 𝚽\mathbf{\Phi}.

With the above slack variables, we have the following equivalent problem

max\displaystyle\max k=1KR3,k\displaystyle\sum_{k=1}^{K}{R_{3,k}} (28a)
variables: 𝚽,{R3,k,𝒮1,k,1,k,𝒮2,k,2,k,𝒮R,k,R,k}\displaystyle\mathbf{\Phi},\{R_{3,k},{\mathcal{S}}_{1,k},{\mathcal{I}}_{1,k},{\mathcal{S}}_{2,k},{\mathcal{I}}_{2,k},{\mathcal{S}}_{{\rm R},k},{\mathcal{I}}_{{\rm R},k}\}
s.t. R3,klog2(1+1𝒮1,k1,k+1𝒮2,k2,k)\displaystyle R_{3,k}\leq\log_{2}\left(1+\frac{1}{{\mathcal{S}}_{1,k}{\mathcal{I}}_{1,k}}+\frac{1}{{\mathcal{S}}_{2,k}{\mathcal{I}}_{2,k}}\right)
u3(𝐳),\displaystyle\quad\quad\triangleq u_{3}({\bf z}), (28b)
v3(𝐳R)1𝒮R,kR,kγRth,\displaystyle v_{3}({\bf z}_{\rm R})\triangleq\frac{1}{{\mathcal{S}}_{{\rm R},k}{\mathcal{I}}_{{\rm R},k}}\geq\gamma_{\rm R}^{\rm th}, (28c)
(23b),(12),(13),(24)(27),\displaystyle\eqref{eq_op_AO_IRS_cons1},\eqref{S_R},\eqref{I_R},\eqref{S_1_prime}-\eqref{I_2_prime}, (28d)
𝚽0,rank(𝚽)=1,\displaystyle\mathbf{\Phi}\succeq 0,~{}~{}\text{rank}\left(\mathbf{\Phi}\right)=1, (28e)
k=1,,K,\displaystyle\quad\quad\forall k=1,\ldots,K,

where u3(𝐳)u_{3}({\bf z}) and v3(𝐳R)v_{3}({\bf z}_{\rm R}) respectively defined in (28b) and (28c) are for notational convenience. Next, using the first-order Taylor approximation, as in the previous sections, lower bounds of u3(𝐳)u_{3}({\bf z}) and v3(𝐳R)v_{3}({\bf z}_{\rm R}) can be obtained as R3,klowR_{3,k}^{\rm low} and γR,klow\gamma_{{\rm R},k}^{\rm low}, which can be used to convexify the two constraints (28b) and (28c). Then, (28) can be rewritten as

max\displaystyle\max k=1KR3,k\displaystyle\sum_{k=1}^{K}{R_{3,k}} (29a)
variables: 𝚽,{R3,k,𝒮1,k,1,k,𝒮2,k,2,k,𝒮R,k,R,k}\displaystyle\mathbf{\Phi},\{R_{3,k},{\mathcal{S}}_{1,k},{\mathcal{I}}_{1,k},{\mathcal{S}}_{2,k},{\mathcal{I}}_{2,k},{\mathcal{S}}_{{\rm R},k},{\mathcal{I}}_{{\rm R},k}\}
s.t. R3,kR3,klow,γR,klowγRth,(28d),(28e),\displaystyle R_{3,k}\leq R_{3,k}^{\rm low},~{}~{}\gamma_{{\rm R},k}^{\rm low}\geq\gamma_{\rm R}^{\rm th},\eqref{eq_op_AO_IRS_2_cons_supp},\eqref{eq_op_AO_IRS_2_cons_rank1}, (29b)
k=1,2,,K.\displaystyle\quad\quad\forall k=1,2,\ldots,K.

Relaxing the rank-one constraint (28e) in (29b) converts the problem in (29) to an SDP, which can then be solved using CVX. Finally, Gaussian randomization procedure can be employed to obtain a rank-one solution.

IV Simulation Results and Discussion

IV-A Simulation Settings

We simulate the topology shown in Fig. 1 with the BS, IRS, and relay located at coordinates (0,0)(0,0), (100,50)(100,50), and (100,50)(100,-50), respectively, and the KK users randomly distributed within a circle centered at (0,200)(0,200) with a radius of 1010. The units of locations and radius are all meters. The small-scale fading of all channels follows 𝒞𝒩(0,1)\mathcal{CN}(0,1). The parameters for large-scale fading of channels κ(d/d0)ϱ\kappa(d/d_{0})^{-\varrho} are set as follows: d0=1d_{0}=1 m; κ=104\kappa=10^{-4} for 𝐇BS,R{\mathbf{H}}_{{\rm BS},{\rm R}}, 𝐡BS,k{\mathbf{h}}_{{\rm BS},k}, and 𝐡R,k{\mathbf{h}}_{{\rm R},k}, and κ=100.5\kappa=10^{-0.5} for 𝐇BS,IRS{\mathbf{H}}_{{\rm BS},{\rm IRS}}, 𝐇R,IRS{\mathbf{H}}_{{\rm R},{\rm IRS}}, and 𝐡IRS,k{\mathbf{h}}_{{\rm IRS},k}; and ϱ=2\varrho=2 for IRS-aided links and relay-aided links (free space), and ϱ=3.5\varrho=3.5 for the direct link (severe path loss). The power constraints at the BS and relay are PBSmax=10P_{\rm BS}^{\rm max}=10 mW and PRmax=10P_{\rm R}^{\rm max}=10 mW, respectively. The proposed coexistence and co-design scheme is compared with the following benchmarks: 1) Relay only: there is no IRS; only the relay assists transmission with BS and relay beamforming optimized; 2) Random: IRS beamforming adopts random phase shifts and fixed amplitudes of one, with BS and relay beamforming optimized; and 3) Independent: IRS assists transmission in the first phase but not in the second phase (turned off), with BS, relay, and IRS beamforming optimized in such case. Note that it is termed ‘Independent’ since there is no interaction between IRS and relay in assisting BS transmission.

IV-B Results and Discussion

Refer to caption
Refer to caption
Refer to caption
Figure 2: (a)–(c) Sum-rate vs. the number of IRS reflecting elements, relay antennas, and BS antennas, respectively.

Fig. 2 compares the sum-rate performance vs. the number of IRS reflecting elements NN, where we set M=8M=8, L=4L=4, and K=4K=4. As can be seen, the sum-rate of all schemes except the Relay only scheme increases as NN increases. The proposed scheme outperforms all benchmarks since it fully exploits the coexistence system with optimized beamforming and transmission mechanism. The Independent scheme exhibits performance loss in comparison to the proposed scheme since IRS is turned off in the second phase and thus relaying in the second phase does not acquire performance gain from IRS-enhanced links and IRS beamforming. This suggests that the interaction between IRS and DF relay benefits the system sum-rate. Comparing the Independent and Random schemes, while the Independent scheme only leverages IRS in the first phase, it still outperforms the Random scheme with IRS operating in both phases. This is because, while the Independent scheme achieves a lower SINR in the second phase as compared to the Random scheme, it provides a much higher SINR in the first phase due to judicious IRS beamforming, resulting in an overall higher sum-rate. The Random scheme outperforms the Relay only scheme since IRS, even with random phase shifts, provides additional paths for transmission.

Fig. 2 compares the sum-rate performance vs. the number of relay antennas LL, where we set M=8M=8, N=30N=30, and K=4K=4. The sum-rate of all schemes increases with LL due to a higher degree of freedom in the second phase. The proposed scheme achieves the best sum-rate performance in all antenna configurations, with diminishing gains as LL increases. This is because the existence and optimization of IRS with N=30N=30 reflecting elements dominates the change in LL in terms of the system capacity in the second phase. As a result, increasing the number of relay antennas brings relatively small merits to the proposed scheme. The Independent and Random schemes exhibit a crossing point; specifically, the Random scheme outperforms the Independent scheme in the larger LL regime. The reason is that the DF relay with more antennas can better adjust the relay beamforming vectors {𝐟k}\{{\mathbf{f}}_{k}\} in (6) for the combined IRS-assisted and direct channels from the relay to end users in the Random scheme. In contrast, since the IRS is turned off in the second phase, a relatively small gain is created for the Independent scheme as LL increases. More specifically, the higher SINR in the second phase outweighs the lower SINR in the first phase for the Random scheme, as compared to the Independent scheme.

Fig. 2 plots the sum-rate performance vs. the number of BS antennas MM, where we set L=4L=4, N=30N=30, and K=4K=4. The performance of all schemes improves as MM increases. Increasing MM however creates an incremental gain for the Relay only scheme due to the weak direct link from the BS to the end users. Other schemes, in contrast, are supported by the combined IRS-assisted and direct links in the first phase instead of only the direct link, and therefore observe larger gains as MM increases. The Independent scheme outperforms the Random scheme because the Independent scheme is enhanced by IRS beamforming in the first phase. Without optimized IRS phase shifts, the Random scheme suffers from performance loss. Especially, in the small MM region, the Random scheme achieves only a small performance gain as compared to the Relay only scheme. This suggests that the coexistence of an IRS and a relay does not always significantly benefit communications unless a proper co-design is performed.

V Conclusion

We have considered a multiuser MISO system in which an IRS and a DF relay coexist and assist downlink transmission simultaneously. We investigated a co-design problem of BS beamforming, relay beamforming, and IRS beamforming for sum-rate maximization. To tackle the complex nonconvex co-design problem, we proposed an algorithm based on alternating optimization and semidefinite relaxation. Simulation results and discussion on our proposed scheme and other benchmarks were presented. It was shown that our proposed algorithm significantly increases the sum-rate of end users.

References

  • [1] 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.
  • [2] M. Di Renzo, A. Zappone, M. Debbah, M.-S. Alouini, C. Yuen, J. de Rosny, and S. Tretyakov, “Smart radio environments empowered by reconfigurable intelligent surfaces: How it works, state of research, and the road ahead,” IEEE J. Sel. Areas Commun., vol. 38, no. 11, pp. 2450–2525, Nov. 2020.
  • [3] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network: Joint active and passive beamforming design,” in Proc. IEEE GLOBECOM, 2018, pp. 1–6.
  • [4] C. Huang, A. Zappone, M. Debbah, and C. Yuen, “Achievable rate maximization by passive intelligent mirrors,” in Proc. IEEE ICASSP, 2018, pp. 3714–3718.
  • [5] C. Huang, R. Mo, and C. Yuen, “Reconfigurable intelligent surface assisted multiuser MISO systems exploiting deep reinforcement learning,” IEEE J. Sel. Areas Commun., vol. 38, no. 8, pp. 1839–1850, Aug. 2020.
  • [6] H. Li, R. Liu, M. Liy, Q. Liu, and X. Li, “IRS-enhanced wideband MU-MISO-OFDM communication systems,” in Proc. IEEE WCNC, 2020, pp. 1–6.
  • [7] X. Mu, Y. Liu, L. Guo, J. Lin, and N. Al-Dhahir, “Exploiting intelligent reflecting surfaces in NOMA networks: Joint beamforming optimization,” IEEE Trans. Wireless Commun., vol. 19, no. 10, pp. 6884–6898, Oct. 2020.
  • [8] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,” IEEE Trans. Wireless Commun., vol. 18, no. 11, pp. 5394–5409, Nov. 2019.
  • [9] B. Zheng, Q. Wu, and R. Zhang, “Intelligent reflecting surface-assisted multiple access with user pairing: NOMA or OMA?” IEEE Commun. Lett., vol. 24, no. 4, pp. 753–757, Apr. 2020.
  • [10] E. Björnson, Ö. Özdogan, and E. G. Larsson, “Intelligent reflecting surface versus decode-and-forward: How large surfaces are needed to beat relaying?” IEEE Wireless Commun. Lett., vol. 9, no. 2, pp. 244–248, Feb. 2020.
  • [11] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Trans. Wireless Commun., vol. 18, no. 8, pp. 4157–4170, Aug. 2019.
  • [12] Q.-U.-A. Nadeem, A. Kammoun, A. Chaaban, M. Debbah, and M.-S. Alouini, “Asymptotic max-min SINR analysis of reconfigurable intelligent surface assisted MISO systems,” IEEE Trans. Wireless Commun., vol. 19, no. 12, pp. 7748–7764, Dec. 2020.
  • [13] M. Di Renzo, K. Ntontin, J. Song, F. H. Danufane, X. Qian, F. Lazarakis, J. De Rosny, D.-T. Phan-Huy, O. Simeone, R. Zhang, M. Debbah, G. Lerosey, M. Fink, S. Tretyakov, and S. Shamai, “Reconfigurable intelligent surfaces vs. relaying: Differences, similarities, and performance comparison,” IEEE Open J. Commun. Soc., vol. 1, pp. 798–807, 2020.
  • [14] I. Yildirim, F. Kilinc, E. Basar, and G. C. Alexandropoulos, “Hybrid RIS-empowered reflection and decode-and-forward relaying for coverage extension,” IEEE Commun. Lett., vol. 25, no. 5, pp. 1692–1696, May 2021.
  • [15] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.   Cambridge, U.K.: Cambridge Univ. Press, 2005.
  • [16] M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” http://cvxr.com/cvx, Mar. 2014.
  • [17] Y. Huang and D. P. Palomar, “Randomized algorithms for optimal solutions of double-sided QCQP with applications in signal processing,” IEEE Trans. Signal Process., vol. 62, no. 5, pp. 1093–1108, Mar. 2014.