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

Intelligent Reflecting Surface-Assisted Multiple Access with User Pairing: NOMA or OMA?

Beixiong Zheng, , Qingqing Wu, , and Rui Zhang The authors are with the Department of Electrical and Computer Engineering, National University of Singapore, email: {elezbe, elewqq, elezhang}@nus.edu.sg.
Abstract

The integration of intelligent reflecting surface (IRS) to multiple access networks is a cost-effective solution for boosting spectrum/energy efficiency and enlarging network coverage/connections. However, due to the new capability of IRS in reconfiguring the wireless propagation channels, it is fundamentally unknown which multiple access scheme is superior in the IRS-assisted wireless network. In this letter, we pursue a theoretical performance comparison between non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) in the IRS-assisted downlink communication, for which the transmit power minimization problems are formulated under the discrete unit-modulus reflection constraint on each IRS element. We analyze the minimum transmit powers required by different multiple access schemes and compare them numerically, which turn out to not fully comply with the stereotyped superiority of NOMA over OMA in conventional systems without IRS. Moreover, to avoid the exponential complexity of the brute-force search for the optimal discrete IRS phase shifts, we propose a low-complexity solution to achieve near-optimal performance.

Index Terms:
Intelligent reflecting surface (IRS), non-orthogonal multiple access (NOMA), frequency division multiple access (FDMA), time division multiple access (TDMA), user pairing, power minimization, discrete phase shifts.

I Introduction

Intelligent reflecting surface (IRS) has recently attracted growing attention and is envisioned as an innovative technology for the beyond fifth-generation (B5G) communication system, due to its potential of achieving significant improvement in communication coverage, throughput, and energy efficiency [1, 2, 3]. Specifically, IRS is a planar meta-surface composed of a large number of reconfigurable passive elements, which are attached with a smart controller to enable dynamic adjustment on the signal reflections for different purposes, such as signal power enhancement and interference suppression. In particular, compared to conventional techniques such as active relaying/beamforming, IRS not only reflects signals in a full-duplex and noise-free manner without incurring self-interference, but also greatly saves energy consumption and hardware/deployment cost by using lightweight passive components only [1, 3].

On the other hand, non-orthogonal multiple access (NOMA) has also received significant attention and shown superiority over orthogonal multiple access (OMA) in conventional wireless systems without IRS, for improving the spectral efficiency, balancing user fairness, and enlarging network connections. In the downlink NOMA, the user of stronger channel with the base station (BS) or access point (AP) employs the successive interference cancellation (SIC) technique to cancel the co-channel interference from the users of weaker channels, prior to decoding its own message. As a result, the decoding order depends on user channel power gains, which are determined by the propagation environments and user locations. In contrast, since IRS is capable of reconfiguring user channels by controlling the reflected signal amplitudes and/or phase shifts, the user decoding order of NOMA can be permuted by adjusting the IRS reflection to achieve more flexible performance trade-offs among the users. Nevertheless, for IRS to be integrated into the future wireless network, it still remains unknown whether NOMA is always superior to OMA as in conventional systems without IRS. Although some relevant works on the application of IRS to NOMA have recently appeared [4, 5, 6, 7], the theoretical performance comparison between NOMA and OMA for IRS-assisted wireless communications is not well understood yet, to the best of our knowledge.

Refer to caption
Figure 1: An illustration of OMA and NOMA in the IRS-assisted system.

To address the above issue, in this letter we investigate the theoretical performance comparison between NOMA and OMA in an IRS-assisted downlink communication system, where two types of OMA schemes, i.e., frequency division multiple access (FDMA) and time division multiple access (TDMA), are considered, as shown in Fig. 1. The problems for minimizing the transmit power at the AP are formulated for both OMA and NOMA, subject to the discrete unit-modulus reflection constraint at the IRS and the users’ target rates. By analyzing the relationship of minimum transmit powers required by different multiple access schemes, we unveil that the minimum transmit power of FDMA is always no lower than that of the other two counterparts (TDMA and NOMA), while the minimum power comparison between NOMA and TDMA depends on the target rates and locations of the users. Specifically, TDMA requires lower transmit power than NOMA when two near-IRS users are paired and have symmetric rates, whereas the relationship is reversed otherwise. Moreover, to avoid the exponentially high complexity of the brute-force search for the optimal discrete IRS phase shifts, we propose an efficient low-complexity algorithm based on the linear approximation initialization to effectively balance the user channel power gains for minimizing the transmit power, followed by the alternating optimization to achieve near-optimal performance.

II System Model and Problem Formulation

As depicted in Fig. 1, we consider an IRS-assisted downlink communication system, where an IRS is deployed to assist in the transmission from a single-antenna AP to multiple single-antenna users. Similar to [8, 9], an IRS composed of NN reflecting elements is divided into MM sub-surfaces, each of which consists of N¯=N/M{\bar{N}}=N/M adjacent elements to share a common reflection coefficient for reducing the implementation complexity. Moreover, the passive IRS is connected to a smart controller that enables dynamic adjustment on the reflections of IRS elements and also plays the role of exchanging information between the IRS and AP via a separate wireless link [1, 3]. For ease of exposition, we focus on the case with any two users sharing two given adjacent time-frequency resource blocks (RBs) in practice, where the channels are assumed to be frequency-flat fading and constant over the two adjacent time-frequency RBs (see Fig. 1). It is worth pointing out that by adopting the concept of user pairing, the two-user case can be extended to the general multi-user case. Without loss of generality, it is assumed that user 1 is located in the vicinity of the IRS while user 2 can be arbitrarily located within the coverage of the AP (i.e., in or out of the IRS’s coverage). As shown in Fig. 1, we consider two types of OMA schemes, i.e., FDMA and TDMA, which serve two users over two adjacent RBs separated in the frequency and time domains, respectively; while the NOMA scheme serves two users simultaneously over the two adjacent RBs either in the frequency- or time-domain, for fair comparison with OMA.

To characterize the optimal performance of different multiple access schemes in the IRS-assisted system, we assume perfect channel state information (CSI) available at the AP. Note that the channel estimation methods proposed in [1, 8] can be applied to acquire the CSI of the two users independently. The baseband equivalent channels from the AP to IRS, from the IRS to user kk, and from the AP to user kk are denoted by 𝒉rM×1{\bm{h}}_{r}\in{\mathbb{C}^{M\times 1}}, 𝒈kH1×M{\bm{g}}^{H}_{k}\in{\mathbb{C}^{1\times M}}, and hd,kh_{d,k}\in{\mathbb{C}}, respectively, with k{1,2}k\in\{1,2\}. Let 𝜽[θ1,θ2,,θM]T=[β1ejϕ1,β2ejϕ2,,βMejϕM]T{\bm{\theta}}\triangleq[{\theta_{1}},{\theta_{2}},\ldots,{\theta_{M}}]^{T}=[\beta_{1}e^{j\phi_{1}},\beta_{2}e^{j\phi_{2}},\ldots,\beta_{M}e^{j\phi_{M}}]^{T} denote the equivalent reflection coefficients of the IRS, where ϕm[0,2π)\phi_{m}\in[0,2\pi) and βm[0,1]\beta_{m}\in[0,1] are the phase shift and reflection amplitude of the mm-th sub-surface, respectively. To maximize the signal power reflected by the IRS and reduce the hardware cost, we set βm=1,m=1,,M\beta_{m}=1,\forall m=1,\ldots,M and consider the practical discrete unit-modulus constraint ={ejϕ|ϕ{0,Δϕ,,(L1)Δϕ}}{\cal F}=\left\{e^{j\phi}\big{|}\phi\in\{0,\Delta\phi,\ldots,(L-1)\Delta\phi\}\right\} for each phase shift coefficient θm\theta_{m}, where Δϕ=2π/L\Delta\phi=2\pi/L with LL denoting the number of discrete phase-shift levels [10].

II-A NOMA Transmission Scheme

As shown in Fig. 1, the AP simultaneously transmits the signals of two users by adopting the superposition coding over two frequency/time domain adjacent RBs, which is given by

x=P1s1+P2s2\displaystyle x=\sqrt{P_{1}}{s_{1}}+\sqrt{P_{2}}{s_{2}} (1)

where PkP_{k} denotes the power allocated to user kk with k{1,2}k\in\{1,2\} and sks_{k} denotes the transmitted data symbol for user kk, which is assumed to be a circularly symmetric complex Gaussian (CSCG) random variable with zero mean and unit variance. Accordingly, the signal received at user kk is given by

yk=(𝒈kH𝚯𝒉r+hd,k)(P1s1+P2s2)+nk,k{1,2}\displaystyle y_{k}=\left({\bm{g}}^{H}_{k}{\bm{\Theta}}{\bm{h}}_{r}+h_{d,k}\right)\left(\sqrt{P_{1}}{s_{1}}+\sqrt{P_{2}}{s_{2}}\right)+n_{k},k\in\{1,2\} (2)

where nkn_{k} denotes the additive CSCG noise with zero mean and variance σ2\sigma^{2} at user kk and 𝚯=diag(𝜽){\bm{\Theta}}=\text{diag}\left({\bm{\theta}}\right) represents the diagonal phase-shift matrix of the IRS. By denoting 𝒒kH𝒈kHdiag(𝒉r){\bm{q}}^{H}_{k}\triangleq{\bm{g}}^{H}_{k}\text{diag}\left({\bm{h}}_{r}\right) as the cascaded AP-IRS-user channel before the IRS phase-shift adjustment, (2) can be rewritten as

yk=(𝒒kH𝜽+hd,k)(P1s1+P2s2)+nk,k{1,2}.\displaystyle y_{k}=\left({\bm{q}}^{H}_{k}{\bm{\theta}}+h_{d,k}\right)\left(\sqrt{P_{1}}{s_{1}}+\sqrt{P_{2}}{s_{2}}\right)+n_{k},k\in\{1,2\}. (3)

Let λ1(𝜽)=|𝒒1H𝜽+hd,1|2\lambda_{1}({\bm{\theta}})=|{\bm{q}}^{H}_{1}{\bm{\theta}}+h_{d,1}|^{2} and λ2(𝜽)=|𝒒2H𝜽+hd,2|2\lambda_{2}({\bm{\theta}})=|{\bm{q}}^{H}_{2}{\bm{\theta}}+h_{d,2}|^{2} denote the channel power gains of users 1 and 2, respectively. Note that since channel power gains λ1(𝜽)\lambda_{1}({\bm{\theta}}) and λ2(𝜽)\lambda_{2}({\bm{\theta}}) are two discrete functions which vary with the IRS phase-shift vector 𝜽{\bm{\theta}}, we may have 2!=22!=2 permutations for the user decoding order. Given the target rates of the two users, we aim to minimize the total transmit power at the AP by optimizing the IRS phase-shift vector 𝜽{\bm{\theta}}, subject to the discrete unit-modulus constraints of IRS elements. The corresponding optimization problem can be decomposed into two sub-problems associated with two different decoding orders as follows.

(N1):PN1\displaystyle\text{(N1):}~{}P_{N1}\triangleq min𝜽,P1,P2\displaystyle\underset{{\bm{\theta}},P_{1},P_{2}}{\text{min}} P1+P2\displaystyle P_{1}+P_{2} (4)
  s.t. log2(1+P1λ1(𝜽)σ2)γ1\displaystyle\log_{2}\left(1+\frac{P_{1}\lambda_{1}({\bm{\theta}})}{\sigma^{2}}\right)\geq\gamma_{1} (5)
log2(1+P2λ2(𝜽)σ2+P1λ2(𝜽))γ2\displaystyle\log_{2}\left(1+\frac{P_{2}\lambda_{2}({\bm{\theta}})}{\sigma^{2}+P_{1}\lambda_{2}({\bm{\theta}})}\right)\geq\gamma_{2} (6)
θm,m=1,,M\displaystyle\theta_{m}\in{\cal F},\forall m=1,\ldots,M (7)
(N2):PN2\displaystyle\text{(N2):}~{}P_{N2}\triangleq min𝜽,P1,P2\displaystyle\underset{{\bm{\theta}},P_{1},P_{2}}{\text{min}} P1+P2\displaystyle P_{1}+P_{2} (8)
  s.t. log2(1+P1λ1(𝜽)σ2+P2λ1(𝜽))γ1\displaystyle\log_{2}\left(1+\frac{P_{1}\lambda_{1}({\bm{\theta}})}{\sigma^{2}+P_{2}\lambda_{1}({\bm{\theta}})}\right)\geq\gamma_{1} (9)
log2(1+P2λ2(𝜽)σ2)γ2\displaystyle\log_{2}\left(1+\frac{P_{2}\lambda_{2}({\bm{\theta}})}{\sigma^{2}}\right)\geq\gamma_{2} (10)
θm,m=1,,M\displaystyle\theta_{m}\in{\cal F},\forall m=1,\ldots,M (11)

where γ1\gamma_{1} and γ2\gamma_{2} are the target rates of users 1 and 2 in bits per second per Hertz (bps/Hz), respectively. Since the user rates are monotonically increasing with P1P_{1} and P2P_{2}, the inequality rate constraints should be met with equality at the optimal solution. By eliminating the equality constraints, (N1) and (N2) can be simplified as

(N1.1):PN1\displaystyle\text{(N1.1):}~{}P_{N1}\triangleq min𝜽\displaystyle\underset{{\bm{\theta}}}{\text{min}} (2γ11)2γ2σ2λ1(𝜽)+(2γ21)σ2λ2(𝜽)\displaystyle\frac{(2^{\gamma_{1}}-1)2^{\gamma_{2}}{\sigma^{2}}}{\lambda_{1}({\bm{\theta}})}+\frac{(2^{\gamma_{2}}-1){\sigma^{2}}}{\lambda_{2}({\bm{\theta}})} (12)
s.t. θm,m=1,,M\displaystyle\theta_{m}\in{\cal F},\forall m=1,\ldots,M (13)
(N2.1):PN2\displaystyle\text{(N2.1):}~{}P_{N2}\triangleq min𝜽\displaystyle\underset{{\bm{\theta}}}{\text{min}} (2γ11)σ2λ1(𝜽)+(2γ21)2γ1σ2λ2(𝜽)\displaystyle\frac{(2^{\gamma_{1}}-1){\sigma^{2}}}{\lambda_{1}({\bm{\theta}})}+\frac{(2^{\gamma_{2}}-1)2^{\gamma_{1}}{\sigma^{2}}}{\lambda_{2}({\bm{\theta}})} (14)
s.t. θm,m=1,,M.\displaystyle\theta_{m}\in{\cal F},\forall m=1,\ldots,M. (15)

Comparing (12) and (14), we have

(2γ11)2γ2σ2λ1(𝜽)+(2γ21)σ2λ2(𝜽)(2γ11)σ2λ1(𝜽)(2γ21)2γ1σ2λ2(𝜽)\displaystyle\frac{(2^{\gamma_{1}}-1)2^{\gamma_{2}}{\sigma^{2}}}{\lambda_{1}({\bm{\theta}})}+\frac{(2^{\gamma_{2}}-1){\sigma^{2}}}{\lambda_{2}({\bm{\theta}})}-\frac{(2^{\gamma_{1}}-1){\sigma^{2}}}{\lambda_{1}({\bm{\theta}})}-\frac{(2^{\gamma_{2}}-1)2^{\gamma_{1}}{\sigma^{2}}}{\lambda_{2}({\bm{\theta}})}
=(2γ11)(2γ21)σ2(1λ1(𝜽)1λ2(𝜽))\displaystyle=(2^{\gamma_{1}}-1)(2^{\gamma_{2}}-1){\sigma^{2}}\left(\frac{1}{\lambda_{1}({\bm{\theta}})}-\frac{1}{\lambda_{2}({\bm{\theta}})}\right) (16)

which is non-positive for λ1(𝜽)λ2(𝜽)\lambda_{1}({\bm{\theta}})\geq\lambda_{2}({\bm{\theta}}) and non-negative for λ2(𝜽)λ1(𝜽)\lambda_{2}({\bm{\theta}})\geq\lambda_{1}({\bm{\theta}}), respectively. Thus, the minimum power required by using NOMA is obtained as

PNmin{PN1,PN2}={PN1,λ1(𝜽N)λ2(𝜽N)PN2,otherwise\displaystyle P_{N}\triangleq\min\{P_{N1},P_{N2}\}=\left\{\begin{gathered}P_{N1},\quad\lambda_{1}({\bm{\theta}}_{N}^{*})\geq\lambda_{2}({\bm{\theta}}_{N}^{*})\hfill\\ P_{N2},\quad{\rm otherwise}\hfill\end{gathered}\right. (19)

with 𝜽N{\bm{\theta}}_{N}^{*} being the optimal phase-shift vector.

II-B OMA Transmission Schemes

II-B1 FDMA

As shown in Fig. 1, the AP communicates with two users simultaneously over two equal frequency-domain adjacent RBs via FDMA. Accordingly, the optimization problem of minimizing the total transmit power at the AP is formulated as

(F1):PF\displaystyle\text{(F1):}~{}P_{F}\triangleq min𝜽,P1,P2\displaystyle\underset{{\bm{\theta}},P_{1},P_{2}}{\text{min}} P1+P2\displaystyle P_{1}+P_{2} (20)
  s.t. 12log2(1+P1λ1(𝜽)12σ2)γ1\displaystyle\frac{1}{2}\log_{2}\left(1+\frac{P_{1}\lambda_{1}({\bm{\theta}})}{\frac{1}{2}\sigma^{2}}\right)\geq\gamma_{1} (21)
12log2(1+P2λ2(𝜽)12σ2)γ2\displaystyle\frac{1}{2}\log_{2}\left(1+\frac{P_{2}\lambda_{2}({\bm{\theta}})}{\frac{1}{2}\sigma^{2}}\right)\geq\gamma_{2} (22)
θm,m=1,,M.\displaystyle\theta_{m}\in{\cal F},\forall m=1,\ldots,M. (23)

Note that the factor 1/21/2 in (21) and (22) is due to the fact that each user is assigned with half of the bandwidth as compared to the case of NOMA. Similar to NOMA, the inequality rate constraints can be replaced with equality constraints and problem (F1) is transformed into

(F1.1):PF\displaystyle\text{(F1.1):}~{}P_{F}\triangleq min𝜽\displaystyle\underset{{\bm{\theta}}}{\text{min}} (22γ11)σ22λ1(𝜽)+(22γ21)σ22λ2(𝜽)\displaystyle\frac{(2^{2\gamma_{1}}-1)\sigma^{2}}{2\lambda_{1}({\bm{\theta}})}+\frac{(2^{2\gamma_{2}}-1)\sigma^{2}}{2\lambda_{2}({\bm{\theta}})} (24)
s.t. θm,m=1,,M.\displaystyle\theta_{m}\in{\cal F},\forall m=1,\ldots,M. (25)

II-B2 TDMA

As shown in Fig. 1, the AP communicates with two users consecutively over two equal time-domain adjacent RBs via TDMA. Different from NOMA and FDMA where the IRS phase-shift vector needs to be set identical for the two users, in the case of TDMA the IRS phase-shift vector can be set different for the two users over different time. This is fundamentally due to the hardware limitation of IRS passive reflection, which can be made time-selective, but not frequency-selective [1]. Thus, the optimization problem of minimizing the total transmit power at the AP in the case of TDMA can be formulated as

(T1):PT\displaystyle\text{(T1):}~{}P_{T}\triangleq min𝜽1,𝜽2,P1,P2\displaystyle\underset{{\bm{\theta}}_{1},{\bm{\theta}}_{2},P_{1},P_{2}}{\text{min}} P1+P2\displaystyle P_{1}+P_{2} (26)
s.t. 12log2(1+2P1λ1(𝜽1)σ2)γ1\displaystyle\frac{1}{2}\log_{2}\left(1+\frac{2P_{1}\lambda_{1}({\bm{\theta}}_{1})}{\sigma^{2}}\right)\geq\gamma_{1} (27)
12log2(1+2P2λ2(𝜽2)σ2)γ2\displaystyle\frac{1}{2}\log_{2}\left(1+\frac{2P_{2}\lambda_{2}({\bm{\theta}}_{2})}{\sigma^{2}}\right)\geq\gamma_{2} (28)
θk,m,m=1,,M,k{1,2}\displaystyle\theta_{k,m}\in{\cal F},\forall m=1,\ldots,M,k\in\{1,2\} (29)

where 𝜽k[θk,1,θk,2,,θk,M]T{\bm{\theta}}_{k}\triangleq[{\theta_{k,1}},{\theta_{k,2}},\ldots,{\theta_{k,M}}]^{T} denotes the phase-shift vector for the kk-th user. Note that the factor 1/21/2 in (27) and (28) is due to the fact that each user is assigned with half of the time as compared to the case of NOMA; as a result, there is an equivalent power gain of 22 for each user shown in (27) and (28) for fair comparison with NOMA. Similar to (F1), (T1) can be transformed into

(T1.1):PT\displaystyle\text{(T1.1):}~{}P_{T}\triangleq min𝜽1(22γ11)σ22λ1(𝜽1)+min𝜽2(22γ21)σ22λ2(𝜽2)\displaystyle\underset{{\bm{\theta}}_{1}}{\text{min}}~{}~{}\frac{(2^{2\gamma_{1}}-1)\sigma^{2}}{2\lambda_{1}({\bm{\theta}}_{1})}+\underset{{\bm{\theta}}_{2}}{\text{min}}~{}~{}\frac{(2^{2\gamma_{2}}-1)\sigma^{2}}{2\lambda_{2}({\bm{\theta}}_{2})} (30)
s.t.θk,m,m=1,,M,k{1,2}.\displaystyle\text{s.t.}~{}~{}\theta_{k,m}\in{\cal F},\forall m=1,\ldots,M,k\in\{1,2\}. (31)

III Performance Comparison and Low-Complexity Solution

III-A Comparison of Minimum Transmit Power

First, we compare the minimum transmit powers required by FDMA and TDMA for the IRS-assisted system, whose relationship is given by the following proposition.

Proposition 1: As the minimum of the sum of two functions is no less than the sum of their individual minimum values, it follows that PFPTP_{F}\geq P_{T} by comparing (24) and (30), and the equality holds if and only if

argmax𝜽Mλ1(𝜽)=argmax𝜽Mλ2(𝜽).\displaystyle\arg\underset{{\bm{\theta}}\in{\cal F}^{M}}{\text{max}}~{}~{}\lambda_{1}({\bm{\theta}})=\arg\underset{{\bm{\theta}}\in{\cal F}^{M}}{\text{max}}~{}~{}\lambda_{2}({\bm{\theta}}). (32)

Note that the above result is a direct consequence of passive IRS reflection that can be time-selective, but cannot be frequency-selective.

Next, we compare the minimum transmit powers required by FDMA and NOMA for the IRS-assisted system, with the result given by the following proposition.

Proposition 2: The minimum transmit powers required by NOMA and FDMA satisfy PFPNP_{F}\geq P_{N}, and the equality holds if and only if 𝜽N=𝜽F{\bm{\theta}}_{N}^{*}={\bm{\theta}}_{F}^{*}, λ1(𝜽F)=λ2(𝜽F)\lambda_{1}({\bm{\theta}}_{F}^{*})=\lambda_{2}({\bm{\theta}}_{F}^{*}), and γ1=γ2\gamma_{1}=\gamma_{2}.

Proof:

Let 𝜽F{\bm{\theta}}_{F}^{*} denote the optimal phase-shift vector for (F1.1) associated with FDMA. For the case of λ1(𝜽F)λ2(𝜽F)\lambda_{1}({\bm{\theta}}_{F}^{*})\geq\lambda_{2}({\bm{\theta}}_{F}^{*}), the power gap between (12) and (24) is given by

ΔP1=PFPN1\displaystyle\Delta P_{1}=~{}P_{F}-P_{N1}
(a)\displaystyle\stackrel{{\scriptstyle(a)}}{{\geq}} (22γ11)σ22λ1(𝜽F)+(22γ21)σ22λ2(𝜽F)(2γ11)2γ2σ2λ1(𝜽F)(2γ21)σ2λ2(𝜽F)\displaystyle\frac{(2^{2\gamma_{1}}-1)\sigma^{2}}{2\lambda_{1}({\bm{\theta}}_{F}^{*})}+\frac{(2^{2\gamma_{2}}-1)\sigma^{2}}{2\lambda_{2}({\bm{\theta}}_{F}^{*})}-\frac{(2^{\gamma_{1}}-1)2^{\gamma_{2}}{\sigma^{2}}}{\lambda_{1}({\bm{\theta}}_{F}^{*})}-\frac{(2^{\gamma_{2}}-1){\sigma^{2}}}{\lambda_{2}({\bm{\theta}}_{F}^{*})}
=\displaystyle= (22γ112γ1+γ2+1+2γ2+1)σ22λ1(𝜽F)+(22γ22γ2+1+1)σ22λ2(𝜽F)\displaystyle\frac{(2^{2\gamma_{1}}-1-2^{\gamma_{1}+\gamma_{2}+1}+2^{\gamma_{2}+1}){\sigma^{2}}}{2\lambda_{1}({\bm{\theta}}_{F}^{*})}+\frac{(2^{2\gamma_{2}}-2^{\gamma_{2}+1}+1){\sigma^{2}}}{2\lambda_{2}({\bm{\theta}}_{F}^{*})}
(b)\displaystyle\stackrel{{\scriptstyle(b)}}{{\geq}} (22γ22γ1+γ2+1+22γ1)σ22λ1(𝜽F)\displaystyle\frac{(2^{2\gamma_{2}}-2^{\gamma_{1}+\gamma_{2}+1}+2^{2\gamma_{1}}){\sigma^{2}}}{2\lambda_{1}({\bm{\theta}}_{F}^{*})}
=\displaystyle= (2γ22γ1)2σ22λ1(𝜽F)(c)0\displaystyle\frac{(2^{\gamma_{2}}-2^{\gamma_{1}})^{2}{\sigma^{2}}}{2\lambda_{1}({\bm{\theta}}_{F}^{*})}\stackrel{{\scriptstyle(c)}}{{\geq}}0 (33)

where the equality of (a)(a) holds if 𝜽F{\bm{\theta}}_{F}^{*} is also an optimal solution to problem (N1.1); the equality of (b)(b) holds when λ1(𝜽F)=λ2(𝜽F)\lambda_{1}({\bm{\theta}}_{F}^{*})=\lambda_{2}({\bm{\theta}}_{F}^{*}); and the equality of (c)(c) holds when γ1=γ2\gamma_{1}=\gamma_{2}. Similarly, for the case of λ2(𝜽F)λ1(𝜽F)\lambda_{2}({\bm{\theta}}_{F}^{*})\geq\lambda_{1}({\bm{\theta}}_{F}^{*}), we can also obtain a non-negative power gap between (14) and (24), i.e., ΔP2=PFPN20\Delta P_{2}=P_{F}-P_{N2}\geq 0. Since PFPN1P_{F}\geq P_{N1} and PFPN2P_{F}\geq P_{N2}, we can conclude that PFmin{PN1,PN2}=PNP_{F}\geq\min\{P_{N1},P_{N2}\}=P_{N}, where the equality holds when the above conditions are all satisfied. ∎

Remark 1: From the above two propositions, we obtain PFPTP_{F}\geq P_{T} and PFPNP_{F}\geq P_{N}, which implies that the minimum transmit power required by FDMA is always no lower than that of TDMA or NOMA. However, there is no deterministic relationship between the minimum transmit power with NOMA versus that with TDMA, which generally depends on the locations and target rates of the two users, as will be shown later in Section IV by numerical examples.

III-B Optimal Solution

Due to the discrete unit-modulus constraint on 𝜽{\bm{\theta}} and the non-convex objective functions, there is no standard method for efficiently solving the non-convex optimization problems (N1.1), (N2.1), (F1.1), and (T1.1) with globally optimal solutions. One straightforward approach is to search for all possible combinations of discrete phase shifts at all sub-surfaces and choose the one that achieves the minimum transmit power. However, such a brute-force search method incurs an exponential complexity of 𝒪(LM){\cal O}(L^{M}), which is prohibitively high for practical systems with large MM and/or LL. Although other approaches such as the branch-and-bound method can be applied to reduce the complexity [10], the worst-case complexity is still exponential over MM due to the fundamental NP-hardness. Thus, it mainly serves as a benchmark for evaluating other suboptimal schemes.

III-C Suboptimal Solution

Note that the objective functions of (12), (14) for NOMA, and (24) for FDMA are the weighed sum of two inverse channel power gains, which can be expressed in a generic form as

Q(𝜽)=a1λ1(𝜽)+a2λ2(𝜽),θm,m=1,,M\displaystyle Q({\bm{\theta}})=\frac{a_{1}}{\lambda_{1}({\bm{\theta}})}+\frac{a_{2}}{\lambda_{2}({\bm{\theta}})},\quad\theta_{m}\in{\cal F},\forall m=1,\ldots,M (34)

where a1a_{1} and a2a_{2} are two positive constants. Dropping the discrete constraint, the phase-shift vector that maximizes only each of the two user channel power gains is given by

𝒖k=argmax𝝍λk(𝝍)=ejhd,kej𝒒k,k{1,2}\displaystyle{\bm{u}}_{k}=\arg\underset{{\bm{\psi}}}{\text{max}}~{}~{}\lambda_{k}({\bm{\psi}})=e^{j\angle h_{d,k}}e^{j\angle{\bm{q}}_{k}},\quad k\in\{1,2\} (35)

where ()\angle(\cdot) returns the phase of each element and 𝝍[ψ1,ψ2,,ψM]T{\bm{\psi}}\triangleq[{\psi_{1}},{\psi_{2}},\ldots,{\psi_{M}}]^{T} with |ψm|=1,m=1,,M|{\psi_{m}}|=1,\forall m=1,\ldots,M. Note that 𝒖1𝒖2{\bm{u}}_{1}\neq{\bm{u}}_{2} in general, which implies that one phase-shift vector 𝝍{\bm{\psi}} cannot maximize two channel power gains λ1(𝝍)\lambda_{1}({\bm{\psi}}) and λ2(𝝍)\lambda_{2}({\bm{\psi}}) at the same time. As such, 𝝍{\bm{\psi}} needs to be properly designed to balance the channel power gains of two users for minimizing Q(𝝍)Q({\bm{\psi}}) in (34).

To this end, we first define the non-negative linear combination of 𝒖1{\bm{u}}_{1} and 𝒖2{\bm{u}}_{2} as

𝒖¯[η]η𝒖1+(1η)𝒖2,0η1.\displaystyle\bar{\bm{u}}^{[\eta]}\triangleq\eta{\bm{u}}_{1}+(1-\eta){\bm{u}}_{2},\quad 0\leq\eta\leq 1. (36)

As 𝒖¯[η]\bar{\bm{u}}^{[\eta]} may not satisfy the unit-modulus constraint, we try to find its nearest unit-modulus vector 𝒖~[η]\tilde{\bm{u}}^{[\eta]}, which is given by

𝒖~[η]=argmin𝝍𝝍𝒖¯[η]2=ej𝒖¯[η],0η1\displaystyle\tilde{\bm{u}}^{[\eta]}=\arg\underset{{\bm{\psi}}}{\text{min}}~{}~{}\left\|{\bm{\psi}}-\bar{\bm{u}}^{[\eta]}\right\|^{2}=e^{j\angle\bar{\bm{u}}^{[\eta]}},\quad 0\leq\eta\leq 1 (37)

to achieve a good balance between the two channel power gains by varying η\eta. For simplicity, we divide [0,1][0,1] into B+1B+1 equal levels, which are denoted by the set ={0,1B,,B1B,1}{\cal{B}}=\left\{0,\frac{1}{B},\ldots,\frac{B-1}{B},1\right\}. Then, for each η\eta\in{\cal{B}}, we quantize each phase shift in 𝒖~[η]\tilde{\bm{u}}^{[\eta]} to its nearest point in {\cal F} to obtain the discrete phase-shift vector 𝜽[η]{\bm{\theta}}^{[\eta]}, with each element given by

θm[η]=argminθ|θu~m[η]|2,m=1,,M.\displaystyle{\theta}^{[\eta]}_{m}=\arg\underset{{\theta}\in{\cal F}}{\text{min}}~{}~{}\left|{\theta}-\tilde{u}^{[\eta]}_{m}\right|^{2},\quad m=1,\ldots,M. (38)

Finally, we obtain the suboptimal solution 𝜽[η]{\bm{\theta}}^{[\eta^{*}]} according to

η=argminηa1λ1(𝜽[η])+a2λ2(𝜽[η]).\displaystyle\eta^{*}=\arg\underset{\eta\in{\cal{B}}}{\text{min}}~{}~{}\frac{a_{1}}{\lambda_{1}({\bm{\theta}}^{[\eta]})}+\frac{a_{2}}{\lambda_{2}({\bm{\theta}}^{[\eta]})}. (39)

From the above, we see that (N1.1), (N2.1), and (F1.1) can be solved suboptimally based on (38) and (39) with a linear complexity of 𝒪(BML){\cal O}(BML) only, which is thus referred to as the linear approximation (LA) method. Furthermore, to further improve the solution obtained in (38) and (39), the alternating optimization (AO) method [10] can be applied to solve (34) based on the initial solution obtained by the LA method. Specifically, we alternately optimize one phase shift θm{\theta}_{m} via one-dimensional search over {\cal F} while fixing the other M1M-1 phase shifts {θi}im\{{\theta}_{i}\}_{i\neq m}, and iterate the above until the convergence is reached. Note that the proposed algorithm is guaranteed to converge since the objective value of (34) is non-increasing over the iterations and lower-bounded by a finite value a1λ1(𝒖1)+a2λ2(𝒖2)\frac{a_{1}}{\lambda_{1}({\bm{u}}_{1})}+\frac{a_{2}}{\lambda_{2}({\bm{u}}_{2})}. Given the number of iterations II, the total complexity of the proposed algorithm is 𝒪((B+I)ML){\cal O}((B+I)ML).

On the other hand, for (T1.1) associated with TDMA, since 𝜽1{\bm{\theta}}_{1} and 𝜽2{\bm{\theta}}_{2} are decoupled in the objective function of (30), we can simply quantize each phase shift in 𝒖1{\bm{u}}_{1} and 𝒖2{\bm{u}}_{2} to its nearest point in {\cal F} to obtain discrete phase-shift vectors 𝜽1{\bm{\theta}}_{1}^{*} and 𝜽2{\bm{\theta}}_{2}^{*}, with each element given by

θk,m=argminθ|θuk,m|2,m=1,,M,k{1,2}.\displaystyle\theta_{k,m}^{*}=\arg\underset{{\theta}\in{\cal F}}{\text{min}}~{}\left|{\theta}-{u}_{k,m}\right|^{2},m=1,\ldots,M,k\in\{1,2\}. (40)

With the above for initialization, the AO method can be similarly applied to refine the solution to (T1.1). The overall complexity is thus of 𝒪((2+I)ML){\cal O}((2+I)ML).

IV Simulation Results

Refer to caption
Figure 2: Two deployment cases of the AP, IRS, and two users (top view), where dA=50d_{A}=50 m and dI=4d_{I}=4 m.

In this section, we present simulation results to numerically validate our analytical results (Propositions 1 and 2) and compare the performance of OMA (TDMA and FDMA) with NOMA in an IRS-assisted two-user system. The total number of reflecting elements of the IRS is set to N=100N=100, which is divided into M=5M=5 sub-surfaces.111The number of sub-surfaces is kept to be small for implementing the brute-force search to obtain the optimal solution and provide the performance upper bound for the proposed algorithm. The path loss exponents of the AP\rightarrowusers, IRS\rightarrowusers, and AP\rightarrowIRS links are set as 3.23.2, 2.62.6, and 2.52.5, respectively, and the path loss at the reference distance of 1 meter (m) is set as 3030 dB for each individual link [3, 8, 10]. Moreover, the small-scale fading is characterized by Rayleigh fading for each individual link. We consider two deployment cases shown in Fig. 2, where dI=4d_{I}=4 m and dA=50d_{A}=50 m. The results are averaged over 100100 independent fading channel realizations, with L=8L=8 and σ2=80{\sigma^{2}}=-80 dBm.

We first consider Case 1 in Fig. 2, where the two users are both located in the vicinity of the IRS with equal distances from the IRS as well as the AP. In Fig. 3(a), we compare the AP transmit powers required by different multiple access schemes versus the common target rate γ1=γ2=γ0\gamma_{1}=\gamma_{2}=\gamma_{0} for the two users. Apparently, compared to the schemes without IRS, the required transmit power at the AP is significantly reduced with the aid of IRS. Moreover, one can observe that without IRS, the required transmit power by NOMA is always lower than that of OMA (same for TDMA and FDMA). In contrast, when the IRS is deployed to assist two users in its vicinity, the above conclusion is not valid in general. For example, we observe that the required transmit power by TDMA is lower than that of NOMA for the common target rate γ0\gamma_{0} less than 3 bps/Hz. This is due to the use of different IRS phase-shift designs for the two users by exploiting the IRS’s time selectivity via TDMA. Moreover, FDMA always requires higher transmit power than the other two counterparts, which is in accordance with Propositions 1 and 2. On the other hand, by increasing the common target rate γ0\gamma_{0}, the power growth rate with TDMA is slightly higher than that with NOMA, which can be well understood since the required power by TDMA in (30) is the sum of two exponential functions with a higher exponent of 2γ02\gamma_{0}, as compared to that in (12) or (14) with NOMA.

To draw more insight for Case 1, we depict the AP transmit powers required by different transmission schemes versus user 1’s target rate γ1\gamma_{1} in Fig. 3(b), with the two users’ sum rate fixed as γ1+γ2=4\gamma_{1}+\gamma_{2}=4 bps/Hz. First, we can observe that TDMA requires lower transmit power than NOMA when the target rates of the two users are close (i.e., symmetric). Second, the transmit powers of both TDMA and FDMA are observed to dramatically increase when the two users’ rates become more asymmetric, which is attributed to the exponentially increasing of the dominant user target rate, i.e., max{γ1,γ2}\text{max}\{\gamma_{1},\gamma_{2}\} in (24) and (30). In contrast, it is observed that the required transmit power by NOMA is almost insensitive to the disparity of user target rates, thus providing a more robust performance. Third, to show the performance of the proposed suboptimal solution in Section III-C (i.e., the LA method with B=8B=8 followed by the AO method with I=2I=2), we consider two benchmark schemes: 1) the optimal solution by the brute-force search and 2) the random phase shift (RPS) initialization followed by the AO method with 1010 iterations (which has the same complexity as the proposed one for fair comparison). One can observe that our proposed solution achieves near-optimal performance, whereas a non-negligible performance loss is observed for the RPS-based initialization as compared to the optimal solution. The above result shows the effectiveness of the low-complexity LA method.

Refer to caption
(a) AP transmit power versus the common target rate γ0\gamma_{0}.
Refer to caption
(b) AP transmit power versus user 1’s target rate γ1\gamma_{1}, with the two users’ sum rate fixed as γ1+γ2=4\gamma_{1}+\gamma_{2}=4 bps/Hz.
Figure 3: Performance comparison of OMA and NOMA in Case 1.

Next, unlike Case 1 with two near-IRS users (namely, symmetric user deployment), we consider another setup of Case 2 with one near-IRS user and one far-IRS user (namely, asymmetric user deployment). As one user moves far away from the IRS and thus needs more power directly from the AP, it is observed in Figs. 4(a) and 4(b) that the transmit power required at the AP increases drastically compared to Figs. 3(a) and 3(b). This is expected since it is more energy efficient when both users are located in the vicinity of the IRS to reap its passive beamforming gain for saving the AP transmit power. Moreover, one can observe from Figs. 4(a) and 4(b) that the required transmit power by NOMA is always lower than that by OMA, regardless of whether TDMA or FDMA is used. This can be explained by the fact that NOMA has higher spectrum efficiency than OMA under asymmetric user channels, even with IRS deployed to assist one of the two users. Furthermore, since the IRS reflection has negligible effect on the far-IRS user, TDMA and FDMA show nearly the same performance in the IRS-assisted system.

Refer to caption
(a) AP transmit power versus the common target rate γ0\gamma_{0}.
Refer to caption
(b) AP transmit power versus user 1’s target rate γ1\gamma_{1}, with the two users’ sum rate fixed as γ1+γ2=4\gamma_{1}+\gamma_{2}=4 bps/Hz.
Figure 4: Performance comparison of OMA and NOMA in Case 2.

V Conclusions

In this letter, we have optimized the IRS reflection with discrete phase shifts for the IRS-assisted NOMA and OMA systems to minimize the AP transmit power with given user rates. The minimum transmit powers required by different multiple access schemes have been compared analytically and a low-complexity algorithm has been proposed to achieve near-optimal performance. In particular, our work has revealed that NOMA may perform worse than TDMA for near-IRS users with symmetric rates. This thus provides an important guideline for user paring in IRS-aided systems with a large number of users and RBs (e.g., IRS-assisted orthogonal FDMA (OFDMA)): it is preferable to pair users with asymmetric rates and/or asymmetric deployment (i.e., with distinct distances from the IRS, regardless of the distances from the AP) to exploit the NOMA gain over OMA.

References

  • [1] Q. Wu and R. Zhang, “Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,” IEEE Commun. Mag., doi: 10.1109/MCOM.001.1900107, Nov. 2019.
  • [2] M. Di Renzo et al., “Smart radio environments empowered by reconfigurable AI meta-surfaces: An idea whose time has come,” EURASIP J. Wireless Commun. Netw., vol. 2019:129, May 2019.
  • [3] 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.
  • [4] G. Yang, X. Xu, and Y.-C. Liang, “Intelligent reflecting surface assisted non-orthogonal multiple access,” arXiv preprint arXiv:1907.03133, 2019.
  • [5] Z. Ding and H. Poor, “A simple design of IRS-NOMA transmission,” arXiv preprint arXiv:1907.09918, 2019.
  • [6] Y. Li, M. Jiang, Q. Zhang, and J. Qin, “Joint beamforming design in multi-cluster MISO NOMA intelligent reflecting surface-aided downlink communication networks,” arXiv preprint arXiv:1909.06972, 2019.
  • [7] X. Mu, Y. Liu, L. Guo, J. Lin, and N. Al-Dhahir, “Exploiting intelligent reflecting surfaces in multi-antenna aided NOMA systems,” arXiv preprint arXiv:1910.13636, 2019.
  • [8] B. Zheng and R. Zhang, “Intelligent reflecting surface-enhanced OFDM: Channel estimation and reflection optimization,” IEEE Wireless Commun. Lett., doi: 10.1109/LWC.2019.2961357, Dec. 2019.
  • [9] Y. Yang, B. Zheng, S. Zhang, and R. Zhang, “Intelligent reflecting surface meets OFDM: Protocol design and rate maximization,” arXiv preprint arXiv:1906.09956, 2019.
  • [10] Q. Wu and R. Zhang, “Beamforming optimization for wireless network aided by intelligent reflecting surface with discrete phase shifts,” IEEE Trans. Commun., doi: 10.1109/TCOMM.2019.2958916, Dec. 2019.