Professional Documents
Culture Documents
Performance Analysis of Intelligent Reflecting Surface Aided Communication Systems
Performance Analysis of Intelligent Reflecting Surface Aided Communication Systems
Authorized licensed use limited to: TONGJI UNIVERSITY. Downloaded on February 08,2023 at 13:56:49 UTC from IEEE Xplore. Restrictions apply.
TAO et al.: PERFORMANCE ANALYSIS OF INTELLIGENT REFLECTING SURFACE AIDED COMMUNICATION SYSTEMS 2465
by Rayleigh fading. Therefore, the channel coefficients can be the ergodic capacity upper bound Cup is a symmetric function
expressed as with respect to the K1 and K2 , indicating the identical impact
of the two hop channels.
1 Kl 1
hl = αl h̄l + h̃l , l = 1, 2,
dl Kl + 1 Kl + 1 B. Outage Probability
1 In this subsection, we analyze the outage probability of the
g = α3 h̃3 ,
d3 system, which is defined as the probability of the instantaneous
SNR that falls below a pre-defined threshold γth . Mathemati-
where dl and αl , l ∈ {1, 2, 3}, denote the distance and path
cally, it is given by
loss exponent of the corresponding channel, while Ki , i ∈
{1, 2} denotes the Rician factor. Also, h̄l , l ∈ {1, 2}, denotes Pout = Prob (γmax ≤ γth ) . (5)
the normalized LoS component, and h̃l , l ∈ {1, 2, 3} denotes
the normalized non-LOS component. Since the exact distribution of γmax is unknown, we resort
Assuming perfect CSI at the IRS, applying the optimal to tight approximations of the outage probability, and we have
phase shift matrix Φ give in [14], the maximum SNR of the the following important result:
system can be obtained as Theorem 2: When N → ∞, the outage probability can be
N 2 approximated as Eq. (7) shown on the bottom of the next page,
γmax = γ0 |h2,n ||h1,n | + |g| , (2) where
n=1 π
μ = α1 α2 L 1 (−K1 )L 12 (−K2 ),
where γ0 = P/N0 represents the transmit SNR. 4 d1 d2 (K1 + 1)(K2 + 1) 2
and
III. P ERFORMANCE A NALYSIS ⎡
2 ⎤
2
In this section, we provide a detailed analysis of the achiev- 1 ⎢ π L (−K1 )L (−K2 ) ⎥
1 1
σ2 =
2 2
able systems performance. Specifically, two important metrics, ⎣1 − ⎦. (6)
dα1 α2
1 d2 16(K1 + 1)(K2 + 1)
i.e., ergodic capacity and outage probability, are considered.
We start with the ergodic capacity.
Proof: See Appendix B.
A. Ergodic Capacity Theorem 2 presents a closed-from approximation for the
outage probability, which consists of only elementary func-
The ergodic capacity of the system can be expressed as
tions, hence can be efficiently evaluated. Also, we observe
C = E {log2 (1 + γmax )} . (3) that both μ and σ 2 are symmetric functions with respect to
K1 and K2 , which implies K1 and K2 have identical impact
Since the exact distribution of γmax is intractable, it is chal- on the outage probability. In addition, although Theorem 2 is
lenging to characterize the exact ergodic capacity. Therefore, obtained with the assumption of large N , as will be shown
we resort to a tractable bound with the help of Jensen’s through numerical results, the approximation turns out to be
inequality, and have the following key results: sufficiently tight even for moderate N .
Theorem 1: The ergodic capacity of the system is upper To gain further insight, we now look into the high SNR
bounded by Cup given in Eq. (4), shown on the bottom of the regime, and we have the following important result:
next page, where L 12 (·) denotes the Laguerre polynomial [15]. Theorem 3: When γ0 → ∞, the outage probability can be
Proof: See Appendix A. accurately approximated by
Theorem 1 provides a closed-form expression involving √
only elementary functions, which is applicable for arbitrary −(N +1)
πaN dα
1
1 N α2 N α3
d2 d3 2γ0
system configurations, thereby enabling efficient evaluation Pout,2 ≈ , (8)
Γ N + 32 (N + 1)! γth
of the ergodic capacity performance. In addition, it also
facilitates the characterization of the impact of key parameters where
on the ergodic capacity. In particular, we have the following
observations: a = (K1 + 1)(K2 + 1)e−(K1 +K2 ) Ei(K1 ) + Ei(K2 ) − 2γ
Remark 1: The ergodic capacity upper bound increases
monotonically with N . For sufficiently large N , the ergodic (K1 + 1)(K2 + 1)
capacity Cup is mainly dominated by the term log2 γ1 N 2 , − ln K1 − ln K2 + 2K0 2 ,
2 dα 1 α2
1 d2 γ0
L 1 (−K1 )L 1 (−K2 )π
where γ1 = γ0 2
α α
2
, indicating an effective
16d1 1 d2 2 (K1 +1)(K2 +1) γ denotes the Euler’s constant, Ei(x) is the exponential integral
2
SNR gain of N . This can be explained by the fact that IRS [16], and Kn (x) is the modified Bessel function of the second
not only achieves the beamforming gain, but also attains the kind [16].
inherent aperture gain by collecting more signal power. Proof: See Appendix C.
Remark 2: Observing that L 12 (−K) is a monotonically Theorem 3 suggests that a diversity order of N + 1 is
increasing function of K, which suggests that a strong LOS achieved. Moreover, the impact of LOS component is mainly
component would enhance the ergodic capacity. In addition, reflected on the achievable coding gain of the system.
Authorized licensed use limited to: TONGJI UNIVERSITY. Downloaded on February 08,2023 at 13:56:49 UTC from IEEE Xplore. Restrictions apply.
2466 IEEE COMMUNICATIONS LETTERS, VOL. 24, NO. 11, NOVEMBER 2020
Fig. 2. Impact of K and N on the ergodic capacity. Fig. 3. Impact of IRS location on the ergodic capacity.
1 N
Cup = log2 1 + γ0 + α1 α2
dα
3
3
d1 d2
N (N − 1)π 2
2 N 2 π3
+ L 12 (−K1 )L 12 (−K2 ) + L 12 (−K1 )L 12 (−K2 ) (4)
16d1 d2 (K1 + 1)(K2 + 1)
α1 α2
8dα
1 d2 d3 (K1 + 1)(K2 + 1)
1 α2 α3
⎛γ ⎞ ⎛ ⎞⎡ ⎛ ⎞⎤
1 1 ⎝ γ0
th
1 − Nμ −( γγth0 − N μ)2 γ0 − N μ
γth
Authorized licensed use limited to: TONGJI UNIVERSITY. Downloaded on February 08,2023 at 13:56:49 UTC from IEEE Xplore. Restrictions apply.
TAO et al.: PERFORMANCE ANALYSIS OF INTELLIGENT REFLECTING SURFACE AIDED COMMUNICATION SYSTEMS 2467
indicating the great benefit of increasing N in terms of outage and observing the fact that h1 and h2 are independent,
performance. we obtain
⎧ ⎫
⎪
⎪ ⎪
⎪
V. C ONCLUSION ⎨
N N ⎬
E |h2,n ||h1,n ||h2,j ||h1,j |
This letter has studied the ergodic capacity and outage prob- ⎪
⎪ ⎪
⎪
⎩n=1 j=1 ⎭
ability of IRS-aided SISO systems under mixed Rayleigh and j=n
Rician fading channels. Closed-from expressions are derived N (N − 1)π 2
2
2
for the ergodic capacity upper bound and outage approxima- = L 12 (−K1 ) L 12 (−K2 ) .
16dα
1 d2 (K1
1 α2
+ 1)(K2 + 1)
tion, which provide efficient means to evaluate the system (13)
performance. Moreover, concise expressions are obtained in
the asymptotic regime, which sheds lights on the impact of 3) Computing x3 : For the Rayleigh variable |g|, we have
key parameters on the system performance. It is revealed that
π
the use of IRS contributes to an effective SNR gain of N 2 , and E{|g|} = . (14)
the diversity order can be increased to N +1. Also, the position 2dα3
3
of IRS also has significant impact on the system performance, As such, x3 can be calculated as
it is desirable to deploy the IRS close to the transmitter or
receiver, and with strong LOS path. π3 N 2
x3 = L 1 (−K1 )L 12 (−K2 ).
8d1 d2 d3 (K1 + 1)(K2 + 1) 2
α1 α2 α3
A PPENDIX A (15)
P ROOF OF T HEOREM 1
To this end, pulling x1 , x2 and x3 together yields the desired
Applying the Jensen’s inequality, we have the upper bound result.
of the capacity as
A PPENDIX B
C ≤ Cup = log2 (1 + E {γmax }) . (9) P ROOF OF T HEOREM 2
The remaining task is to compute E {γmax }. Using the rela- According to the definition, the outage probability can be
tionship in (2) and applying the binomial expansion theorem, transformed into
we have
γth
⎧ 2 ⎫ Pout (γth ) = Prob z ≤ , (16)
2 ⎨ N ⎬ γ0
E {γmax } = E |g| + E |h2,n ||h1,n | -N
! "# $ ⎩ ⎭ where z u+|g| with u n=1 |h2,n ||h1,n |. For sufficiently
n=1
x1 ! "# $ large N , u can be accurately approximated by the normal
x2
distribution according to the central limit theorem, i.e., u ∼
N N (N μ, N σ 2 ), where
+ 2E |h2,n ||h1,n ||g| . (10)
n=1 μ = E{|h2,n ||h1,n |}
! "# $ π
x3 = α1 α2 L 1 (−K1 )L 12 (−K2 ), (17)
4 d1 d2 (K1 +1)(K2 +1) 2
We now calculate x1 , x2 and x3 one-by-one.
1) Computing x1 : Obviously, we have x1 = dα13 . and
3
2) Computing x2 : Using the binomial expansion, x2 can be 1
σ 2 = D{|h2,n ||h1,n |} = α1 α2
further expanded as d1 d2
2
N π2
× 1− L 12 (−K1 )L 12 (−K2 ) .
x2 = E 2
|h2,n | |h1,n |2 16(K1 +1)(K2 +1)
(18)
n=1
⎧ ⎫
⎪
⎪ ⎪
⎪ Since z is the sum of independent random variable u and |g|,
⎨N
N ⎬
+E |h2,n ||h1,n ||h2,j ||h1,j | . (11) its cumulative distribution function (CDF) can be calculated
⎪
⎪ ⎪
⎪ via
⎩n=1 j=1 ⎭
j=n 1 ∞
,- . Fz (z) ≈ fu (z − x)F|g| (x)dx, (19)
N 2 2
It is easy to see that E n=1 |h2,n | |h1,n | = α1N α2 . −∞
/ 0 d1 d2 2 3
-N -N where fu (x) = √ 1 exp −(x−N μ)2
is the probability
Regarding E n=1 j=1 |h2,n ||h1,n ||h2,j ||h1,j | , noticing 2πN σ2 2N σ2 α3 2
j=n −d3 x
that, for the Rician variable |hl,n |, l ∈ {0, 1}, density function (PDF) of u and F|g| (x) = 1 − exp 2
denotes the CDF of Rayleigh variable |g|.
π To this end, the desired result can be obtained after some
E{|hl,n |} = L 1 (−Kl ), (12)
4dα
l
l
(K l + 1) 2 algebraic manipulations.
Authorized licensed use limited to: TONGJI UNIVERSITY. Downloaded on February 08,2023 at 13:56:49 UTC from IEEE Xplore. Restrictions apply.
2468 IEEE COMMUNICATIONS LETTERS, VOL. 24, NO. 11, NOVEMBER 2020
Authorized licensed use limited to: TONGJI UNIVERSITY. Downloaded on February 08,2023 at 13:56:49 UTC from IEEE Xplore. Restrictions apply.