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

Beamforming Design and Performance Evaluation for Reconfigurable Intelligent Surface Assisted Wireless Communication Systems With Non-Ideal Hardware

Yiming Liu,  Erwu Liu,  Rui Wang,  Binyu Lu, and Zhu Han Part of this work is presented in IEEE GLOBECOM 2020[1], and part is presented in IEEE WCNC 2021[2]. Yiming Liu, Erwu Liu, Rui Wang, and Binyu Lu are with the College of Electronic and Information Engineering, Tongji University, Shanghai 201804, China, E-mail: [email protected], [email protected]. Zhu Han is with the Department of Electrical and Computer Engineering, University of Houston, Houston, TX 77004 USA, E-mail: [email protected].
Abstract

Reconfigurable intelligent surface (RIS) can effectively control the wavefront of the impinging signals and has emerged as a cost-effective promising solution to improve the spectrum and energy efficiency of wireless systems. Most existing researches on RIS assume that the hardware operations are perfect. However, both physical transceiver and RIS suffer from inevitable hardware impairments in practice, which can lead to severe system performance degradation and increase the complexity of beamforming optimization. Consequently, the existing researches on RIS, including channel estimation, beamforming optimization, spectrum and energy efficiency analysis, etc., cannot directly apply to the case of hardware impairments. In this paper, by taking hardware impairments into consideration, we conduct the joint transmit and reflect beamforming optimization, and reevaluate the system performance. First, we characterize the closed-form estimators of direct and cascaded channels in both single-user and multi-user cases, and analyze the impact of hardware impairments on channel estimation accuracy. Then, the optimal transmit beamforming solution is derived, and a gradient descent method-based algorithm is also proposed to optimize the reflect beamforming. Moreover, we analyze the three types of asymptotic channel capacities with respect to the transmit power, the antenna number, and the reflecting element number. Finally, in terms of the system energy consumption, we analyze the power scaling law and the energy efficiency. Our experimental results also reveal an encouraging phenomenon that the RIS-assisted wireless system with massive reflecting elements can achieve both high spectrum and energy efficiency without the need for massive antennas and without allocating too many resources to optimize the reflect beamforming.

Index Terms:
Reconfigurable intelligent surface, hardware impairments, channel estimation, joint transmit and reflect beamforming, phase shift optimization, channel capacity, power scaling law, energy efficiency.

I Introduction

The March 2020 report released by Cisco Systems, Inc., shows that the number of networked devices and connections will reach up to 29.3 billions by the year of 2023, and about half of them are mobile-ready devices and connections[3]. This inevitably leads to an explosive growth of mobile data traffic, which requires to enhance the performance of wireless communication systems in future. The fifth-generation (5G) wireless network technology has been standardized to solve this problem. However, there exists no single enabling technology that can support all 5G application requirements during the standardization process. Therefore, it necessitates radically new communication paradigms, especially at the physical layer. Reconfigurable intelligent surface (RIS), a.k.a., intelligent reflecting surface, has emerged as a cost-effective promising method for future wireless communications. Existing works have revealed that, with the assistance of a smart controller, RIS can effectively control the wavefront, e.g., the phase, amplitude, frequency, and even polarization, of the impinging signals without the need of complex decoding, encoding, and radio frequency processing operations, such that the desired signals and interfering signals are added constructively and destructively at the receivers, respectively[4, 5, 6, 7]. Furthermore, RIS is much cheaper than active base station (BS) or relay, and can be deployed easily and rapidly[8].

Owing to the above advantages, RIS-assisted wireless systems have drawn significant research interest recently, and many research works have been done, including high-layer protocol design[9, 10], channel estimation[11, 12, 13], received signal-to-noise ratio (SNR) maximization[14, 15, 16, 17], channel capacity analysis[18, 19], energy efficiency maximization[20, 7, 1], quality-of-service (QoS) constrained transmit power minimization[21, 15], and physical layer security design[22, 23]. It is worthy noting that all the mentioned researches study the RIS-assisted wireless system with an assumption that the hardware operations are perfect without any impairment. However, both physical transceiver and RIS suffer from inevitable hardware impairments[24, 25, 26, 27]. Different from the traditional noise, the hardware impairments at the transceiver lead to the mismatch or distortion between the intended signal and the actual signal, and the hardware impairments at the RIS cause the phase noise since perfectly precise configuration of the reflection phases is infeasible. Several existing works study the impact of hardware impairments on massive multiple-input multiple-output (MIMO) systems[28, 26, 29]. For example, it has been shown that hardware impairments limit the asymptotic channel capacity in massive MIMO systems and high-SNR slope thus collapsing to zero[26].

The hardware impairments at transceivers and RIS, if not carefully handled, will affect both the direct link and the reflected link, which may lead to severer system performance degradation compared with conventional systems. Consequently, it is necessary to reevaluate the performance of RIS-assisted wireless systems with hardware impairments that includes channel estimation accuracy, uplink and downlink channel capacity, power scaling law, and energy efficiency. Furthermore, considering hardware impairments will also bring certain other significant challenges for fully utilizing RIS-assisted wireless systems. For example, in the case of perfect hardware, the optimal transmit beamforming solution is the maximum-ratio transmission (MRT), and the reflect beamforming optimization problem can be addressed by solving a non-convex quadratic constraint quadratic program (QCQP) problem[17, 21, 14]. Nevertheless, the consideration of hardware impairments increases the difficulty and complexity of the joint transmit and reflect beamforming optimization which is non-trivial even for the case of perfect hardware. As a result, it is necessary to reformulate the optimization problem and redesign the optimization algorithm.

Motivated by the above problems, by considering hardware impairments, we optimize the joint transmit and reflect beamforming and evaluate the system performance. To the best of our knowledge, it is the first work comprehensively evaluating the impact of hardware impairments on RIS-assisted wireless systems. The contributions of this paper are summarized as follows:

  • By utilizing the novel three-phase pilot-based channel estimation framework, we give the closed-form estimators of the direct and cascaded channels in both single-user and multi-user cases with hardware impairments. Then, two corollaries about the impact of hardware impairments on estimation accuracy and how to reduce this impact are presented.

  • We formulate an optimization problem with an aim to maximize the receive SNR for the RIS-assisted wireless system with hardware impairments. By transforming the optimization problem into a generalized Rayleigh quotient problem, we determine the optimal transmit beamforming and receive combining solutions.

  • Based on the optimal transmit beamforming solution, a gradient descent method (GDM)-based algorithm is proposed to optimize the reflect beamforming. Our experimental results demonstrate that the proposed algorithm can offer a significant improvement in spectrum efficiency when the reflecting element number is appropriate. However, if we utilize massive reflecting elements, it is unnecessary to allocate resource to optimize the beamforming, and the channel capacity limit can still be reached which is caused by hardware impairments.

  • By considering three types of asymptotics with respect to the transmit power, the BS antenna number, and the reflecting element number, we analyze the asymptotic channel capacities and derive the corresponding upper and lower bounds.

  • In terms of the system energy consumption, we derive the power scaling law in both cases of perfect and imperfect channel state information (CSI) and further analyze the maximal energy efficiency with hardware impairments. Our experimental results also show that RIS-assisted wireless systems can achieve both high spectral efficiency and high energy efficiency without the need for massive BS antennas.

The rest of this paper is organized as follows. Section II presents the system model, and the hardware impairment model. The channel estimation performance is analyzed in Section III. In Section IV, we derive the optimal transmit beamforming solution and propose the GDM-based algorithm for the reflect beamforming optimization. The asymptotic downlink channel capacity is also discussed in Section IV. Section V presents the power scaling law and the maximal energy efficiency. Finally, we conclude the paper in Section VI. The numerical results are illustrated in each corresponding section.

II System and Hardware Impairment Models

In this section, we establish the system model based on the physically correct models in prior works. We consider an RIS-assisted wireless system where an RIS is deployed to assist the communication from a multi-antenna BS to a single-antenna user over a given frequency band, as illustrated in Fig. 1.

Refer to caption
Figure 1: The RIS-assisted system with an M-antenna BS, a single-antenna user, and an RIS comprising N reflecting elements.

The number of antennas at the BS and that of reflecting elements at the RIS are denoted by MM and NN, respectively. The operations at the RIS is represented by the diagonal matrix 𝚽=diag(ejθ1,,ejθN)\mathbf{\Phi}=\operatorname{diag}\left(e^{j\theta_{1}},\cdots,e^{j\theta_{N}}\right)111 Since the RIS is a passive device, each reflecting element is usually designed to maximize the signal reflection. Thus, we set the amplitude of reflection coefficient equal to one for simplicity in this paper. , where θi[0,2π)\theta_{i}\in[0,2\pi) represents the phase shift222 We assume that the phase shifts can be continuously varied in [0,2π)[0,2\pi), while they are usually selected from a finite number of discrete values in practice. Wu and Zhang address the beamforming design of RIS with discrete phase shifts, and show that the RIS with discrete phase shifts achieve the same power gain with that of the RIS with continuous phase shifts[21]. of the ii-th reflecting element and jj represents the imaginary unit. We assume that the channels follow Rayleigh block-fading, and the realizations of them are random and independent between blocks. Denote the channels of BS-user link, BS-RIS link, and RIS-user link as 𝐡dM×1\mathbf{h}_{\mathrm{d}}\in\mathbb{C}^{M\times 1}, 𝐆M×N\mathbf{G}\in\mathbb{C}^{M\times N}, and 𝐡rN×1\mathbf{h}_{\mathrm{r}}\in\mathbb{C}^{N\times 1}, respectively. They are modeled as ergodic processes with fixed independent realizations in each coherence period. The direct channel 𝐡d𝒞𝒩(𝟎,𝐂D)\mathbf{h}_{\mathrm{d}}\sim\mathcal{C}\mathcal{N}\left(\mathbf{0},\mathbf{C}_{\mathrm{D}}\right) and the reflected cascade channel 𝐡c=𝐆𝐡r𝒞𝒩(𝟎,𝐂R)\mathbf{h}_{\mathrm{c}}=\mathbf{G}\mathbf{h}_{\mathrm{r}}\sim\mathcal{C}\mathcal{N}\left(\mathbf{0},\mathbf{C}_{\mathrm{R}}\right), where 𝐂D=βd𝐈\mathbf{C}_{\mathrm{D}}=\beta_{d}\mathbf{I} and 𝐂R=Nβr𝐈\mathbf{C}_{\mathrm{R}}=N\beta_{r}\mathbf{I}. We also define the matrix 𝐇R=𝐆diag(𝐡r)\mathbf{H}_{\mathrm{R}}=\mathbf{G}\operatorname{diag}\left(\mathbf{h}_{\mathrm{r}}\right), and then we have that 𝔼{𝐇R}=𝟎\mathbb{E}\{\mathbf{H}_{\mathrm{R}}\}=\mathbf{0} and 𝔼{𝐇R𝐇RH}=𝐂R\mathbb{E}\{\mathbf{H}_{\mathrm{R}}\mathbf{H}_{\mathrm{R}}^{\mathrm{H}}\}=\mathbf{C}_{\mathrm{R}}.

II-A Hardware Impairment Model

The hardware impairments considered in this paper include transceiver hardware impairments and RIS hardware impairments. Although the physical transceiver implementations consist of many different hardware components and each one distorts the signals in its own way[30], the aggregate residual hardware impairments can be modeled as independent additive distortion noise[31, 32, 33, 34]. Since the RIS is a passive device and high-precision configuration of the reflection phases is unfeasible, the RIS hardware impairments can be modeled as phase errors[27]. The detailed hardware impairment models can be established as follows.

II-A1 Transceiver Hardware Impairments

The hardware impairments of transceiver cause the mismatch or distortion between the intended signal and the actual signal. The distortion can be well-modeled as uncorrelated additive Gaussian noise since it is the aggregate residual of many hardware impairments, where some are Gaussian and some behave as Gaussian when summed up[31, 32]. We use additive distortion noise ηu\eta_{u}\in\mathbb{C} and 𝜼bM×1\boldsymbol{\eta}_{b}\in\mathbb{C}^{M\times 1} to describe the residual impairments of the transceiver hardwares at the BS and the user, respectively. They obey the circularly symmetric complex Gaussian distribution, ηu𝒞𝒩(0,vu)\eta_{u}\sim\mathcal{C}\mathcal{N}\left(0,v_{u}\right) and 𝜼b𝒞𝒩(𝟎,𝚼B)\boldsymbol{\eta}_{b}\sim\mathcal{CN}\left(\mathbf{0},\mathbf{\Upsilon}_{\mathrm{B}}\right), where vuv_{u} and 𝚼B\mathbf{\Upsilon}_{\mathrm{B}} are the variance and covariance matrix of the additive distortion noise, respectively. It should be noted that the distortion noise power at an antenna is proportional to the signal power at this antenna[31, 32]. When all the reflecting elements are switched off, there only exists the direct channel in the system. The variance vuv_{u} of the additive distortion noise at the user can be modeled as vu=κupuv_{u}=\kappa_{u}p_{u}, and the covariance matrix 𝚼B\mathbf{\Upsilon}_{\mathrm{B}} of the additive distortion noise at the BS can be modeled as 𝚼B=κb(pu+vu)𝐂D\mathbf{\Upsilon}_{\mathrm{B}}=\kappa_{b}\left(p_{u}+v_{u}\right)\mathbf{C}_{\mathrm{D}}, where pup_{u} is the transmit power, κu\kappa_{u} and κb\kappa_{b} are the proportionality coefficients which characterize the levels of hardware impairments at the user and the BS, respectively, and are related to the error vector magnitude (EVM). The EVM is a common measure of transceiver hardware quality333 More precisely, the EVM is the difference between the actual transmitted/received symbols and the ideal symbols. It can be degraded by various imperfections, e.g., noise, distortion, spurious signals, and phase noise. Thus, the EVM can provide a comprehensive measure of the quality of the radio transceiver for use in digital communications. The 3GPP LTE standard specifies total EVM requirements in the range [0.08,0.175][0.08,0.175][35]. , e.g., when the BS transmits the signal 𝒙\boldsymbol{x}, the EVM at the BS is defined as

EVMBS=tr(𝔼{𝜼b𝜼bH})tr(𝔼{𝒙𝒙H})=κb.\mathrm{EVM}_{\mathrm{BS}}=\sqrt{\frac{\operatorname{tr}\left(\mathbb{E}\left\{\boldsymbol{\eta}_{b}\boldsymbol{\eta}_{b}^{\mathrm{H}}\right\}\right)}{\operatorname{tr}\left(\mathbb{E}\left\{\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}}\right\}\right)}}=\sqrt{\kappa_{b}}. (1)

When all the reflecting elements are switched on, there exist the reflected cascade channel besides the direct channel in the system. In the uplink, the variance vuv_{u} of the additive distortion noise at the user is still vu=κupuv_{u}=\kappa_{u}p_{u}, while the covariance matrix 𝚼B\mathbf{\Upsilon}_{\mathrm{B}} of the additive distortion noise at the BS turns into 𝚼B=κb(pu+vu)𝔼{𝐡𝐡H}\mathbf{\Upsilon}_{\mathrm{B}}=\kappa_{b}\left(p_{u}+v_{u}\right)\mathbb{E}\{\mathbf{h}\mathbf{h}^{\mathrm{H}}\} where 𝐡=𝐡d+𝐆𝚽𝐡r\mathbf{h}=\mathbf{h}_{\mathrm{d}}+\mathbf{G\Phi}\mathbf{h}_{\mathrm{r}} is the overall channel vector. In the downlink, the covariance matrix 𝚼B\mathbf{\Upsilon}_{\mathrm{B}} of the additive distortion noise at the BS can be modeled as 𝚼B=κbdiag(𝔼{𝒙𝒙H})\mathbf{\Upsilon}_{\mathrm{B}}=\kappa_{b}\operatorname{diag}\left(\mathbb{E}\{\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}}\}\right), where 𝒙\boldsymbol{x} is the transmitted signal. The variance vuv_{u} of the distortion noise at the user turns into vu=κu𝔼{𝐡H(𝔼{𝒙𝒙H}+𝚼B)𝐡}v_{u}=\kappa_{u}\mathbb{E}\{\mathbf{h}^{\mathrm{H}}(\mathbb{E}\{\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}}\}+\mathbf{\Upsilon}_{\mathrm{B}})\mathbf{h}\}.

II-A2 RIS Hardware Impairments

The hardware impairments of RIS can be modeled as phase noise since the RIS is a passive device and high-precision configuration of the reflection phases is infeasible. The phase noise at the ii-th reflecting element is denoted as Δθi\Delta\theta_{i}, which is randomly distributed on [π,π][-\pi,\pi] according to a certain circular distribution. According to the result in[27], the distribution of the phase noise Δθi\Delta\theta_{i} has mean direction zero, i.e., arg(𝔼{ejΔθi})=0\arg(\mathbb{E}\{e^{j\Delta\theta_{i}}\})=0, and its probability density function is symmetric around zero. Then, the actual response matrix of RIS with phase noise is 𝚽^=diag[ej(θ1+Δθ1),ej(θ2+Δθ2),,ej(θN+ΔθN)]\hat{\mathbf{\Phi}}=\operatorname{diag}\left[e^{j(\theta_{1}+\Delta\theta_{1})},e^{j(\theta_{2}+\Delta\theta_{2})},\cdots,e^{j(\theta_{N}+\Delta\theta_{N})}\right].

II-B Received Signal Model

Based on the communication system model given in the previous subsection, we establish the received signal model in this subsection. The uplink is used for pilot-based channel estimation and data transmission. The channel estimation strategy and the received pilot signal at the BS will be illustrated detailedly in the next section. The received data signal 𝒚M×1\boldsymbol{y}\in\mathbb{C}^{M\times 1} at the BS transmitted from the user can be expressed as follows:

𝒚=(𝐡d+𝐆𝚽^𝐡r)(x+ηu)+𝜼b+𝒏,\boldsymbol{y}=\left(\mathbf{h}_{\mathrm{d}}+\mathbf{G}\hat{\mathbf{\Phi}}\mathbf{h}_{\mathrm{r}}\right)\left(x+\eta_{u}\right)+\boldsymbol{\eta}_{b}+\boldsymbol{n}, (2)

where xx\in\mathbb{C} is the data signal transmitted by the user and the transmit power is pu=𝔼{|x|2}p_{u}=\mathbb{E}\{|x|^{2}\}, and 𝒏M×1\boldsymbol{n}\in\mathbb{C}^{M\times 1} is the additive white Gaussian noise (AWGN) with the elements independently drawn from 𝒞𝒩(0,σb2)\mathcal{C}\mathcal{N}\left(0,\sigma_{b}^{2}\right). The downlink is used for data transmission, and the received data signal yy\in\mathbb{C} at the user from the BS can be expressed as follows:

y=(𝐡d+𝐆𝚽^𝐡r)H(𝒙+𝜼b)+ηu+n,y=\left(\mathbf{h}_{\mathrm{d}}+\mathbf{G}\hat{\mathbf{\Phi}}\mathbf{h}_{\mathrm{r}}\right)^{\mathrm{H}}\left(\boldsymbol{x}+\boldsymbol{\eta}_{b}\right)+\eta_{u}+n, (3)

where 𝒙M×1\boldsymbol{x}\in\mathbb{C}^{M\times 1} is the data signal transmitted by the BS and nn\in\mathbb{C} is the AWGN drawn from 𝒞𝒩(0,σu2)\mathcal{C}\mathcal{N}\left(0,\sigma_{u}^{2}\right). The transmit power of the BS is pb=𝔼{𝒙H𝒙}p_{b}=\mathbb{E}\{\boldsymbol{x}^{\mathrm{H}}\boldsymbol{x}\}.

III Channel Estimation with Hardware Impairments

In this section, we perform the channel estimations, including the estimations of direct channel and cascaded channel, for the considered system with hardware impairments. Several existing strategies have been proposed to estimate in the case without considering hardware impairments, e.g., an on-off state control based strategy is proposed in[11] and[2] to estimate each reflected cascade channel without interference from the other reflecting elements, and a novel hierarchical training reflection design is proposed to progressively estimate reflected cascade channels over multiple time blocks[13]. To reduce the channel estimation time, we adopt the novel three-phase pilot-based channel estimation framework proposed in[12] to make such estimations. In order to be comprehensive, we will evaluate the estimation performance affected by the existence of hardware impairments in both cases with single-user and multi-user. By utilizing this framework, the direct channel is first estimated for all users in the first phase, the cascade channel is then estimated for a typical user in the second phase, and finally we estimate the cascade channels for other users in the third phase. The theorem of LMMSE channel estimator and its MSE with hardware impairments and the two corollaries about the impact of hardware impairments on channel estimations will be illustrated in the later subsections.

III-A Single-user Case with Hardware Impairments

For the case with single-user, only two phases are needed to make estimations which consist of τ1\tau_{1} and τ2\tau_{2} time slots, respectively. In the first phase, all the reflecting elements are switched off, and the BS estimates the direct channel. The user transmits the pilot a(i)a^{(i)} to the BS at the ii-th time slot, i=1,,τ1i=1,\dots,\tau_{1}. Then, the received signals at the BS over the whole phase are

𝐘I=[𝒚(1),,𝒚(τ1)]=𝐡d(𝒂IT+𝜼u,IT)+[𝜼b(1),,𝜼b(τ1)]+[𝒏(1),,𝒏(τ1)],\mathbf{Y}_{\text{I}}=[\boldsymbol{y}^{(1)},\cdots,\boldsymbol{y}^{(\tau_{1})}]=\mathbf{h}_{\text{d}}\left(\boldsymbol{a}_{\text{I}}^{\mathrm{T}}+\boldsymbol{\eta}^{\mathrm{T}}_{u,\text{I}}\right)+[\boldsymbol{\eta}^{(1)}_{b},\cdots,\boldsymbol{\eta}^{(\tau_{1})}_{b}]+[\boldsymbol{n}^{(1)},\cdots,\boldsymbol{n}^{(\tau_{1})}], (4)

where 𝒂IT=[a(1),,a(τ1)]\boldsymbol{a}_{\text{I}}^{\mathrm{T}}=[a^{(1)},\cdots,a^{(\tau_{1})}] and 𝜼u,IT=[ηu(1),,ηu(τ1)]\boldsymbol{\eta}^{\mathrm{T}}_{u,\text{I}}=[\eta^{(1)}_{u},\cdots,\eta^{(\tau_{1})}_{u}]. Without loss of generality, we use the LMMSE estimator to make the channel estimation. From Eq. (4), the MSE for estimating the direct channel 𝐡d\mathbf{h}_{\mathrm{d}} can be expressed as

εI\displaystyle\varepsilon_{\mathrm{I}} =𝔼[(𝐡^d𝐡d)H(𝐡^d𝐡d)]=𝔼[(𝐘I𝐀𝐡d)H(𝐘I𝐀𝐡d)]\displaystyle=\mathbb{E}\left[(\hat{\mathbf{h}}_{\text{d}}-\mathbf{h}_{\text{d}})^{\mathrm{H}}(\hat{\mathbf{h}}_{\text{d}}-\mathbf{h}_{\text{d}})\right]=\mathbb{E}\left[\left(\mathbf{Y}_{\text{I}}\mathbf{A}-\mathbf{h}_{\text{d}}\right)^{\mathrm{H}}\left(\mathbf{Y}_{\text{I}}\mathbf{A}-\mathbf{h}_{\text{d}}\right)\right] (5)
=𝐀H𝔼(𝐘IH𝐘I)𝐀𝔼(𝐡dH𝐘I)𝐀𝐀H𝔼(𝐘IH𝐡d)+𝔼(𝐡dH𝐡d),\displaystyle=\mathbf{A}^{\mathrm{H}}\mathbb{E}\left(\mathbf{Y}_{\text{I}}^{\mathrm{H}}\mathbf{Y}_{\text{I}}\right)\mathbf{A}-\mathbb{E}\left(\mathbf{h}_{\text{d}}^{\mathrm{H}}\mathbf{Y}_{\text{I}}\right)\mathbf{A}-\mathbf{A}^{\mathrm{H}}\mathbb{E}\left(\mathbf{Y}_{\text{I}}^{\mathrm{H}}\mathbf{h}_{\text{d}}\right)+\mathbb{E}\left(\mathbf{h}_{\text{d}}^{\mathrm{H}}\mathbf{h}_{\text{d}}\right),

where 𝐀\mathbf{A} is the detector matrix which can be obtained by equaling the partial derivative of εI\varepsilon_{\mathrm{I}} with respect to 𝐀\mathbf{A} to zero, i.e.,

εI𝐀=[𝐀H𝔼(𝐘IH𝐘I)]T[𝔼(𝐡dH𝐘I)]T=𝟎𝐀=[𝔼(𝐘IH𝐘I)]1[𝔼(𝐡dH𝐘I)]H.\frac{\partial\varepsilon_{\mathrm{I}}}{\partial\mathbf{A}}=\left[\mathbf{A}^{\mathrm{H}}\mathbb{E}\left(\mathbf{Y}_{\text{I}}^{\mathrm{H}}\mathbf{Y}_{\text{I}}\right)\right]^{\mathrm{T}}-\left[\mathbb{E}\left(\mathbf{h}_{\text{d}}^{\mathrm{H}}\mathbf{Y}_{\text{I}}\right)\right]^{\mathrm{T}}=\mathbf{0}\;\;\Rightarrow\;\mathbf{A}=\left[\mathbb{E}\left(\mathbf{Y}_{\text{I}}^{\mathrm{H}}\mathbf{Y}_{\text{I}}\right)\right]^{-1}\left[\mathbb{E}\left(\mathbf{h}_{\text{d}}^{\mathrm{H}}\mathbf{Y}_{\text{I}}\right)\right]^{\mathrm{H}}. (6)

Therefore, the LMMSE estimator for direct channel and its MSE respectively are

𝐡^d=βd𝐘I[a(1),,a(τ1)]Hβd(τ1pu+vu)+vb+σb2,\hat{\mathbf{h}}_{\text{d}}=\frac{\beta_{d}\mathbf{Y}_{\text{I}}\;[a^{(1)},\cdots,a^{(\tau_{1})}]^{\mathrm{H}}}{\beta_{d}\left(\tau_{1}p_{u}+v_{u}\right)+v_{b}+\sigma^{2}_{b}}, (7)
εI=Mβdτ1puMβd2βd(τ1pu+vu)+vb+σb2.\varepsilon_{\text{I}}=M\beta_{d}-\frac{\tau_{1}p_{u}M\beta^{2}_{d}}{\beta_{d}\left(\tau_{1}p_{u}+v_{u}\right)+v_{b}+\sigma^{2}_{b}}. (8)

In the second phase, all the reflecting elements are switched on such that the BS can estimate the reflected cascade channel. The user transmits the pilot a(i)=pua^{(i)}=\sqrt{p_{u}}\; to the BS at the ii-th time slot, i=τ1+1,,τ1+τ2i=\tau_{1}+1,\dots,\tau_{1}+\tau_{2}. Then, by canceling the interference caused by direct channel that is estimated in the first phase, the received signals at the BS over the whole phase are

𝐘~II=\displaystyle\tilde{\mathbf{Y}}_{\mathrm{II}}= [𝒚(τ1+1),,𝒚(τ1+τ2)]𝐡^d𝒂IIT\displaystyle\left[\boldsymbol{y}^{(\tau_{1}+1)},\cdots,\boldsymbol{y}^{(\tau_{1}+\tau_{2})}\right]-\hat{\mathbf{h}}_{\mathrm{d}}\boldsymbol{a}^{\mathrm{T}}_{\text{II}} (9)
=\displaystyle= 𝐇𝚽^II[diag(𝒂IIT+𝜼u,IIT)]+𝐡d𝜼u,IIT+(𝐡d𝐡^d)𝒂IIT+[𝜼b(τ1+1),,𝜼b(τ1+τ2)]+𝐍II,\displaystyle\;\mathbf{H}\hat{\mathbf{\Phi}}_{\text{II}}\left[\operatorname{diag}\left(\boldsymbol{a}^{\mathrm{T}}_{\text{II}}+\boldsymbol{\eta}^{\mathrm{T}}_{u,\text{II}}\right)\right]+{\mathbf{h}}_{\text{d}}\boldsymbol{\eta}^{\mathrm{T}}_{u,\text{II}}+(\mathbf{h}_{\mathrm{d}}-\hat{\mathbf{h}}_{\mathrm{d}})\boldsymbol{a}^{\mathrm{T}}_{\text{II}}+\left[\boldsymbol{\eta}^{(\tau_{1}+1)}_{b},\cdots,\boldsymbol{\eta}^{(\tau_{1}+\tau_{2})}_{b}\right]+\mathbf{N}_{\text{II}},

where 𝒂IIT=[a(τ1+1),,a(τ1+τ2)]\boldsymbol{a}_{\text{II}}^{\mathrm{T}}=[a^{(\tau_{1}+1)},\cdots,a^{(\tau_{1}+\tau_{2})}], 𝜼u,IIT=[ηu(τ1+1),,ηu(τ1+τ2)]\boldsymbol{\eta}^{\mathrm{T}}_{u,\text{II}}=[\eta_{u}^{(\tau_{1}+1)},\cdots,\eta^{(\tau_{1}+\tau_{2})}_{u}], 𝐍II=[𝒏(τ1+1),,𝒏(τ1+τ2)]\mathbf{N}_{\text{II}}=\left[\boldsymbol{n}^{(\tau_{1}+1)},\cdots,\boldsymbol{n}^{(\tau_{1}+\tau_{2})}\right] and 𝚽^II\hat{\mathbf{\Phi}}_{\mathrm{II}} is the N×τ2N\times\tau_{2} RIS matrix with the (m,n)(m,n)-th entry equals exp[j(θm(τ1+n)+Δθm(τ1+n))]\operatorname{exp}[j(\theta_{m}^{(\tau_{1}+n)}+\Delta\theta_{m}^{(\tau_{1}+n)})]. To ensure that rank(𝚽^II)=N\operatorname{rank}(\hat{\mathbf{\Phi}}_{\mathrm{II}})=N, we construct 𝚽II{\mathbf{\Phi}}_{\mathrm{II}} based on the discrete Fourier transform (DFT) matrix. For simplicity, we define 𝐂˙R=𝔼{[𝐡1,,𝐡N]H[𝐡1,,𝐡N]}\dot{\mathbf{C}}_{\mathrm{R}}=\mathbb{E}\{\left[\mathbf{h}_{1},\cdots,\mathbf{h}_{N}\right]^{\mathrm{H}}\left[\mathbf{h}_{1},\cdots,\mathbf{h}_{N}\right]\} and 𝐙II\mathbf{Z}_{\mathrm{II}} as the overall noise consisting of direct channel estimation error, hardware impairments and AWGN in Eq. (9). Then, the covariance matrix of 𝐙II\mathbf{Z}_{\mathrm{II}} can be expressed as

𝚿II=𝔼[𝐙IIH𝐙II]=vudiag(𝚽IIH𝐂˙R𝚽II)+(vuMβd+Mvb+τ2puεI+Mσb2)𝐈.\mathbf{\Psi}_{\mathrm{II}}=\mathbb{E}\left[\mathbf{Z}_{\mathrm{II}}^{\mathrm{H}}\mathbf{Z}_{\mathrm{II}}\right]=v_{u}\operatorname{diag}\left({\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\right)+\left(v_{u}M\beta_{d}+Mv_{b}+\tau_{2}p_{u}\varepsilon_{\mathrm{I}}+M\sigma^{2}_{b}\right)\mathbf{I}. (10)

In this case, the LMMSE estimator for cascade channel and its MSE respectively are

𝐇^=[𝐡^1,,𝐡^N]=pu𝐘~II(pu𝚽IIH𝐂˙R𝚽II+𝚿II)1𝚽IIH𝐂˙R,\hat{\mathbf{H}}=\left[\hat{\mathbf{h}}_{1},\cdots,\hat{\mathbf{h}}_{N}\right]=\sqrt{p_{u}}\;\tilde{\mathbf{Y}}_{\mathrm{II}}\left(p_{u}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}+\mathbf{\Psi}_{\mathrm{II}}\right)^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}, (11)
εII=Tr[𝐂˙Rpu𝐂˙R𝚽II(pu𝚽IIH𝐂˙R𝚽II+𝚿II)1𝚽IIH𝐂˙R].\varepsilon_{\text{II}}=\operatorname{Tr}\left[\dot{\mathbf{C}}_{\mathrm{R}}-p_{u}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\left(p_{u}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}+\mathbf{\Psi}_{\mathrm{II}}\right)^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}\right]. (12)

III-B Multi-user Case with Hardware Impairments

For the case with multi-user, there are three phases that consist of τ1\tau_{1}, τ2\tau_{2} and τ3\tau_{3} time slots, respectively. In the first phase, all the reflecting elements are switched off, and the BS estimates the direct channels of all users 𝐡k,d\mathbf{h}_{k,\mathrm{d}}, k{1,2,,K}k\in\left\{1,2,\dots,K\right\}. Each user kk transmits the pilot ak(i)a_{k}^{(i)} to the BS at the ii-th time slot, i=1,,τ1i=1,\dots,\tau_{1}. The pilot sequence of different users are set as orthogonal to each other, i.e.,

[𝒂1,,𝒂K]T[𝒂1,,𝒂K]=τ1pu𝐈.[\boldsymbol{a}_{1},\cdots,\boldsymbol{a}_{K}]^{\mathrm{T}}[\boldsymbol{a}_{1},\cdots,\boldsymbol{a}_{K}]^{\mathrm{*}}=\tau_{1}p_{u}\mathbf{I}. (13)

Then, the received signals at the BS over the whole phase can be expressed as

𝐘I=[𝒚(1),,𝒚(τ1)]=\displaystyle\mathbf{Y}_{\mathrm{I}}=[\boldsymbol{y}^{(1)},\cdots,\boldsymbol{y}^{(\tau_{1})}]= [𝐡1,d,,𝐡K,d][𝒂1,,𝒂K]T+[𝜼b(1),,𝜼b(τ1)]\displaystyle\left[\mathbf{h}_{1,\mathrm{d}},\dots,\mathbf{h}_{K,\mathrm{d}}\right][\boldsymbol{a}_{1},\cdots,\boldsymbol{a}_{K}]^{\mathrm{T}}+[\boldsymbol{\eta}^{(1)}_{b},\cdots,\boldsymbol{\eta}^{(\tau_{1})}_{b}] (14)
+\displaystyle+ [𝐡1,d,,𝐡K,d][𝜼1,,𝜼K]T+[𝒏(1),,𝒏(τ1)].\displaystyle\left[\mathbf{h}_{1,\mathrm{d}},\dots,\mathbf{h}_{K,\mathrm{d}}\right][\boldsymbol{\eta}_{1},\cdots,\boldsymbol{\eta}_{K}]^{\mathrm{T}}+[\boldsymbol{n}^{(1)},\cdots,\boldsymbol{n}^{(\tau_{1})}].

In this case, the LMMSE estimator for direct channel and its MSE, respectively, are

[𝐡^1,d,,𝐡^K,d]=βd𝐘I[𝒂1,,𝒂K]βdτ1(pu+vu)+vb+σb2,\left[\hat{\mathbf{h}}_{1,\mathrm{d}},\dots,\hat{\mathbf{h}}_{K,\text{d}}\right]=\frac{\beta_{d}\mathbf{Y}_{\mathrm{I}}[\boldsymbol{a}_{1},\cdots,\boldsymbol{a}_{K}]^{\mathrm{*}}}{\beta_{d}\tau_{1}\left(p_{u}+v_{u}\right)+v_{b}+\sigma^{2}_{b}}, (15)
εI=K[Mβdτ1puMβd2βdτ1(pu+vu)+vb+σb2].\varepsilon_{\text{I}}=K\left[M\beta_{d}-\frac{\tau_{1}p_{u}M\beta^{2}_{d}}{\beta_{d}\tau_{1}\left(p_{u}+v_{u}\right)+v_{b}+\sigma^{2}_{b}}\right]. (16)

In the second phase, all the reflecting elements are switched on, but only user 1 is permitted to transmit the pilot symbols to the BS. Then, the BS estimates the reflected cascade channel [𝐡1,1,,𝐡1,N]\left[\mathbf{h}_{1,1},\cdots,\mathbf{h}_{1,N}\right] of this user. This phase is same with that of the single-user case.

In the third phase, all the users except user 1 transmit the pilot symbols to the BS. There exist relationships between the reflected cascade channel of user 1 and that of the other users:

𝐡k,n=[𝐡k,r]n[𝐡1,r]n𝐡1,n=λk,n𝐡1,n,k=2,,K;n=1,,N.\mathbf{h}_{k,n}=\frac{\left[\mathbf{h}_{k,\mathrm{r}}\right]_{n}}{\left[\mathbf{h}_{1,\mathrm{r}}\right]_{n}}\mathbf{h}_{1,n}=\lambda_{k,n}\mathbf{h}_{1,n},\;k=2,\dots,K;\;n=1,\dots,N. (17)

By exploiting the channel correlations in Eq. (17), the BS only needs to estimate the (K1)N(K-1)N parameters λ2,n,,λK,n\lambda_{2,n},\cdots,\lambda_{K,n}, n=1,,Nn=1,\dots,N. With the imperfect estimations of 𝐡k,d\mathbf{h}_{k,\mathrm{d}} and 𝐡1,n\mathbf{h}_{1,n}, and canceling the interference caused by direct channels, the received signal at the ii-th time slot, i=τ2+1,,τ3i=\tau_{2}+1,\dots,\tau_{3}, is given as follows:

𝒚~(i)=𝒚(i)k=2Kak(i)𝐡^k,d\displaystyle\;\tilde{\boldsymbol{y}}^{(i)}=\boldsymbol{y}^{(i)}-\sum_{k=2}^{K}a^{(i)}_{k}\hat{\mathbf{h}}_{k,\text{d}} (18)
=k=2Kn=1Nak(i)ej(θn(i)+Δθn(i))λk,n𝐡^1,nDesired Signals+k=2Kηu(i)𝐡^k,d+k=2Kn=1Nηu(i)ej(θn(i)+Δθn(i))λk,n𝐡^1,n+𝜼b(i)Hardware Impairments\displaystyle=\underbrace{\sum_{k=2}^{K}\sum_{n=1}^{N}a^{(i)}_{k}e^{j\left(\theta^{(i)}_{n}+\Delta\theta^{(i)}_{n}\right)}\lambda_{k,n}\hat{\mathbf{h}}_{1,n}}_{\text{Desired Signals}}+\underbrace{\sum_{k=2}^{K}\eta^{(i)}_{u}\hat{\mathbf{h}}_{k,\text{d}}+\sum_{k=2}^{K}\sum_{n=1}^{N}\eta^{(i)}_{u}e^{j\left(\theta^{(i)}_{n}+\Delta\theta^{(i)}_{n}\right)}\lambda_{k,n}\hat{\mathbf{h}}_{1,n}+\boldsymbol{\eta}_{b}^{(i)}}_{\text{Hardware Impairments}}
+k=2K(ak(i)+ηu(i))(𝐡k,d𝐡^k,d)+k=2Kn=1N(ak(i)+ηu(i))ej(θn(i)+Δθn(i))λk,n(𝐡1,n𝐡^1,n)Estimation Errors+𝒏(i).\displaystyle+\;\underbrace{\sum_{k=2}^{K}\left(a^{(i)}_{k}+\eta^{(i)}_{u}\right)\left({\mathbf{h}}_{k,\text{d}}-\hat{\mathbf{h}}_{k,\mathrm{d}}\right)+\sum_{k=2}^{K}\sum_{n=1}^{N}\left(a^{(i)}_{k}+\eta^{(i)}_{u}\right)e^{j\left(\theta^{(i)}_{n}+\Delta\theta^{(i)}_{n}\right)}\lambda_{k,n}\left(\mathbf{h}_{1,n}-\hat{\mathbf{h}}_{1,n}\right)}_{\text{Estimation Errors}}+\;\boldsymbol{n}^{(i)}.

Furthermore, we utilize the orthogonal transmission and reflection strategy[12]. Specifically, at each time slot ii, only one user kik_{i} is permitted to transmit pilot symbol, and only MM reflecting elements, denoted by set Δi\Delta_{i}, are switched on, such that the BS is able to estimate the reflected cascade channels 𝐡ki,n\mathbf{h}_{k_{i},n}, nΔin\in\Delta_{i}. As a result, for user kik_{i}, N/M\lceil N/M\rceil time slots are allocated to estimate its reflected cascade channels. Then, the received signal in Eq. (18) reduces to

𝒚~(i)\displaystyle\tilde{\boldsymbol{y}}^{(i)} =nΔiaki(i)ej(θn(i)+Δθn(i))λki,n𝐡^1,nDesired Signals+ηu(i)𝐡^ki,d+nΔiηu(i)ej(θn(i)+Δθn(i))λki,n𝐡^1,n+𝜼b(i)Hardware Impairments\displaystyle=\underbrace{\sum_{n\in\Delta_{i}}a^{(i)}_{k_{i}}e^{j\left(\theta^{(i)}_{n}+\Delta\theta^{(i)}_{n}\right)}\lambda_{k_{i},n}\hat{\mathbf{h}}_{1,n}}_{\text{Desired Signals}}+\underbrace{\eta^{(i)}_{u}\hat{\mathbf{h}}_{k_{i},\text{d}}+\sum_{n\in\Delta_{i}}\eta^{(i)}_{u}e^{j\left(\theta^{(i)}_{n}+\Delta\theta^{(i)}_{n}\right)}\lambda_{k_{i},n}\hat{\mathbf{h}}_{1,n}+\boldsymbol{\eta}_{b}^{(i)}}_{\text{Hardware Impairments}} (19)
+(aki(i)+ηu(i))(𝐡ki,d𝐡^ki,d)+nΔi(aki(i)+ηu(i))ej(θn(i)+Δθn(i))λki,n(𝐡1,n𝐡^1,n)Estimation Errors+𝒏(i).\displaystyle+\underbrace{\left(a^{(i)}_{k_{i}}+\eta^{(i)}_{u}\right)\left({\mathbf{h}}_{k_{i},\text{d}}-\hat{\mathbf{h}}_{k_{i},\text{d}}\right)+\sum_{n\in\Delta_{i}}\left(a^{(i)}_{k_{i}}+\eta^{(i)}_{u}\right)e^{j\left(\theta^{(i)}_{n}+\Delta\theta^{(i)}_{n}\right)}\lambda_{k_{i},n}\left(\mathbf{h}_{1,n}-\hat{\mathbf{h}}_{1,n}\right)}_{\text{Estimation Errors}}+\;\boldsymbol{n}^{(i)}.

For convenience, we denote 𝒛III(i)\boldsymbol{z}^{(i)}_{\text{III}} as the overall noise at the ii-th time slot, consisting of hardware impairments, estimation errors and AWGN in Eq. (19). We set the RIS phase shifts as zero. Then, the received signal at the ii-th time slot can be simplified as

𝒚~(i)=aki(i)𝐆1,i𝝀ki,i+𝒛III(i),\tilde{\boldsymbol{y}}^{(i)}=a^{(i)}_{k_{i}}\mathbf{G}_{1,i}\boldsymbol{\lambda}_{k_{i},i}+\boldsymbol{z}^{(i)}_{\text{III}}, (20)

where

𝝀ki,i=[λki,Δi(1),,λki,Δi(|Δi|)]T,\quad\boldsymbol{\lambda}_{k_{i},i}=[\lambda_{k_{i},\Delta_{i}(1)},\dots,\lambda_{k_{i},\Delta_{i}(|\Delta_{i}|)}]^{\mathrm{T}}, (21)
𝐆^1,i=[ejΔθΔi(1)(i)𝐡^1,Δi(1),,ejΔθΔi(|Δi|)(i)𝐡^1,Δi(|Δi|)],\hat{\mathbf{G}}_{1,i}=[e^{j\Delta\theta^{(i)}_{\Delta_{i}(1)}}\hat{\mathbf{h}}_{1,\Delta_{i}(1)},\dots,e^{j\Delta\theta^{(i)}_{\Delta_{i}(|\Delta_{i}|)}}\hat{\mathbf{h}}_{1,\Delta_{i}(|\Delta_{i}|)}], (22)
𝒛III(i)=ηu(i)𝐆1,i𝝀ki,i+𝜼b(i)+(aki(i)+ηu(i))(𝐡ki,d𝐡^ki,d)+(ak(i)+ηu(i))(𝐆1,i𝐆^1,i)𝝀ki,i+𝒏(i).\boldsymbol{z}^{(i)}_{\text{III}}=\eta^{(i)}_{u}\mathbf{G}_{1,i}\boldsymbol{\lambda}_{k_{i},i}+\boldsymbol{\eta}_{b}^{(i)}+\left(a^{(i)}_{k_{i}}+\eta^{(i)}_{u}\right)\left({\mathbf{h}}_{k_{i},\text{d}}-\hat{\mathbf{h}}_{k_{i},\text{d}}\right)+\left(a^{(i)}_{k}+\eta^{(i)}_{u}\right)\left(\mathbf{G}_{1,i}-\hat{\mathbf{G}}_{1,i}\right)\boldsymbol{\lambda}_{k_{i},i}+\boldsymbol{n}^{(i)}. (23)

We observe that the estimation of channel 𝐆1,i\mathbf{G}_{1,i} can be sufficiently accurate by increasing the pilot sequence length τ2\tau_{2} in the second phase. Thus, the estimation error term in Eq. (23) can be omitted. We define 𝐂ki,i=𝔼[𝝀ki,i𝝀ki,iH]\mathbf{C}_{k_{i},i}=\mathbb{E}[\boldsymbol{\lambda}_{k_{i},i}\boldsymbol{\lambda}_{k_{i},i}^{\mathrm{H}}]. Then, the covariance matrix of 𝒛III(i)\boldsymbol{z}^{(i)}_{\text{III}} is

𝚿III=𝔼[𝒛III(i)𝒛III(i)H]=vu𝐆1,i𝐂ki,i𝐆1,iH+(vb+σb2+(pu+vu)εIKM)𝐈.\mathbf{\Psi}_{\mathrm{III}}=\mathbb{E}\left[\boldsymbol{z}^{(i)}_{\text{III}}\boldsymbol{z}^{(i)\mathrm{H}}_{\text{III}}\right]=v_{u}{\mathbf{G}}_{1,i}\mathbf{C}_{k_{i},i}{\mathbf{G}}_{1,i}^{\mathrm{H}}+\left(v_{b}+\sigma_{b}^{2}+\frac{\left(p_{u}+v_{u}\right)\varepsilon_{\text{I}}}{KM}\right)\mathbf{I}. (24)

The LMMSE channel estimator in the third phase and its MSE are respectively given by

𝝀^ki,i=pu𝐂ki,i𝐆1,iH(pu𝐆1,i𝐂ki,i𝐆1,iH+𝚿III)1𝒚~(i),\hat{\boldsymbol{\lambda}}_{k_{i},i}=\sqrt{p_{u}}\mathbf{C}_{k_{i},i}\mathbf{G}_{1,i}^{\mathrm{H}}\left(p_{u}\mathbf{G}_{1,i}\mathbf{C}_{k_{i},i}\mathbf{G}_{1,i}^{\mathrm{H}}+\mathbf{\Psi}_{\mathrm{III}}\right)^{-1}\tilde{\boldsymbol{y}}^{(i)}, (25)
εIII=Tr(𝐂ki,ipu𝐂ki,i𝐆1,iH(pu𝐆1,i𝐂ki,i𝐆1,iH+𝚿III)1𝐆1,i𝐂ki,i).\varepsilon_{\text{III}}=\operatorname{Tr}\left(\mathbf{C}_{k_{i},i}-p_{u}\mathbf{C}_{k_{i},i}\mathbf{G}_{1,i}^{\mathrm{H}}\left(p_{u}\mathbf{G}_{1,i}\mathbf{C}_{k_{i},i}\mathbf{G}_{1,i}^{\mathrm{H}}+\mathbf{\Psi}_{\mathrm{III}}\right)^{-1}\mathbf{G}_{1,i}\mathbf{C}_{k_{i},i}\right). (26)

III-C Impact of Hardware Impairments on Channel Estimations for RIS-assisted Systems

In this subsection, we analyze the impact of hardware impairments on channel estimations for RIS-assisted systems, and present two corollaries about the channel estimation error floor and how to reduce the impact of hardware impairments. Before giving these two corollaries, we first summarize the previous two subsections, and give the following theorem:

Theorem 1.

(LMMSE Channel Estimator and Its MSE with Hardware Impairments)

By utilizing the three-phase based channel estimation framework[12], the LMMSE estimators of direct channel(s) and cascaded channel(s) in an RIS-assisted system with hardware impairments in the cases of single-user and multi-user are given in Eqs. (7), (11), (15) and (25), respectively, and their corresponding MSEs are given in Eqs. (8), (12), (16) and (26).

Proof:

Subsection A and B in this section constitute the proof of this theorem. ∎

Corollary 1.

(Channel Estimation Error Floor Caused by Hardware Impairments)

The estimation error per element in the direct channel is independent of the antenna number MM and reflecting element number NN. The estimation error per element in the cascade channel is independent of the antenna number MM, but depends on the reflecting element number NN. The estimation error per element is a decreasing function of the pilot power, but does not converge to zero when the pilot power tends to infinity. The error floors of two phases in the case of single-user are respectively given as follows:

μI=βdτ1βdτ1+κu+κb+κuκb,\mu_{\mathrm{I}}=\beta_{d}-\frac{\tau_{1}\beta_{d}}{\tau_{1}+\kappa_{u}+\kappa_{b}+\kappa_{u}\kappa_{b}}, (27)
μII=βrτ2βr2(κu+κb+κuκb)(βd+Nβr)+τ2μI+τ2βr.\mu_{\mathrm{II}}=\beta_{r}-\frac{\tau_{2}\beta_{r}^{2}}{\left(\kappa_{u}+\kappa_{b}+\kappa_{u}\kappa_{b}\right)\left(\beta_{d}+N\beta_{r}\right)+\tau_{2}\mu_{\mathrm{I}}+\tau_{2}\beta_{r}}. (28)
Proof:

First, we consider the MSE of direct channel estimation in the first phase. In the high pilot power regime, the AWGN in the denominator of Eq. (8) can be omitted, we have

μI=limpuεIM=βdτ1puβd2βd(τ1pu+vu)+vb=βdτ1βdτ1+κu+κb+κuκb.\mu_{\mathrm{I}}=\lim_{p_{u}\rightarrow\infty}\frac{\varepsilon_{\text{I}}}{M}=\beta_{d}-\frac{\tau_{1}p_{u}\beta^{2}_{d}}{\beta_{d}\left(\tau_{1}p_{u}+v_{u}\right)+v_{b}}=\beta_{d}-\frac{\tau_{1}\beta_{d}}{\tau_{1}+\kappa_{u}+\kappa_{b}+\kappa_{u}\kappa_{b}}. (29)

Then, we consider the MSE of cascade channel estimation in the second phase. By utilizing the matrix inversion lemma: Woodbury formula444 Let 𝐀\mathbf{A} be an m×mm\times m invertible matrix, 𝐁\mathbf{B} be an n×nn\times n invertible matrix, and 𝐔\mathbf{U} and 𝐕\mathbf{V} be m×nm\times n and n×mn\times m matrices, respectively, such that (𝐀+𝐔𝐁𝐕)(\mathbf{A}+\mathbf{U}\mathbf{B}\mathbf{V}) is invertible, then it holds that (𝐀+𝐔𝐁𝐕)1=𝐀1𝐀1𝐔(𝐈+𝐁𝐕𝐀1𝐔)1𝐁𝐕𝐀1(\mathbf{A}+\mathbf{U}\mathbf{B}\mathbf{V})^{-1}=\mathbf{A}^{-1}-\mathbf{A}^{-1}\mathbf{U}\left(\mathbf{I}+\mathbf{B}\mathbf{V}\mathbf{A}^{-1}\mathbf{U}\right)^{-1}\mathbf{B}\mathbf{V}\mathbf{A}^{-1}. [36], the inverse matrix of (pu𝚽IIH𝐂˙R𝚽II+𝚿II)(p_{u}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}+\mathbf{\Psi}_{\mathrm{II}}) in Eq. (12) can be expressed as follows:

(pu𝚽IIH𝐂˙R𝚽II+𝚿II)1=𝚿II1pu𝚿II1𝚽IIH(𝐈+pu𝐂˙R𝚽II𝚿II1𝚽IIH)1𝐂˙R𝚽II𝚿II1.\left(p_{u}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}+\mathbf{\Psi}_{\mathrm{II}}\right)^{-1}=\mathbf{\Psi}_{\mathrm{II}}^{-1}-p_{u}\mathbf{\Psi}_{\mathrm{II}}^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\left(\mathbf{I}+p_{u}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\mathbf{\Psi}_{\mathrm{II}}^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\right)^{-1}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\mathbf{\Psi}_{\mathrm{II}}^{-1}. (30)

Substituting Eq. (30) into Eq. (12) yields

εII=\displaystyle\varepsilon_{\text{II}}= Tr{𝐂˙Rpu𝐂˙R𝚽II𝚿II1𝚽IIH𝐂˙R}\displaystyle\operatorname{Tr}\left\{\dot{\mathbf{C}}_{\mathrm{R}}-p_{u}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\mathbf{\Psi}_{\mathrm{II}}^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}\right\} (31)
+\displaystyle+ Tr{pu2𝐂˙R𝚽II𝚿II1𝚽IIH(𝐈+pu𝐂˙R𝚽II𝚿II1𝚽IIH)1𝐂˙R𝚽II𝚿II1𝚽IIH𝐂˙R}.\displaystyle\operatorname{Tr}\left\{p_{u}^{2}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\mathbf{\Psi}_{\mathrm{II}}^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\left(\mathbf{I}+p_{u}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\mathbf{\Psi}_{\mathrm{II}}^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\right)^{-1}\dot{\mathbf{C}}_{\mathrm{R}}{\mathbf{\Phi}}_{\mathrm{II}}\mathbf{\Psi}_{\mathrm{II}}^{-1}{\mathbf{\Phi}}_{\mathrm{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}\right\}.

Since we set 𝚽II\mathbf{\Phi}_{\text{II}} based on the DFT matrix, it holds that [𝚽II]:,m×[𝚽II]:,mH=N[\mathbf{\Phi}_{\text{II}}]_{:,m}\times[\mathbf{\Phi}_{\text{II}}]_{:,m}^{\mathrm{H}}=N. Thus, the first term vudiag(𝚽IIH𝐂˙R𝚽II)v_{u}\operatorname{diag}(\mathbf{\Phi}_{\text{II}}^{\mathrm{H}}\dot{\mathbf{C}}_{\mathrm{R}}\mathbf{\Phi}_{\text{II}}) of 𝚿II\mathbf{\Psi}_{\mathrm{II}} in Eq. (10) can be simplified as vuMNβr𝐈v_{u}MN\beta_{r}\mathbf{I}. Then, 𝚿II\mathbf{\Psi}_{\mathrm{II}} is a diagonal matrix, and its inverse matrix can be easily obtained by

𝚿II1=1Mvu(βd+Nβr)+vb+τ2puεIM+σb2𝐈ψ𝐈.\mathbf{\Psi}_{\mathrm{II}}^{-1}=\frac{\frac{1}{M}}{v_{u}\left(\beta_{d}+N\beta_{r}\right)+v_{b}+\tau_{2}p_{u}\frac{\varepsilon_{\text{I}}}{M}+\sigma^{2}_{b}}\mathbf{I}\;\triangleq\;\psi\mathbf{I}. (32)

Since 𝚽II\mathbf{\Phi}_{\text{II}} is constructed based on the DFT matrix and τ2>N\tau_{2}>N, it follows that 𝚽II𝚽IIH=τ2𝐈\mathbf{\Phi}_{\text{II}}\mathbf{\Phi}_{\text{II}}^{\mathrm{H}}=\tau_{2}\mathbf{I}. By substituting Eq. (32) into Eq. (31), the MSE εII\varepsilon_{\text{II}} can be rewritten as

εII=\displaystyle\varepsilon_{\text{II}}= Tr{𝐂˙Rpuτ2ψ𝐂˙R𝐂˙R}\displaystyle\operatorname{Tr}\left\{\dot{\mathbf{C}}_{\mathrm{R}}-p_{u}\tau_{2}\psi\dot{\mathbf{C}}_{\mathrm{R}}\dot{\mathbf{C}}_{\mathrm{R}}\right\} (33)
+\displaystyle+ Tr{pu2τ22ψ2𝐂˙R(𝐈+puτ2ψ𝐂˙R)1𝐂˙R𝐂˙R}\displaystyle\operatorname{Tr}\left\{p_{u}^{2}\tau_{2}^{2}\psi^{2}\dot{\mathbf{C}}_{\mathrm{R}}\left(\mathbf{I}+p_{u}\tau_{2}\psi\dot{\mathbf{C}}_{\mathrm{R}}\right)^{-1}\dot{\mathbf{C}}_{\mathrm{R}}\dot{\mathbf{C}}_{\mathrm{R}}\right\}
=\displaystyle= MNβr1+puψτ2Mβr.\displaystyle\;\frac{MN\beta_{r}}{1+p_{u}\psi\tau_{2}M\beta_{r}}.

When the pilot power tends to infinity, i.e., the transmit power pup_{u} tends to infinity, we have

limpupuψ=1M(κu+κb+κuκb)(βd+Nβr)+τ2μI.\lim_{p_{u}\rightarrow\infty}p_{u}\psi=\frac{\frac{1}{M}}{\left(\kappa_{u}+\kappa_{b}+\kappa_{u}\kappa_{b}\right)\left(\beta_{d}+N\beta_{r}\right)+\tau_{2}\mu_{\text{I}}}. (34)

Substituting this limit into Eq. (33) yields

μII=limpuεIIMN=βrτ2βr2(κu+κb+κuκb)(βd+Nβr)+τ2μI+τ2βr.\mu_{\text{II}}=\lim_{p_{u}\rightarrow\infty}\frac{\varepsilon_{\text{II}}}{MN}=\beta_{r}-\frac{\tau_{2}\beta_{r}^{2}}{\left(\kappa_{u}+\kappa_{b}+\kappa_{u}\kappa_{b}\right)\left(\beta_{d}+N\beta_{r}\right)+\tau_{2}\mu_{\text{I}}+\tau_{2}\beta_{r}}. (35)

Eqs. (29) and (35) are the non-zero estimation error floors and are independent of the antenna number MM, while Eq. (35) is dependent of the reflecting element number NN. ∎

The extension of Corollary 1 to the scenario of multi-user is straightforward, and we omit it due to space limitation. Although perfect estimation accuracy cannot be achieved by increasing the pilot power due to the existence of hardware impairments, we can improve the MSE by increasing the pilot length, which is presented in the following corollary.

Corollary 2.

(Reduce the Impact of Hardware Impairments by Increasing Pilot Length)

Contrary to Corollary 1 that the MSE is limited by the non-zero error floor when we increase the pilot power, the MSE can be reduced to zero by increasing the pilot length although the hardware of RIS-assisted system is non-ideal.

Proof:

First, we consider the MSE of direct channel estimation in the first phase. When the pilot length τ1\tau_{1} tends to infinity, the terms with no respect to τ1\tau_{1} in Eq. (8) can be omitted, and we obtain the limit of εI\varepsilon_{\text{I}} as follows:

limτ1εI=Mβdτ1puMβd2τ1puβd=0.\lim_{\tau_{1}\rightarrow\infty}{\varepsilon_{\text{I}}}=M\beta_{d}-\frac{\tau_{1}p_{u}M\beta_{d}^{2}}{\tau_{1}p_{u}\beta_{d}}=0. (36)

Then, we consider the MSE of cascade channel estimation in the second phase. When the pilot lengths τ1\tau_{1} and τ2\tau_{2} tend to infinity, we have the following limit:

limτ1,τ2ψτ2=limτ21Mτ2vu(βd+Nβr)+vb+1Mτ2pu(limτ1εI)+σb2=1pu1limτ1εI=.\lim_{\tau_{1},\tau_{2}\rightarrow\infty}\psi\tau_{2}=\lim_{\tau_{2}\rightarrow\infty}\frac{\frac{1}{M}\tau_{2}}{v_{u}\left(\beta_{d}+N\beta_{r}\right)+v_{b}+\frac{1}{M}\tau_{2}p_{u}\left(\mathop{\lim}\limits_{\tau_{1}\rightarrow\infty}\varepsilon_{\text{I}}\right)+\sigma^{2}_{b}}=\frac{1}{p_{u}}\frac{1}{\mathop{\lim}\limits_{\tau_{1}\rightarrow\infty}\varepsilon_{\text{I}}}=\infty. (37)

Substituting this limit into Eq. (33) yields

limτ1,τ2εII=MNβr1+puMβr(limτ1,τ2ψτ2)=0.\lim_{\tau_{1},\tau_{2}\rightarrow\infty}{\varepsilon_{\text{II}}}=\frac{MN\beta_{r}}{1+p_{u}M\beta_{r}\left(\mathop{\lim}\limits_{\tau_{1},\tau_{2}\rightarrow\infty}\psi\tau_{2}\right)}=0. (38)

Eqs. (36) and (38) indicate that the MSE can be reduced to zero by increasing the pilot length although we have non-ideal hardwares, which proves the statement of this corollary. ∎

III-D Numerical Results

In this subsection, we provide numerical results, which include theoretical characterizations and Monte Carlo simulations, to illustrate the channel estimation performance of the RIS-assisted wireless system with hardware impairments, and verify the validity of the two derived corollaries.

We assume that the BS is equipped with M=10M=10 antennas and the RIS is equipped with N=25N=25 reflecting elements. The coefficients of impairment levels are chosen from the set of {0,0.012,0.052,0.102}\{0,0.01^{2},0.05^{2},0.10^{2}\}. First, we show the estimation error per entry in the direct channel and the cascaded channel versus SNR which is defined as puσb2\frac{p_{u}}{\sigma_{b}^{2}} in Fig. 2 and Fig. 3, respectively. The theoretical characterizations match the Monte Carlo simulations perfectly. It is observed that the estimation error is a decreasing function of SNR or pilot power. It is also confirmed that there exist non-zero error floors at high SNRs, i.e., perfect channel estimation accuracy cannot be achieved by increasing the pilot power, which is proved in corollary 1. The error floor increases with the impairment level. Moreover, by comparing Fig. 2 and Fig. 3, we observe that the error floor of cascade channel estimation is slightly larger than that of direct channel estimation due to that the interference caused by direct channel cannot be completely canceled when we estimate the cascaded channel. However, the error floor of cascaded channel estimation can be reached faster, i.e., only low pilot power is needed to fully utilize the RIS-assisted system.

  
[Uncaptioned image]
Figure 3: The estimation error per entry in cascaded channel versus SNR with different impairment levels.
  
[Uncaptioned image]
Figure 5: The cascaded channel estimation error floor versus reflecting element number with different impairment levels.

Next, we illustrate the improvement in estimation accuracy by increasing the pilot length in Fig. 4. It is observed that the channel estimation error can be reduced to zero by increasing the pilot length although the hardware of RIS-assisted systems is non-ideal, which is proved in Corollary 2. The decline rate of direct channel estimation error is more rapid than that of cascaded channel estimation error when we increase the pilot length. In addition, we also give the relationship between the cascaded channel estimation error floor and the reflecting element number in Fig. 5. It is observed that the error floor increases with the reflecting element number and the impairment level. This indicates that although using more reflecting elements can bring more spectral gains, it increases the cascaded channel estimation error.

IV Beamforming Design and Channel Capacity Analysis

In this section, we optimize the joint (active) transmit and (passive) reflect beamforming, and derive the channel capacities of the uplink and downlink. In each coherence period τ\tau, by utilizing the channel estimation strategy analyzed in the previous section, the BS obtains an imperfect CSI b\mathcal{H}_{b} of the actual channel state \mathcal{H}, and the user obtains an imperfect CSI u\mathcal{H}_{u}. Based on the estimated CSI, the BS and the user select the conditional probability distribution of the transmitted data signal which we respectively denote as f(𝒙|b)f(\boldsymbol{x}|\mathcal{H}_{b}) and f(x|u)f({x}|\mathcal{H}_{u}). Then, the channel capacities of the uplink and downlink can be expressed as

Cu=τuτ𝔼{max(x;𝒚|,b,u)},{{C}}_{u}=\frac{\tau_{u}}{\tau}\;\mathbb{E}\left\{\max\;\mathcal{I}\left(x;\boldsymbol{y}|\mathcal{H},\mathcal{H}_{b},\mathcal{H}_{u}\right)\right\}, (39)
Cd=τdτ𝔼{max(𝒙;y|,b,u)},{{C}}_{d}=\frac{\tau_{d}}{\tau}\;\mathbb{E}\left\{\max\;\mathcal{I}\left(\boldsymbol{x};y|\mathcal{H},\mathcal{H}_{b},\mathcal{H}_{u}\right)\right\}, (40)

where (x;𝒚|,b,u)\mathcal{I}\left(x;\boldsymbol{y}|\mathcal{H},\mathcal{H}_{b},\mathcal{H}_{u}\right) and (𝒙;y|,b,u)\mathcal{I}\left(\boldsymbol{x};y|\mathcal{H},\mathcal{H}_{b},\mathcal{H}_{u}\right) are the conditional mutual information, and τu\tau_{u} and τd\tau_{d} are the uplink and downlink data transmission periods, respectively. The expectations in Eqs. (39) and (40) are taken over the joint distribution of \mathcal{H}, b\mathcal{H}_{b} and u\mathcal{H}_{u}. The maximizations in Eqs. (39) and (40) require a joint optimization of the active transmit (receive) beamforming (combining) at the BS and the passive reflect beamforming at the RIS.

The upper bounds on the uplink and downlink channel capacities in Eqs. (39) and (40) can be obtained by adding extra channel knowledge and removing all interference. Thus, we assume that the BS and the user have perfect channel state information, i.e., b=u=\mathcal{H}_{b}=\mathcal{H}_{u}=\mathcal{H}. Since the receiver noise and the distortion noise caused by hardware impairments are circularly symmetric complex Gaussian distributed and independent of the useful signals under perfect CSI, Gaussian signaling is optimal in the uplink and downlink[37], and the single-stream transmission with rank(𝒙𝒙H)=1\operatorname{rank}(\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}})=1 is sufficient to achieve optimality[28]. We can set the transmitted data signal 𝒙=𝒘bdxb\boldsymbol{x}=\boldsymbol{w}_{b}^{d}x_{b} for xb𝒞𝒩(0,pb)x_{b}\sim\mathcal{C}\mathcal{N}\left(0,p_{b}\right) at the BS and the transmitted data signal x𝒞𝒩(0,pu)x\sim\mathcal{C}\mathcal{N}\left(0,p_{u}\right) at the user, where 𝒘bd\boldsymbol{w}_{b}^{d} is the unit-form beamforming vector[26].

To derive the channel capacity, we should optimize the transmit beamforming vector 𝒘bd\boldsymbol{w}_{b}^{d} and the phase-shifting vector 𝜽\boldsymbol{\theta}. It is difficult due to the non-convex objective function as well as the unit-modulus constraints imposed by passive phase shifters. Although the existing researches on constant-envelope precoding[38, 39] and hybrid digital/analog processing[40, 41] have studied the beamforming optimizations under unit-modulus constraints, such designs are mainly restricted to the transceivers. The joint active and passive beamforming optimization has not been addressed. Moreover, considering hardware impairments increases the complexity of optimization, and no existing works have analyzed the reflect beamforming optimization under hardware impairments. To address this issue, we decouple the problem into two subproblems where we first optimize the transmit beamforming vector 𝒘bd\boldsymbol{w}_{b}^{d} to maximize the receive SNR for a given phase-shifting vector 𝜽\boldsymbol{\theta}, and then we optimize the phase-shifting vector 𝜽\boldsymbol{\theta} based on the optimal transmit beamforming.

IV-A Transmit Beamforming Optimization

For any given phase shift at the RIS with ideal hardware, it can be verified that the maximum-ratio transmission (MRT) is the optimal solution[17, 21]. Referring to[26], this conclusion can be extended to the case with non-negligible hardware impairments, which is shown as follows.

Theorem 2.

For any given phase shift at the RIS, the receive combining vector 𝐰bu\boldsymbol{w}_{b}^{u} and the transmit beamforming vector 𝐰bd\boldsymbol{w}_{b}^{d}, which maximize the receive SNR in the RIS-assisted wireless communication system with hardware impairments, are respectively given by

𝒘bu=𝐔1𝐡^H𝐔1𝐡^H2,𝒘bd=𝐃1𝐡^𝐃1𝐡^2,\boldsymbol{w}_{b}^{u}=\frac{\mathbf{U}^{-1}\hat{\mathbf{h}}^{\mathrm{H}}}{\;\left\|\mathbf{U}^{-1}\hat{\mathbf{h}}^{\mathrm{H}}\right\|_{2}},\quad\boldsymbol{w}_{b}^{d}=\frac{\mathbf{D}^{-1}\hat{\mathbf{h}}}{\;\left\|\mathbf{D}^{-1}\hat{\mathbf{h}}\right\|_{2}}, (41)

and the matrices 𝐔\mathbf{U} and 𝐃\mathbf{D} in Eq. (41) are given by

𝐔=(1+κu)κbdiag(𝐡^𝐡^H)+κu𝐡^𝐡^H+σb2pu𝐈,\mathbf{U}=\left(1+\kappa_{u}\right)\kappa_{b}\operatorname{diag}(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}})+\kappa_{u}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}+\frac{\sigma_{b}^{2}}{p_{u}}\mathbf{I}, (42)
𝐃=(1+κu)κbdiag(𝐡^𝐡^H)+κu𝐡^𝐡^H+σu2pb𝐈,\mathbf{D}=\left(1+\kappa_{u}\right)\kappa_{b}\operatorname{diag}(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}})+\kappa_{u}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}+\frac{\sigma_{u}^{2}}{p_{b}}\mathbf{I}, (43)

where 𝐡^\hat{\mathbf{h}} represents the overall channel (𝐡d+𝐆𝚽^𝐡r)(\mathbf{h}_{\mathrm{d}}+\mathbf{G}\hat{\mathbf{\Phi}}\mathbf{h}_{\mathrm{r}}).

Proof:

Suppose that the phase-shifting vector 𝜽\boldsymbol{\theta} at the RIS is optimal, and then the upper bound of downlink channel capacity in Eq. (40) can be written as

Cdτdτ𝔼{max𝒘bd2=1log2(1+SNR(𝒘bd))},{C}_{d}\leq\frac{\tau_{d}}{\tau}\;\mathbb{E}\left\{\max_{\|\boldsymbol{w}_{b}^{d}\|_{2}=1}\log_{2}(1+\operatorname{SNR}(\boldsymbol{w}_{b}^{d}))\right\}, (44)

where

SNR(𝒘bd)=|𝐡^H𝒙|2𝐡^H𝚼B𝐡^+vu+σu2.\operatorname{SNR}(\boldsymbol{w}_{b}^{d})=\frac{|\hat{\mathbf{h}}^{\mathrm{H}}\boldsymbol{x}|^{2}}{\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{\Upsilon}_{\mathrm{B}}\hat{\mathbf{h}}+v_{u}+\sigma_{u}^{2}}. (45)

According to the models of hardware impairments established in section II, the term 𝐡^H𝚼B𝐡^\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{\Upsilon}_{\mathrm{B}}\hat{\mathbf{h}} in the denominator of Eq. (45) can be written as

𝐡^H𝚼B𝐡^=κb𝐡^Hdiag(𝒙𝒙H)𝐡^.\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{\Upsilon}_{\mathrm{B}}\hat{\mathbf{h}}=\kappa_{b}\hat{\mathbf{h}}^{\mathrm{H}}\operatorname{diag}\left(\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}}\right)\hat{\mathbf{h}}. (46)

Since the transmitted data signal at the BS has a form of 𝒙=𝒘bdxb\boldsymbol{x}=\boldsymbol{w}_{b}^{d}x_{b} and the variance of xbx_{b} is pbp_{b}, Eq. (46) can be rewritten as

𝐡^H𝚼B𝐡^=κbpb(𝒘bd)Hdiag(𝐡^𝐡^H)𝒘bd.\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{\Upsilon}_{\mathrm{B}}\hat{\mathbf{h}}=\kappa_{b}p_{b}\left(\boldsymbol{w}_{b}^{d}\right)^{\mathrm{H}}\operatorname{diag}\left(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}\right)\boldsymbol{w}_{b}^{d}. (47)

Similarly, the term |𝐡^H𝒙|2|\hat{\mathbf{h}}^{\mathrm{H}}\boldsymbol{x}|^{2} in the numerator of Eq. (45) and the term of vuv_{u} in the denominator of Eq. (45) can be, respectively, rewritten as

|𝐡^H𝒙|2=pb(𝒘bd)H𝐡^𝐡^H𝒘bd,|\hat{\mathbf{h}}^{\mathrm{H}}\boldsymbol{x}|^{2}=p_{b}\left(\boldsymbol{w}_{b}^{d}\right)^{\mathrm{H}}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}\boldsymbol{w}_{b}^{d}, (48)
vu=κupb(𝒘bd)H𝐡^𝐡^H𝒘bd+κu𝐡^H𝚼B𝐡^.v_{u}=\kappa_{u}p_{b}\left(\boldsymbol{w}_{b}^{d}\right)^{\mathrm{H}}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}\boldsymbol{w}_{b}^{d}+\kappa_{u}\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{\Upsilon}_{\mathrm{B}}\hat{\mathbf{h}}. (49)

Then, by substituting Eqs. (47), (48) and (49) into Eq. (45), we obtain

SNR(𝒘bd)=(𝒘bd)H𝐡^𝐡^H𝒘bd(𝒘bd)H𝐃𝒘bd,\operatorname{SNR}(\boldsymbol{w}_{b}^{d})=\frac{\left(\boldsymbol{w}_{b}^{d}\right)^{\mathrm{H}}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}\boldsymbol{w}_{b}^{d}\;}{\left(\boldsymbol{w}_{b}^{d}\right)^{\mathrm{H}}\mathbf{D}\boldsymbol{w}_{b}^{d}\;}, (50)

where 𝐃=(1+κu)κbdiag(𝐡^𝐡^H)+κu𝐡^𝐡^H+σu2pb𝐈\mathbf{D}=\left(1+\kappa_{u}\right)\kappa_{b}\operatorname{diag}(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}})+\kappa_{u}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}+\frac{\sigma_{u}^{2}}{p_{b}}\mathbf{I}. Function log2(1+SNR(𝒘bd))\log_{2}(1+\operatorname{SNR}(\boldsymbol{w}_{b}^{d})) in Eq. (44) has a structure of f(x)=log2(1+x)f(x)=\log_{2}(1+x), and f(x)f(x) is a monotonically increasing function. Consequently, the maximum of Eq. (44) can be obtained by maximizing the term SNR(𝒘bd)\operatorname{SNR}(\boldsymbol{w}_{b}^{d}) in Eq. (50), which is a generalized Rayleigh quotient problem. By solving this problem, the optimal transmit beamforming vector can be derived in Eq. (41). The proof of the optimal receive combining vector follows the similar procedures and here we omit them due to space limitation. ∎

Based on the optimal receive combining and transmit beamforming given in Theorem 2, we obtain the new upper bounds of the uplink and downlink channel capacities as follows:

Cuτuτ𝔼{max𝜽log2(1+𝐡^H𝐔1𝐡^)},{{C}}_{u}\leq\frac{\tau_{u}}{\tau}\;\mathbb{E}\left\{\max_{\boldsymbol{\theta}}\;\log_{2}(1+\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{U}^{-1}\hat{\mathbf{h}})\right\}, (51)
Cdτdτ𝔼{max𝜽log2(1+𝐡^H𝐃1𝐡^)}.{{C}}_{d}\leq\frac{\tau_{d}}{\tau}\;\mathbb{E}\left\{\max_{\boldsymbol{\theta}}\;\log_{2}(1+\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{D}^{-1}\hat{\mathbf{h}})\right\}. (52)

IV-B Reflect Beamforming Design

Based on the optimal transmit beamforming vector derived above, the reflect beamforming optimization can be analyzed in this subsection, which can be formulated as follows:

(P1):max𝜽\displaystyle\text{(P1)}:\quad\max_{\boldsymbol{\theta}} τdτlog2(1+𝐡^H𝐃1𝐡^)\displaystyle\quad\frac{\tau_{d}}{\tau}\log_{2}\left(1+\hat{\mathbf{h}}^{\mathrm{H}}\mathbf{D}^{-1}\hat{\mathbf{h}}\right) (53)
s.t.\displaystyle\operatorname{s.t.} 0θn2π,n=1,,N,\displaystyle\quad{0\leq\theta_{n}\leq 2\pi,\quad\forall n=1,\cdots,N},

where 𝐃=(1+κu)κbdiag(𝐡^𝐡^H)+κu𝐡^𝐡^H+σu2pb𝐈\mathbf{D}=\left(1+\kappa_{u}\right)\kappa_{b}\operatorname{diag}(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}})+\kappa_{u}\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}}+\frac{\sigma_{u}^{2}}{p_{b}}\mathbf{I}, and the optimization variable 𝜽\boldsymbol{\theta} is hidden in the overall channel vector 𝐡^\hat{\mathbf{h}}. By using Eq. (2.2) in[42]555 For a complex scalar τ\tau\in\mathbb{C}, a vector 𝒒N\boldsymbol{q}\in\mathbb{C}^{N}, and a matrix 𝑩N×N\boldsymbol{B}\in\mathbb{C}^{N\times N}, where 𝑩\boldsymbol{B} and (𝑩+τ𝒒𝒒H)(\boldsymbol{B}+\tau\boldsymbol{q}\boldsymbol{q}^{\mathrm{H}}) are invertible, it holds that 𝒒H(𝑩+τ𝒒𝒒H)1=𝒒H𝑩1/(1+τ𝒒H𝑩1𝒒)\boldsymbol{q}^{\mathrm{H}}(\boldsymbol{B}+\tau\boldsymbol{q}\boldsymbol{q}^{\mathrm{H}})^{-1}={\boldsymbol{q}^{\mathrm{H}}\boldsymbol{B}^{-1}}/{(1+\tau\boldsymbol{q}^{\mathrm{H}}\boldsymbol{B}^{-1}\boldsymbol{q})}. , problem (P1) can be transformed to the following equivalent problem:

(P2):max𝜽\displaystyle\text{(P2)}:\quad\max_{\boldsymbol{\theta}} τdτlog2(1+𝐡^H𝐃~1𝐡^1+κu𝐡^H𝐃~1𝐡^)\displaystyle\quad\frac{\tau_{d}}{\tau}\log_{2}\left(1+\frac{\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}}{1+\kappa_{u}\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}}\right) (54)
s.t.\displaystyle\operatorname{s.t.} 0θn2π,n=1,,N,\displaystyle\quad{0\leq\theta_{n}\leq 2\pi,\quad\forall n=1,\cdots,N},

where 𝐃~=(1+κu)κbdiag(𝐡^𝐡^H)+σu2pb𝐈\tilde{\mathbf{D}}=\left(1+\kappa_{u}\right)\kappa_{b}\operatorname{diag}(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}})+\frac{\sigma_{u}^{2}}{p_{b}}\mathbf{I}. Problem (P2) has a structure of f(x)=log2(1+x1+αx)f(x)=\log_{2}(1+\frac{x}{1+\alpha x}), α>0\alpha>0, and f(x)f(x) is a monotonically increasing function. Thus, problem (P2) can be optimized by maximizing 𝐡^H𝐃~1𝐡^\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}, which yields the following equivalent problem:

(P3):max𝜽\displaystyle\text{(P3)}:\quad\max_{\boldsymbol{\theta}} 𝐡^H𝐃~1𝐡^\displaystyle\quad\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}} (55)
s.t.\displaystyle\operatorname{s.t.} 0θn2π,n=1,,N.\displaystyle\quad{0\leq\theta_{n}\leq 2\pi,\quad\forall n=1,\cdots,N}.

According to the models of direct and reflected cascade channels established in section II, the overall channel vector 𝐡^=𝐡d+𝐆𝚽^𝐡r\hat{\mathbf{h}}=\mathbf{h}_{\mathrm{d}}+\mathbf{G}\hat{\mathbf{\Phi}}\mathbf{h}_{\mathrm{r}} can be equivalently expressed as 𝐡^=𝐡d+𝐇R𝒗\hat{\mathbf{h}}=\mathbf{h}_{\mathrm{d}}+\mathbf{H}_{\mathrm{R}}\boldsymbol{v}, where 𝒗=[ej(θ1+Δθ1),,ej(θN+ΔθN)]T\boldsymbol{v}=[e^{j(\theta_{1}+\Delta\theta_{1})},\cdots,e^{j(\theta_{N}+\Delta\theta_{N})}]^{\mathrm{T}}. This formulation enables the separation of the response at the RIS in 𝒗\boldsymbol{v} from the cascaded channel in 𝐇R\mathbf{H}_{\mathrm{R}}. Since 𝐃~\tilde{\mathbf{D}} is a diagonal matrix, the inverse matrix of it can be easily obtained by

𝐃~1=diag(1(1+κu)κb|hd,1+ϱ1T𝒗|2+σu2pb,,1(1+κu)κb|hd,M+ϱMT𝒗|2+σu2pb),\tilde{\mathbf{D}}^{-1}=\operatorname{diag}\left(\begin{array}[]{c}{\frac{1}{\left(1+\kappa_{u}\right)\kappa_{b}\left|{h}_{d,1}+\boldsymbol{\varrho}^{\mathrm{T}}_{1}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}}},\\ {\cdots},\\ {\frac{1}{\left(1+\kappa_{u}\right)\kappa_{b}\left|{h}_{d,M}+\boldsymbol{\varrho}^{\mathrm{T}}_{M}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}}}\end{array}\right), (56)

where hd,i{h}_{d,i} is the ii-th entry of the direct channel vector 𝐡d\mathbf{h}_{\mathrm{d}}, and ϱiT\boldsymbol{\varrho}^{\mathrm{T}}_{i} is the ii-th row vector of the cascaded channel matrix 𝐇R\mathbf{H}_{\mathrm{R}}. It should be noted that the phase errors of the reflecting elements are random and unknown to the BS, and the BS can only use the statistic characteristics of the phase errors, i.e., arg(𝔼[ejΔθi])=0\arg\left(\mathbb{E}[e^{j\Delta\theta_{i}}]\right)=0, to design the reflect beamforming, which yields 𝒗=[ejθ1,,ejθN]T\boldsymbol{v}=[e^{j\theta_{1}},\cdots,e^{j\theta_{N}}]^{\mathrm{T}}. In addition, the objective function is periodic with respect to θi\theta_{i} owing to the fact that ej(θi+2kπ)=ejθie^{j(\theta_{i}+2k\pi)}=e^{j\theta_{i}} (kk is an integer). Therefore, the constraints in problem (P3) can be omitted. Then, problem (P3) can be transformed to an unconstrained optimization problem:

(P4):max𝜽i=1M|hd,i+ϱiT𝒗|2(1+κu)κb|hd,i+ϱiT𝒗|2+σu2pb.\text{(P4)}:\;\max_{\boldsymbol{\theta}}\;\sum_{i=1}^{M}\frac{\left|{h}_{d,i}+\boldsymbol{\varrho}^{\mathrm{T}}_{i}\boldsymbol{v}\right|^{2}}{\left(1+\kappa_{u}\right)\kappa_{b}\left|{h}_{d,i}+\boldsymbol{\varrho}^{\mathrm{T}}_{i}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}}. (57)

We summarize the above result as the following proposition.

Proposition 1.

Based on the optimal transmit beamforming solution in Theorem 2, the reflect beamforming optimization, which is aimed to maximize the channel capacity of the RIS-assisted wireless communication system with hardware impairments, can be formulated as a non-convex optimization problem (P1), and can be simplified as an unconstrained optimization problem (P4).

Remark 1.

Problem (P4) has a different form with the reflect beamforming optimization problem solved by prior works where the problem is formulated as a non-convex quadratic constraint quadratic program (QCQP), e.g., [21, Eq. (4)], [14, Eq. (4)], and [17, Eq. (8)]. The main cause for the form difference is that we consider hardware impairments and make them as noise terms in SNR. These noise terms are not only related to hardware quality, but also depend on the overall channel which contains the optimization variable. The consideration of hardware impairments increases the complexity of the optimization problem. This also implies that if we use cheaper and lower-quality hardware, i.e., the hardware impairments are non-negligible in communication systems, the better reflect beamforming solution is needed to improve the channel quality.

Due to the objective function is a sum of the non-convex fractional function in problem (P4), it is difficult to obtain the global optimal solution. To further analyze this problem, we utilize the gradient decent method (GDM) to optimize the reflect beamforming. The gradient of objective function is a natural choice for the search direction[43]. The objective function of problem (P4) is a real-valued scalar function of the vector-variable. By introducing the conjugate coordinates (𝒗,𝒗)\left(\boldsymbol{v},\boldsymbol{v}^{*}\right), the objective function of problem (P4) can be guaranteed as a holomorphic function. The vector-variables 𝒗\boldsymbol{v} and 𝒗\boldsymbol{v}^{*} separately raise each element of [ej,,ej]T[e^{j},\cdots,e^{j}]^{\mathrm{T}} and [ej,,ej]T[e^{-j},\cdots,e^{-j}]^{\mathrm{T}} to the corresponding powers in 𝜽\boldsymbol{\theta}, i.e., perform an element-wise power operation, which is according with IEEE Standard (754-2019) for floating-point arithmetic[44]. Thus, the objective function f(𝒗(𝜽),𝒗(𝜽))f\left(\boldsymbol{v}(\boldsymbol{\theta}),\boldsymbol{v}^{*}(\boldsymbol{\theta})\right) is a composite function with the intermediate variables of 𝒗\boldsymbol{v} and 𝒗\boldsymbol{v}^{*}, and the dependent variable (optimization variable) of 𝜽\boldsymbol{\theta}. According to the Jacobian matrix identification and the rules of gradient computation of a real-valued function with respect to its matrix variable[45, 46], we obtain the gradients of the objective function with respect to 𝒗\boldsymbol{v} and 𝒗\boldsymbol{v}^{*}, which are respectively shown as follows:

f(𝒗,𝒗)𝒗=[f(𝒗,𝒗)𝒗]=σu2pbi=1Mhd,iϱi+ϱiϱiH𝒗(κ|hd,i+ϱiT𝒗|2+σu2pb)2,\frac{\partial f(\boldsymbol{v},\boldsymbol{v}^{*})}{\partial\boldsymbol{v}}=\left[\frac{\partial f(\boldsymbol{v},\boldsymbol{v}^{*})}{\partial\boldsymbol{v}^{*}}\right]^{*}=\frac{\sigma_{u}^{2}}{p_{b}}\sum_{i=1}^{M}\frac{h^{*}_{d,i}\boldsymbol{\varrho}_{i}+\boldsymbol{\varrho}_{i}\boldsymbol{\varrho}_{i}^{\mathrm{H}}\boldsymbol{v}^{*}}{\left(\kappa\left|h_{d,i}+\boldsymbol{\varrho}_{i}^{\mathrm{T}}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}\right)^{2}}, (58)

where κ=(1+κu)κb\kappa=\left(1+\kappa_{u}\right)\kappa_{b}. Similarly, the derivative of 𝒗\boldsymbol{v} with respect to 𝜽\boldsymbol{\theta}, which we denote as 𝐕\mathbf{V}, is given as follows:

𝒗𝜽=[𝒗𝜽]=diag(jejθ1,,jejθN).\frac{\partial\boldsymbol{v}}{\partial\boldsymbol{\theta}}=\left[\frac{\partial\boldsymbol{v}^{*}}{\partial\boldsymbol{\theta}}\right]^{*}=\operatorname{diag}\left(je^{j\theta_{1}},\cdots,je^{j\theta_{N}}\right). (59)

By using the derivation rule for composite function, we obtain the gradient of the objective function with respect to 𝜽\boldsymbol{\theta},

𝜽f(𝒗(𝜽),𝒗(𝜽))\displaystyle\nabla_{\boldsymbol{\theta}}f\left(\boldsymbol{v}(\boldsymbol{\theta}),\boldsymbol{v}^{*}(\boldsymbol{\theta})\right) =f(𝒗,𝒗)𝒗𝒗𝜽+f(𝒗,𝒗)𝒗𝒗𝜽\displaystyle=\frac{\partial f(\boldsymbol{v},\boldsymbol{v}^{*})}{\partial\boldsymbol{v}}\frac{\partial\boldsymbol{v}}{\partial\boldsymbol{\theta}}+\frac{\partial f(\boldsymbol{v},\boldsymbol{v}^{*})}{\partial\boldsymbol{v}^{*}}\frac{\partial\boldsymbol{v}^{*}}{\partial\boldsymbol{\theta}} (60)
=2σu2pbRe{𝐕i=1Mhd,iϱi+ϱiϱiH𝒗(κ|hd,i+ϱiT𝒗|2+σu2pb)2}.\displaystyle=\frac{2\sigma_{u}^{2}}{p_{b}}\operatorname{Re}\left\{\mathbf{V}\sum_{i=1}^{M}\frac{h^{*}_{d,i}\boldsymbol{\varrho}_{i}+\boldsymbol{\varrho}_{i}\boldsymbol{\varrho}_{i}^{\mathrm{H}}\boldsymbol{v}^{*}}{\left(\kappa\left|h_{d,i}+\boldsymbol{\varrho}_{i}^{\mathrm{T}}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}\right)^{2}}\right\}.

With the derived gradient, we can quickly obtain the sub-optimal solution of the objective function by searching in the gradient direction666 By using the GDM, we can only obtain the numerical local optimal solution. Although the numerical solution is sufficient to offer an outstanding performance which can be seen in the simulation results later, we are still interested in the closed-form solution of the problem. To ensure the objective function is holomorphic (complex analytic), the conjugate coordinates (𝒗,𝒗)\left(\boldsymbol{v},\boldsymbol{v}^{*}\right) should be introduced[45]. By using the first-order Taylor series approximation of the objective function f(𝒗,𝒗)f\left(\boldsymbol{v},\boldsymbol{v}^{*}\right) at a given point (𝒄,𝒄)\left(\boldsymbol{c},\boldsymbol{c}^{*}\right), we can obtain the necessary condition for that 𝒄\boldsymbol{c} is a local extreme point: the gradient vector equals to zero; By using the second-order Taylor series approximation of the objective function f(𝒗,𝒗)f\left(\boldsymbol{v},\boldsymbol{v}^{*}\right) at a given point (𝒄,𝒄)\left(\boldsymbol{c},\boldsymbol{c}^{*}\right), we can obtain the necessary and sufficient condition for that 𝒄\boldsymbol{c} is a local maximum point: the conjugate gradient vector equals to zero, and the full Hessian matrix, which consists of four part complex Hessian matrices, is negative semi-definite. . The detailed steps of the proposed GDM-based reflect beamforming algorithm is illustrated in Algorithm 1. It should be noted that the step size tt is chosen via exact or backtracking line search, i.e., t=argmaxs0f(𝜽+sf(𝜽))t=\operatorname{argmax}_{s\geqslant 0}f(\boldsymbol{\theta}+s\nabla f(\boldsymbol{\theta})).

1
2Objective Function:
f(𝜽)=i=1M|hd,i+ϱiT𝒗|2(1+κu)κb|hd,i+ϱiT𝒗|2+σu2pb.f(\boldsymbol{\theta})=\sum_{i=1}^{M}\frac{\left|{h}_{d,i}+\boldsymbol{\varrho}^{\mathrm{T}}_{i}\boldsymbol{v}\right|^{2}}{\left(1+\kappa_{u}\right)\kappa_{b}\left|{h}_{d,i}+\boldsymbol{\varrho}^{\mathrm{T}}_{i}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}}.
3Input: The channel matrices 𝐡d\mathbf{h}_{\mathrm{d}}, 𝐇R\mathbf{H}_{\mathrm{R}}, and the hardware impairment coefficients κb,κu\kappa_{b},\kappa_{u}.
4Set the number of iterations k=0k=0.
5Set the loop stop criterion: tolerance ϵ>0\epsilon>0.
6Initialize the RIS phase shifts by compensating the channels phase shifts, 𝜽(0)\boldsymbol{\theta}^{(0)}.
7Compute the objective function value under the current RIS phase shifts, f(𝜽(0))f(\boldsymbol{\theta}^{(0)}).
8while stop criterion Δf(𝛉(i))<ϵ\Delta f(\boldsymbol{\theta}^{(i)})<\epsilon is not satisfied do
9       Update the number of iterations k=k+1k=k+1.
10       Choose the gradient 𝜽f(𝜽(i))\nabla_{\boldsymbol{\theta}}f(\boldsymbol{\theta}^{(i)}) as the search direction.
11       Choose the step size tt via exact or backtracking line search.
12       Update the optimization variable 𝜽(i+1):=𝜽(i)+t𝜽f(𝜽(i))\boldsymbol{\theta}^{(i+1)}:=\boldsymbol{\theta}^{(i)}+t\nabla_{\boldsymbol{\theta}}f(\boldsymbol{\theta}^{(i)}).
13       Compute the objective function difference Δf(𝜽(i+1))=f(𝜽(i+1))f(𝜽(i))\Delta f(\boldsymbol{\theta}^{(i+1)})=f(\boldsymbol{\theta}^{(i+1)})-f(\boldsymbol{\theta}^{(i)}).
14 end while
15
Result: Iteration number kk, optimized reflect beamforming vector 𝜽\boldsymbol{\theta}.
Algorithm 1 The Proposed GDM-Based Reflect Beamforming Algorithm

IV-C Asymptotic Channel Capacity

In this subsection, we analyze the asymptotic channel capacity in the RIS-assisted communication system with hardware impairments. We consider two types of asymptotic channel capacities: the capacity as the transmit power approaches infinity (pb,pup_{b},p_{u}\rightarrow\infty), and the capacity as the numbers of antennas and reflecting elements approach infinity (M,NM,N\rightarrow\infty). In what follows, we only provide the results for the downlink channel due to space limitation.

Theorem 3.

The asymptotic channel capacity Cdpb()=limpbCd{C}^{p_{b}}_{d}(\infty)=\lim_{p_{b}\rightarrow\infty}{C}_{d} is bounded as

τdτlog2(1+1κb+κu(1+κb))Cdpb()τdτlog2(1+Mκb+κu(M+κb)).\displaystyle\frac{\tau_{d}}{\tau}\log_{2}\left(1+\frac{1}{\kappa_{b}+\kappa_{u}(1+\kappa_{b})}\right)\leq{C}^{p_{b}}_{d}(\infty)\leq\frac{\tau_{d}}{\tau}\log_{2}\left(1+\frac{M}{\kappa_{b}+\kappa_{u}(M+\kappa_{b})}\right). (61)
Proof:

Assume that the phase-shifting vector of RIS is optimal. According to the Eq. (2.2) in[42], the upper bound of downlink channel capacity in Eq. (52) can be rewritten as

Cdownτdτ𝔼{log2(1+𝐡^H𝐃~1𝐡^1+κu𝐡^H𝐃~1𝐡^)},{{C}}_{\mathrm{down}}\leq\frac{\tau_{d}}{\tau}\mathbb{E}\left\{\log_{2}\left(1+\frac{\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}}{1+\kappa_{u}\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}}\right)\right\}, (62)

where 𝐃~=(1+κu)κbdiag(𝐡^𝐡^H)+σu2pb𝐈\tilde{\mathbf{D}}=\left(1+\kappa_{u}\right)\kappa_{b}\operatorname{diag}(\hat{\mathbf{h}}\hat{\mathbf{h}}^{\mathrm{H}})+\frac{\sigma_{u}^{2}}{p_{b}}\mathbf{I}. Then, by applying Jensen’s inequality to Eq. (62), we obtain the new upper bound of downlink channel capacity as

Cdownτdτlog2(1+𝔼{𝐡^H𝐃~1𝐡^}1+κu𝔼{𝐡^H𝐃~1𝐡^}).{{C}}_{\mathrm{down}}\leq\frac{\tau_{d}}{\tau}\log_{2}\left(1+\frac{\mathbb{E}\left\{\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}\right\}}{1+\kappa_{u}\mathbb{E}\left\{\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}\right\}}\right). (63)

Based on the form transformation from problem (P3) in Eq. (55) to problem (P4) in Eq. (57), the term 𝐡^H𝐃~1𝐡^\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}} in Eq. (63) can be rewritten as

𝐡^H𝐃~1𝐡^=i=1M|hd,i+ϱiT𝒗|2(1+κu)κb|hd,i+ϱiT𝒗|2+σu2pb.\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}=\sum_{i=1}^{M}\frac{\left|{h}_{d,i}+\boldsymbol{\varrho}_{i}^{\mathrm{T}}\boldsymbol{v}\right|^{2}}{\left(1+\kappa_{u}\right)\kappa_{b}\left|{h}_{d,i}+\boldsymbol{\varrho}_{i}^{\mathrm{T}}\boldsymbol{v}\right|^{2}+\frac{\sigma_{u}^{2}}{p_{b}}}. (64)

As the transmit power pbp_{b} at the BS approaches infinity, the term σu2pb\frac{\sigma_{u}^{2}}{p_{b}} in the denominator of Eq. (64) approaches zero, and thus we have

limpb𝔼{𝐡^H𝐃~1𝐡^}=M(1+κu)κb.\lim_{p_{b}\rightarrow\infty}\mathbb{E}\left\{\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}\right\}=\frac{M}{\left(1+\kappa_{u}\right)\kappa_{b}}. (65)

Then, the upper bound in Eq. (61) is achieved by substituting Eq. (65) into Eq. (63). The lower bound is asymptotically obtained by using 𝔼{𝒙𝒙H}=pbM𝐈\mathbb{E}\left\{\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}}\right\}=\frac{p_{b}}{M}\mathbf{I}. ∎

Theorem 4.

The asymptotic channel capacity CdM,N()=limM,NCdC^{M,N}_{d}(\infty)=\lim_{M,N\rightarrow\infty}C_{d} is bounded as

τdτlog2(1+1κb+κu(1+κb))CdM,N()\displaystyle\frac{\tau_{d}}{\tau}\log_{2}\left(1+\frac{1}{\kappa_{b}+\kappa_{u}(1+\kappa_{b})}\right)\leq C^{M,N}_{d}(\infty) τdτlog2(1+1κu).\displaystyle\leq\frac{\tau_{d}}{\tau}\log_{2}\left(1+\frac{1}{\kappa_{u}}\right). (66)
Proof:

Based on the form of 𝐡^H𝐃~1𝐡^\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}} in Eq. (64), we observe that it approaches infinity as the numbers of antennas MM and reflecting elements NN approach infinity, i.e.,

limM,N𝔼{𝐡^H𝐃~1𝐡^}.\lim_{M,N\rightarrow\infty}\mathbb{E}\left\{\hat{\mathbf{h}}^{\mathrm{H}}\tilde{\mathbf{D}}^{-1}\hat{\mathbf{h}}\right\}\rightarrow\infty. (67)

Then, by substituting Eq. (67) into Eq. (63), the upper bound of channel capacity is obtained in Eq. (66). The lower bound is asymptotically achieved by using 𝔼{𝒙𝒙H}=pbM𝐈.\mathbb{E}\left\{\boldsymbol{x}\boldsymbol{x}^{\mathrm{H}}\right\}=\frac{p_{b}}{M}\mathbf{I}.

Remark 2.

When the BS antenna number is finite and the reflecting element number tends to infinity, the upper bound of asymptotic channel capacity is the same as that of the case where the transmit power tends to infinity. This implies that the major function of RIS is to reach the channel capacity limit at low transmit power. That is also the reason why RIS can improve the energy and spectrum efficiency of wireless communication systems without the need of complex processing on signals. However, we cannot increase the asymptotic channel capacity assisted by the RIS when the BS antenna number is fixed.

IV-D Numerical Results

In this subsection, we evaluate the performance of our proposed beamforming optimization algorithm, and characterize the asymptotic channel capacities we derived in Theorems 3 and 4.

We assume that the BS is equipped with M=5M=5 antennas, the transmit power is 1515 dB, the impairment coefficients are set as κb=κu=0.012\kappa_{b}=\kappa_{u}=0.01^{2}, and the transmit beamforming is optimized by the solution we derived in Theorem 2. Then, by utilizing the Monte Carlo trials, we compare the downlink spectral efficiency in the case of optimized phase shifts and that in the case of no phase shift versus the reflecting element number NN and SNR which is defined as pbσu2\frac{p_{b}}{\sigma_{u}^{2}} in Fig. 6 and 7, respectively. It shows that when the reflecting element number NN in the range of [5,100][5,100], the reflect beamforming gain is significant. However, if the reflecting element number N>100N>100, the reflect beamforming gain degrades with the increase of NN. It is because the existence of hardware impairments, the downlink spectral efficiency increases with the number of reflecting elements and gradually reaches the limit, and the reflect beamforming gain gradually degrades. Similarly, the reflect beamforming gain is significant in an appropriate range of SNR. Thus, if we utilize an appropriate number of reflecting elements, the reflect beamforming can bring a significant improvement in spectral efficiency, while if we utilize massive reflecting elements or the transmit power is high, it is not very necessary to optimize the reflect beamforming.

  
[Uncaptioned image]
Figure 7: The optimized downlink spectral efficiency versus the SNR with different impairment coefficients.
  
[Uncaptioned image]
Figure 9: The downlink spectral efficiency versus the SNR, and versus the number of reflecting elements.

Then, we characterize the asymptotic channel capacities. Fig. 8 shows the downlink spectral efficiency as a function of the BS antenna number MM with different reflecting element numbers NN. We observe that the downlink spectral efficiency increases with MM and NN, and converges to a finite limit caused by hardware impairments. In particular, when the number of BS antennas MM reaches a certain value, the growth of spectral efficiency that continues to increase MM becomes less noticeable. This observation is encouraging for that it is not very necessary to cost a lot on expensive antennas, which corresponds to the requirements of new communication paradigms. In Fig. 9, we fix the number of BS antennas, and plot the downlink spectral efficiency versus the reflecting element number NN and SNR that is defined as pbσu2\frac{p_{\mathrm{b}}}{\sigma^{2}_{\mathrm{u}}}, respectively. From Fig. 9, it is observed that the downlink spectral efficiency increases with NN and SNR, and two curves have the same converged value which caused by hardware impairments. This observation confirms the fact mentioned in Remark 2 that the major function of RIS is to reach the channel capacity limit using lower transmit power.

V Power Scaling Law and Energy Efficiency

V-A Power Scaling Law at User

Prior researches[47, 48, 49] show that the transmit power can be reduced without degrading the communication performance by using multiple antennas, e.g., a transmitter with MM antennas can reduce the transmit power as 1Mα\frac{1}{M^{\alpha}} where 0<α<120<\alpha<\frac{1}{2}, and still achieve non-zero spectral efficiency as MM tends to infinity[48]. Encouraged by this advantage, in this subsection, we quantify the power scaling law for RIS-assisted wireless systems with hardware impairments in both cases of perfect CSI and estimated CSI. Theoretically, the maximum-ratio combining detector achieves fairly well performance[50, 48], thus we restrict consideration to this detector. The channels of BS-user link 𝐡d\mathbf{h}_{\mathrm{d}}, BS-RIS link 𝐆\mathbf{G} and RIS-user link 𝐡r\mathbf{h}_{\mathrm{r}} are mutually independent matrices whose elements are independent and identically distributed (i.i.d.) zero-mean random variables. Then, according to the law of large numbers, we have

1M𝐡dH𝐡dβd2, as M,\frac{1}{M}\mathbf{h}_{\mathrm{d}}^{\mathrm{H}}\mathbf{h}_{\mathrm{d}}\rightarrow\beta_{d}^{2}\;\text{,}\;\text{ as }M\rightarrow\infty, (68)
1MN2(𝐆𝐡r)H(𝐆𝐡r)βr2, as N,\frac{1}{MN^{2}}\left(\mathbf{G}\mathbf{h}_{\mathrm{r}}\right)^{\mathrm{H}}\left(\mathbf{G}\mathbf{h}_{\mathrm{r}}\right)\rightarrow\beta_{r}^{2}\;\text{,}\;\text{ as }N\rightarrow\infty, (69)

where βd2=𝔼{|hd,i|2}\beta_{d}^{2}=\mathbb{E}\{|{h}_{d,i}|^{2}\}, βr2=𝔼{|Gi,j|2}𝔼{|hr,j|2}\beta_{r}^{2}=\mathbb{E}\{|{G}_{i,j}|^{2}\}\mathbb{E}\{|{h}_{r,j}|^{2}\}, and hd,i{h}_{d,i}, gi,j{g}_{i,j} and hr,j{h}_{r,j} are the entries of 𝐡d\mathbf{h}_{\mathrm{d}}, 𝐆\mathbf{G} and 𝐡r\mathbf{h}_{\mathrm{r}}, respectively.

V-A1 BS with perfect CSI

With perfect CSI, the detector vector at the BS is 𝐀=𝐡d+𝐆𝚽𝐡r\mathbf{A}=\mathbf{h}_{\mathrm{d}}+\mathbf{G}\mathbf{\Phi}\mathbf{h}_{\mathrm{r}} when using MRC. As illustrated in Section III, the phase noise at the RIS is random and unknown to the BS, thus the detector vector is 𝐡d+𝐆𝚽𝐡r\mathbf{h}_{\mathrm{d}}+\mathbf{G}\mathbf{\Phi}\mathbf{h}_{\mathrm{r}} rather than 𝐡d+𝐆𝚽^𝐡r\mathbf{h}_{\mathrm{d}}+\mathbf{G}\hat{\mathbf{\Phi}}\mathbf{h}_{\mathrm{r}}. The transmitted data signal can be detected by multiplying the received signal 𝒚\boldsymbol{y} with 𝐀H\mathbf{A}^{\mathrm{H}}, i.e., the detected signal is r=𝐀H𝒚r=\mathbf{A}^{\mathrm{H}}\boldsymbol{y} which can be rewritten as follows:

r=𝐡H𝐡^(x+ηu)+𝐡H𝜼b+𝐡H𝒏,r=\mathbf{h}^{\mathrm{H}}\hat{\mathbf{h}}\left(x+\eta_{u}\right)+\mathbf{h}^{\mathrm{H}}\boldsymbol{\eta}_{b}+\mathbf{h}^{\mathrm{H}}\boldsymbol{n}, (70)

where 𝐡\mathbf{h} represents 𝐡d+𝐆𝚽𝐡r\mathbf{h}_{\mathrm{d}}+\mathbf{G}\mathbf{\Phi}\mathbf{h}_{\mathrm{r}} and 𝐡^\hat{\mathbf{h}} represents 𝐡d+𝐆𝚽^𝐡r\mathbf{h}_{\mathrm{d}}+\mathbf{G}\hat{\mathbf{\Phi}}\mathbf{h}_{\mathrm{r}}, for simplicity. It should be noted that the expectation of Δθi\Delta\theta_{i} is zero. Then, the achievable rate up\mathcal{R}_{u}^{p} of the uplink channel can be obtained as follows:

up=𝔼{log2(1+pu|𝐡H𝐡|2κupu|𝐡H𝐡|2+𝐡22(σb2+puκb(1+κu)))}.\mathcal{R}_{u}^{p}=\mathbb{E}\left\{\log_{2}\left(1+\frac{p_{u}\left|\mathbf{h}^{\mathrm{H}}\mathbf{h}\right|^{2}}{\kappa_{u}p_{u}\left|\mathbf{h}^{\mathrm{H}}\mathbf{h}\right|^{2}+\left\|\mathbf{h}\right\|_{2}^{2}\left(\sigma_{b}^{2}+p_{u}\kappa_{b}\left(1+\kappa_{u}\right)\right)}\right)\right\}. (71)
Theorem 5.

Assuming that the BS has perfect channel state information and the transmit power of the user is scaled with the BS antenna number MM and the RIS reflecting element number NN according to pu=Eu/(M+kMN2)p_{u}={{E}_{u}}/{(M+kMN^{2})} where Eu{E}_{u} is fixed and k=βr2/βd2k={\beta_{r}^{2}}/{\beta_{d}^{2}}, we have

uplog2(1+Euβd2κuEuβd2+σb2), as M,N.\mathcal{R}_{u}^{p}\rightarrow\log_{2}\left(1+\frac{{E}_{u}\beta_{d}^{2}}{\kappa_{u}{E}_{u}\beta_{d}^{2}+\sigma_{b}^{2}}\right)\text{,}\;\text{ as }M,N\rightarrow\infty. (72)
Proof:

By substituting pu=Eu/(M+kMN2)p_{u}={{E}_{u}}/{(M+kMN^{2})} into Eq. (71) and using the law of large numbers reviewed in Eqs. (68) and (69), we obtain the asymptotic achievable rate limit up\mathcal{R}_{u}^{p} as M,NM,N\rightarrow\infty in Eq. (72). ∎

V-A2 BS with imperfect CSI

In practice, the BS has to estimate the channels, and there exists estimation error as we discussed in Section III. For simplicity, we denote the channel estimation error as 𝓔=𝐡^𝐡^\boldsymbol{\mathcal{E}}={\hat{\mathbf{h}}}^{\prime}-\hat{\mathbf{h}}. Referring to Eq. (33) in[48], the elements of 𝓔\boldsymbol{\mathcal{E}} are random variables with zero means and variances βpuβ+1\frac{\beta}{p_{u}\beta+1} where β=(1+kN2)βd2\beta=(1+kN^{2})\beta_{d}^{2}. We rewrite the received signal as

r=𝐡^H(𝐡^𝓔)(x+ηu)+𝐡^H𝜼b+𝐡^H𝒏.r={\hat{\mathbf{h}}}^{\prime\mathrm{H}}\left({\hat{\mathbf{h}}}^{\prime}-\boldsymbol{\mathcal{E}}\right)\left(x+\eta_{u}\right)+{\hat{\mathbf{h}}}^{\prime\mathrm{H}}\boldsymbol{\eta}_{b}+{\hat{\mathbf{h}}}^{\prime\mathrm{H}}\boldsymbol{n}. (73)

Similarly to the Eq. (38) in[48], the achievable rate uip\mathcal{R}_{u}^{ip} of the uplink channel is given as follows where each element of 𝐡^{\hat{\mathbf{h}}}^{\prime} is random with zero mean and variance puβ2puβ+1\frac{p_{u}\beta^{2}}{p_{u}\beta+1},

uip=𝔼{log2(1+pu|𝐡^H𝐡^|2(1+κu)pu𝐡^22βpuβ+1+κupu|𝐡^H𝐡^|2+𝐡^22(σb2+puκb(1+κu)))}.\mathcal{R}_{u}^{ip}=\mathbb{E}\left\{\log_{2}\left(1+\frac{p_{u}\left|{\hat{\mathbf{h}}}^{\prime\mathrm{H}}{\hat{\mathbf{h}}}^{\prime}\right|^{2}}{\left(1+\kappa_{u}\right)p_{u}\left\|{\hat{\mathbf{h}}}^{\prime}\right\|_{2}^{2}\frac{\beta}{p_{u}\beta+1}+\kappa_{u}p_{u}\left|{\hat{\mathbf{h}}}^{\prime\mathrm{H}}{\hat{\mathbf{h}}}^{\prime}\right|^{2}+\left\|{\hat{\mathbf{h}}}^{\prime}\right\|_{2}^{2}\left(\sigma_{b}^{2}+p_{u}\kappa_{b}\left(1+\kappa_{u}\right)\right)}\right)\right\}. (74)
Theorem 6.

Assuming that the BS has imperfect channel state information and the transmit power of the user is scaled with the BS antenna number MM and the RIS reflecting element number NN according to pu=Eu/(M(1+kN2))p_{u}={{E}_{u}}/{(\sqrt{M}(1+kN^{2}))} where Eu{E}_{u} is fixed and k=βr2/βd2k={\beta_{r}^{2}}/{\beta_{d}^{2}}, we have

uiplog2(1+Eu2βd4κuEu2βd4+σb2), as M,N.\mathcal{R}_{u}^{ip}\rightarrow\log_{2}\left(1+\frac{{E}^{2}_{u}\beta_{d}^{4}}{\kappa_{u}{E}^{2}_{u}\beta_{d}^{4}+\sigma_{b}^{2}}\right)\;\text{,}\;\text{ as }M,N\rightarrow\infty. (75)
Proof:

The proof follows the similar procedures with Proposition 2. By substituting pu=Eu/(M(1+kN2))p_{u}={{E}_{u}}/{(\sqrt{M}(1+kN^{2}))} into Eq. (74), and using the law of large number reviewed in Eqs. (68) and (69) along with the variances of elements in the estimated channel vector 𝐡\mathbf{h}^{\prime} and the estimation error vector 𝓔\boldsymbol{\mathcal{E}}, we obtain the limit of the achievable rate uip\mathcal{R}_{u}^{ip} as M,NM,N\rightarrow\infty in Eq. (75). ∎

Remark 3.

Theorem 5 shows that if the BS has perfect channel state information, and MM and NN are large enough, the performance of an RIS-assisted communication system with MM-antenna BS, NN-reflecting element RIS and the transmit power Eu/(M(1+kN2)){{E}_{u}}/{(M(1+kN^{2}))} at the user is equal to the performance of a single-input single-output (SISO) system with the transmit power Eu{E}_{u} at the user. Theorem 6 shows that if the BS has estimated channel state information, and MM and NN are large enough, the performance of an RIS-assisted communication system with MM-antenna BS, NN-reflecting element RIS and the transmit power Eu/(M(1+kN2)){{E}_{u}}/{(\sqrt{M}(1+kN^{2}))} at the user is equal to the performance of a SISO system with the transmit power Eu2βd2{E}^{2}_{u}\beta_{d}^{2} at the user. Theorem 6 also implies that the transmit power can be cut proportionally to Eu/(Mα(1+kN2)2α){{E}_{u}}/{(M^{\alpha}(1+kN^{2})^{2\alpha})} where the parameter α12\alpha\leq\frac{1}{2}. If the parameter α>12\alpha>\frac{1}{2}, the achievable rate of the uplink channel will converge towards zero as MM\rightarrow\infty and NN\rightarrow\infty.

V-B Energy Efficiency of Downlink

In this subsection, we analyze the energy efficiency which is measured by Bit/Joule, and a common definition is the ratio of the spectral efficiency (in Bit/Channel Use) to the transmit power (in Joule/Channel Use). The energy consumed at the BS and the user (per coherence period) is

E=τdpb+(τpilot+τu)pu,{E}=\tau_{d\;}p_{b}+\left(\tau_{{pilot}}+\tau_{u}\right)p_{u}, (76)

where τpilot\tau_{{pilot}}, τu\tau_{u} and τd\tau_{d} are the consumed time of pilot-based channel estimation, uplink transmission and downlink transmission, respectively. In addition, there exists a baseband circuit power consumption which can be modeled as Mρ+ζM\rho+\zeta[51, 52]. The parameter ρ0\rho\geq 0 describes the circuit power which scales with the BS antenna number MM. The parameter ζ>0\zeta>0 describes the circuit power which is static. Then, the average power (in Joule/Channel Use) can be given as

Eτ=(τdτu+τd(τpilotpuτ+Mρ+ζ)+τdpbτ)Downlink Average Power+(τuτu+τd(τpilotpuτ+Mρ+ζ)+τupuτ)Uplink Average Power.\displaystyle\frac{{E}}{\tau}=\underbrace{\left(\frac{\tau_{d}}{\tau_{u}+\tau_{d}}\left(\frac{\tau_{{pilot\;}}p_{u}}{\tau}+M\rho+\zeta\right)+\frac{\tau_{d\;}p_{b}}{\tau}\right)}_{\text{Downlink Average Power}}+\underbrace{\left(\frac{\tau_{u}}{\tau_{u}+\tau_{d}}\left(\frac{\tau_{{pilot\;}}p_{u}}{\tau}+M\rho+\zeta\right)+\frac{\tau_{u\;}p_{u}}{\tau}\right)}_{\text{Uplink Average Power}}. (77)

The first term of Eq. (77) refers to the average power of the downlink transmission. Based on the power consumption model established above, we give the definition of the overall energy efficiency as follows:

Definition 1.

The energy efficiency of downlink is

Ξdown=Cdτdτu+τd(τpilotpuτ+Mρ+ζ)+τdpbτ,\Xi_{\mathrm{down}}=\frac{{C}_{d}}{\frac{\tau_{d}}{\tau_{u}+\tau_{d}}\left(\frac{\tau_{{pilot\;}}p_{u}}{\tau}+M\rho+\zeta\right)+\frac{\tau_{d\;}p_{b}}{\tau}}, (78)

where Cd{C}_{d} is the channel capacity of downlink.

Theorem 7.

Suppose we want to maximize the energy efficiency of downlink with respect to the transmit power (pb,pu0p_{b},p_{u}\geq 0), the number of BS antennas (M0M\geq 0), and the number of reflecting elements (N0N\geq 0). If the parameter ρ=0\rho=0, the maximal energy efficiency Ξdownmax\Xi^{\mathrm{max}}_{\mathrm{down}} is bounded as

log2(1+1κb+κu(1+κb))τζτu+τdΞdownmaxlog2(1+1κu)τζτu+τd.\frac{\log_{2}\left(1+\frac{1}{\kappa_{b}+\kappa_{u}(1+\kappa_{b})}\right)}{\frac{\tau\zeta}{\tau_{u}+\tau_{d}}}\leq\Xi^{\mathrm{max}}_{\mathrm{down}}\leq\frac{\log_{2}\left(1+\frac{1}{\kappa_{u}}\right)}{\frac{\tau\zeta}{\tau_{u}+\tau_{d}}}. (79)

If the parameter ρ>0\rho>0, the upper bound is still valid, but the asymptotic energy efficiency is zero, i.e., the maximal energy efficiency can be achieved at certain finite MM.

Proof:

Based on the definition of energy efficiency given in Definition 1 and the asymptotic channel capacity of downlink given in Theorem 4, we can prove Theorem 7. We maximize the energy efficiency with respect to the transmit power, the number of BS antennas, and the number of reflecting elements: 1) by neglecting the transmit power terms in the denominator of Eq. (78); 2) and applying the bounds of the asymptotic channel capacity limit in Theorem 4 to the numerator of Eq. (78). Then, we obtain the upper bound and the lower bound of the maximal energy efficiency of downlink in Eq. (79). ∎

Remark 4.

If the number of BS antennas is fixed and the circuit power have no correlation with the number of BS antennas, i.e., the parameter ρ=0\rho=0, increasing the number of reflecting elements on RIS can only make the energy efficiency close to the upper bound given as follows,

Ξdownmaxlog2(1+Mκb+κu(M+κb))τζτu+τd.\Xi^{\mathrm{max}}_{\mathrm{down}}\leq\frac{\log_{2}\left(1+\frac{M}{\kappa_{b}+\kappa_{u}(M+\kappa_{b})}\right)}{\frac{\tau\zeta}{\tau_{u}+\tau_{d}}}. (80)

The upper bound of maximal energy efficiency only can be increased from Eq. (80) to Eq. (79) by increasing the number of BS antennas.

If the circuit power scales with the number of BS antennas, i.e., the parameter ρ>0\rho>0, the maximal energy efficiency only can be achieved at a certain finite MM, which depends on the parameters ρ\rho and ζ\zeta. Meanwhile, the effect of increasing the reflecting elements in this case is still to make the energy efficiency close to the upper bound under the current MM.

V-C Numerical Results

In this subsection, we numerically illustrate the power scaling law we derived in Theorems 5 and 6, and the maximal energy efficiency we derived in Theorem 7.

Fig. 10 compares the uplink spectral efficiency of RIS-assisted system with that of MISO and SISO system versus SNR in both cases of perfect and imperfect CSI. In this figure, the BS is equipped with M=20M=20 antennas, the RIS is equipped with N=100N=100 reflecting elements, and κb=κu=0.052\kappa_{b}=\kappa_{u}=0.05^{2}. It shows that the user in RIS-assisted system can obtain the same spectral efficiency at lower transmit power than that in MISO and SISO system, which verifies the correctness of our results in Theorems 5 and 6.

Then, to illustrate the maximal energy efficiency, we consider the case where the reflecting element number NN approaches infinity. In this case, the upper bound of asymptotic channel capacity is same with that of the case where the transmit power pbp_{b} approaches infinity, as been discussed in Section IV. Thus, we neglect the transmit power terms in the energy efficiency. It is reasonable because the energy efficiency can be improved by reducing the transmit power without the reduction of spectral efficiency. To illustrate the difference between the static circuit power and the circuit power which scales with the number of BS antennas MM, we consider four different splittings between ρ\rho and ζ\zeta: ρρ+ζ{0,0.002,0.01,0.02}\frac{\rho}{\rho+\zeta}\in\{0,0.002,0.01,0.02\}. Based on the power consumption numbers reported in[53], we consider the power consumption that ρ+ζ=0.5μJoule/Channel Use\rho+\zeta=0.5\mu\;\text{Joule/Channel Use}. Fig. 11 shows the maximal energy efficiency versus the BS antenna number MM with different splitting between ρ\rho and ζ\zeta. It is observed that when ρ=0\rho=0, i.e., the circuit power is static, the maximal energy efficiency increases with the BS antenna number MM and converges to a finite value, which conforms to the upper bound derived in Theorem 7. While ρ>0\rho>0, i.e., some part of power consumption scales with MM, the maximal energy efficiency can be achieved at some finite MM. When the part of power consumption which scales with MM is non-negligible, e.g., ρρ+ζ=0.01,0.02\frac{\rho}{\rho+\zeta}=0.01,0.02 in Fig. 11, the BS antenna number is unnecessary to be very large. This conclusion is similar to the result in Fig. 8, which implies that an RIS-assisted system can achieve both high spectral efficiency and high energy efficiency with a small number of BS antennas. As to the number of reflecting elements at RIS, it should be as large as possible without degrading the performance, e.g., channel estimation accuracy, bit error rate. This conclusion is encouraging as it implies that there is no need to cost a lot on expensive high-quality antennas when the system is assisted by an RIS. This corresponds to the requirements of new communication paradigms.

  
[Uncaptioned image]
Figure 11: The maximal energy efficiency of downlink versus the number of BS antennas with different ρ\rho and ζ\zeta.

VI Conclusion

In this paper, we consider an RIS-assisted wireless communication system with non-ideal hardware. We characterize and evaluate the system performance in this case comprehensively, which includes channel estimation accuracy, spectrum and energy efficiency, channel capacity and power scaling law, and analyze the impacts of hardware impairments on them. We also give the solutions to reduce these impacts and to optimize the joint transmit and reflect beamforming. The validity of all the theorems and corollaries derived in this paper are verified by simulations. Our experimental results also reveal an encouraging phenomenon that the RIS-assisted wireless system with massive reflecting elements can achieve both high spectrum and energy efficiency without the needs of massive antennas and allocating too many resources to optimize the reflect beamforming, especially when the hardware impairments are non-negligible.

References

  • [1] Y. Liu, E. Liu, and R. Wang, “Energy efficiency analysis of intelligent reflecting surface system with hardware impairments,” in IEEE Global Communications Conference (GLOBECOM), Taipei, China, December 2020, pp. 1–6.
  • [2] Y. Liu, E. Liu, R. Wang, and Y. Geng, “Channel estimation and power scaling of reconfigurable intelligent surface with non-ideal hardware,” in IEEE Wireless Communications and Networking Conference (WCNC), Nanjing, China, 2021.
  • [3] “Cisco annual internet report (2018-2023) white paper,” March 2020. [Online]. Available: https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.pdf
  • [4] E. Basar, M. Di Renzo, J. De Rosny, M. Debbah, M. Alouini, and R. Zhang, “Wireless communications through reconfigurable intelligent surfaces,” IEEE Access, vol. 7, pp. 116 753–116 773, August 2019.
  • [5] 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 Communications Letters, vol. 9, no. 2, pp. 244–248, February 2020.
  • [6] Ö. Özdogan, E. Björnson, and E. G. Larsson, “Intelligent reflecting surfaces: Physics, propagation, and pathloss modeling,” IEEE Wireless Communications Letters, vol. 9, no. 5, pp. 581–585, 2020.
  • [7] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Transactions on Wireless Communications, vol. 18, no. 8, pp. 4157–4170, August 2019.
  • [8] 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 Journal of the Communications Society, vol. 1, pp. 798–807, June 2020.
  • [9] L. Zhang, L. Yan, B. Lin, H. Ding, Y. Fang, and X. Fang, “Augmenting transmission environments for better communications: Tunable reflector assisted mmWave WLANs,” IEEE Transactions on Vehicular Technology, vol. 69, no. 7, pp. 7416–7428, July 2020.
  • [10] L. Zhang, X. Chen, Y. Fang, X. Huang, and X. Fang, “Learning-based mmWave V2I environment augmentation through tunable reflectors,” in 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 2019, pp. 1–6.
  • [11] Y. Yang, B. Zheng, S. Zhang, and R. Zhang, “Intelligent reflecting surface meets OFDM: Protocol design and rate maximization,” IEEE Transactions on Communications, vol. 68, no. 7, pp. 4522–4535, July 2020.
  • [12] Z. Wang, L. Liu, and S. Cui, “Channel estimation for intelligent reflecting surface assisted multiuser communications: Framework, algorithms, and analysis,” IEEE Transactions on Wireless Communications, vol. 19, no. 10, pp. 6607–6620, October 2020.
  • [13] C. You, B. Zheng, and R. Zhang, “Channel estimation and passive beamforming for intelligent reflecting surface: Discrete phase shift and progressive refinement,” IEEE Journal on Selected Areas in Communications, vol. 38, no. 11, pp. 2604–2620, November 2020.
  • [14] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network: Joint active and passive beamforming design,” in 2018 IEEE Global Communications Conference (GLOBECOM), Abu Dhabi, United Arab Emirates, December 2018, pp. 1–6.
  • [15] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,” IEEE Transactions on Wireless Communications, vol. 18, no. 11, pp. 5394–5409, November 2019.
  • [16] K. Feng, Q. Wang, X. Li, and C. Wen, “Deep reinforcement learning based intelligent reflecting surface optimization for MISO communication systems,” IEEE Wireless Communications Letters, vol. 9, no. 5, pp. 745–749, May 2020.
  • [17] Q. Wu and R. Zhang, “Beamforming optimization for intelligent reflecting surface with discrete phase shifts,” in 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, United Kingdom, May 2019, pp. 7830–7833.
  • [18] N. S. Perović, M. D. Renzo, and M. F. Flanagan, “Channel capacity optimization using reconfigurable intelligent surfaces in indoor mmWave environments,” in 2020 IEEE International Conference on Communications (ICC), Dublin, Ireland, 2020, pp. 1–7.
  • [19] E. Basar, “Reconfigurable intelligent surface-based index modulation: A new beyond MIMO paradigm for 6G,” IEEE Transactions on Communications, vol. 68, no. 5, pp. 3187–3196, May 2020.
  • [20] C. Huang, G. C. Alexandropoulos, A. Zappone, M. Debbah, and C. Yuen, “Energy efficient multi-user MISO communication using low resolution large intelligent surfaces,” in 2018 IEEE Global Communications Conference Workshops (GLOBECOM Wkshps), Abu Dhabi, United Arab Emirates, 2018, pp. 1–6.
  • [21] Q. Wu and R. Zhang, “Beamforming optimization for wireless network aided by intelligent reflecting surface with discrete phase shifts,” IEEE Transactions on Communications, vol. 68, no. 3, pp. 1838–1851, March 2020.
  • [22] W. Shi, X. Zhou, L. Jia, Y. Wu, F. Shu, and J. Wang, “Enhanced secure wireless information and power transfer via intelligent reflecting surface,” IEEE Communications Letters, vol. 25, no. 4, pp. 1084–1088, April 2021.
  • [23] X. Yu, D. Xu, Y. Sun, D. W. K. Ng, and R. Schober, “Robust and secure wireless communications via intelligent reflecting surfaces,” IEEE Journal on Selected Areas in Communications, vol. 38, no. 11, pp. 2637–2652, November 2020.
  • [24] H. Suzuki, T. V. A. Tran, I. B. Collings, G. Daniels, and M. Hedley, “Transmitter noise effect on the performance of a MIMO-OFDM hardware implementation achieving improved coverage,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 6, pp. 867–876, August 2008.
  • [25] Won Namgoong, “Modeling and analysis of nonlinearities and mismatches in ac-coupled direct-conversion receiver,” IEEE Transactions on Wireless Communications, vol. 4, no. 1, pp. 163–173, January 2005.
  • [26] E. Björnson, J. Hoydis, M. Kountouris, and M. Debbah, “Massive MIMO systems with non-ideal hardware: Energy efficiency, estimation, and capacity limits,” IEEE Transactions on Information Theory, vol. 60, no. 11, pp. 7112–7139, November 2014.
  • [27] M. Badiu and J. P. Coon, “Communication through a large reflecting surface with phase errors,” IEEE Wireless Communications Letters, vol. 9, no. 2, pp. 184–188, February 2020.
  • [28] E. Björnson, P. Zetterberg, M. Bengtsson, and B. Ottersten, “Capacity limits and multiplexing gains of MIMO channels with transceiver impairments,” IEEE Communications Letters, vol. 17, no. 1, pp. 91–94, January 2013.
  • [29] J. Zhu, D. W. K. Ng, N. Wang, R. Schober, and V. K. Bhargava, “Analysis and design of secure massive MIMO systems in the presence of hardware impairments,” IEEE Transactions on Wireless Communications, vol. 16, no. 3, pp. 2001–2016, March 2017.
  • [30] Shuguang Cui, A. J. Goldsmith, and A. Bahai, “Energy-constrained modulation optimization,” IEEE Transactions on Wireless Communications, vol. 4, no. 5, pp. 2349–2360, September 2005.
  • [31] C. Studer, M. Wenk, and A. Burg, “MIMO transmission with residual transmit-RF impairments,” in 2010 International ITG Workshop on Smart Antennas (WSA), Bremen, Germany, 2010, pp. 189–196.
  • [32] P. Zetterberg, “Experimental investigation of TDD reciprocity-based zero-forcing transmit precoding,” EURASIP Journal on Advances in Signal Processing, vol. 2011, pp. 1–10, 2011.
  • [33] B. Goransson, S. Grant, E. Larsson, and Z. Feng, “Effect of transmitter and receiver impairments on the performance of MIMO in HSDPA,” in 2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications, Recife, Brazil, July 2008, pp. 496–500.
  • [34] E. Björnson, P. Zetterberg, and M. Bengtsson, “Optimal coordinated beamforming in the multicell downlink with transceiver impairments,” in 2012 IEEE Global Communications Conference (GLOBECOM), Anaheim, CA, USA, December 2012, pp. 4775–4780.
  • [35] H. Holma and A. Toskala, LTE for UMTS: Evolution to LTE-advanced.   John Wiley & Sons, 2011.
  • [36] M. A. Woodbury, “Inverting modified matrices,” Memorandum Report 42, Statistical Research Group, Princeton, NJ, 1950.
  • [37] E. Telatar, “Capacity of multi-antenna Gaussian channels,” European Transactions on Telecommunications, vol. 10, no. 6, pp. 585–595, 1999.
  • [38] S. K. Mohammed and E. G. Larsson, “Single-user beamforming in large-scale MISO systems with per-antenna constant-envelope constraints: The doughnut channel,” IEEE Transactions on Wireless Communications, vol. 11, no. 11, pp. 3992–4005, November 2012.
  • [39] S. Zhang, R. Zhang, and T. J. Lim, “Constant envelope precoding for MIMO systems,” IEEE Transactions on Communications, vol. 66, no. 1, pp. 149–162, January 2018.
  • [40] O. E. Ayach, S. Rajagopal, S. Abu-Surra, Z. Pi, and R. W. Heath, “Spatially sparse precoding in millimeter wave MIMO systems,” IEEE Transactions on Wireless Communications, vol. 13, no. 3, pp. 1499–1513, March 2014.
  • [41] F. Sohrabi and W. Yu, “Hybrid digital and analog beamforming design for large-scale antenna arrays,” IEEE Journal of Selected Topics in Signal Processing, vol. 10, no. 3, pp. 501–513, April 2016.
  • [42] J. W. Silverstein and Z. Bai, “On the empirical distribution of eigenvalues of a class of large dimensional random matrices,” Journal of Multivariate analysis, vol. 54, no. 2, pp. 175–192, August 1995.
  • [43] S. Boyd, S. P. Boyd, and L. Vandenberghe, Convex optimization.   Cambridge university press, 2004.
  • [44] “IEEE standard for floating-point arithmetic,” IEEE Std 754-2019 (Revision of IEEE 754-2008), pp. 1–84, 2019.
  • [45] X.-D. Zhang, Matrix analysis and applications.   Cambridge University Press, 2017.
  • [46] H. Lütkepohl, Handbook of matrices.   Wiley Chichester, 1996, vol. 1.
  • [47] J. Hoydis, S. ten Brink, and M. Debbah, “Massive MIMO in the UL/DL of cellular networks: How many antennas do we need?” IEEE Journal on Selected Areas in Communications, vol. 31, no. 2, pp. 160–171, February 2013.
  • [48] H. Q. Ngo, E. G. Larsson, and T. L. Marzetta, “Energy and spectral efficiency of very large multiuser MIMO systems,” IEEE Transactions on Communications, vol. 61, no. 4, pp. 1436–1449, April 2013.
  • [49] A. Pitarokoilis, S. K. Mohammed, and E. G. Larsson, “Uplink performance of time-reversal MRC in massive MIMO systems subject to phase noise,” IEEE Transactions on Wireless Communications, vol. 14, no. 2, pp. 711–723, February 2015.
  • [50] T. L. Marzetta, “Noncooperative cellular wireless with unlimited numbers of base station antennas,” IEEE Transactions on Wireless Communications, vol. 9, no. 11, pp. 3590–3600, November 2010.
  • [51] G. Auer, V. Giannini, C. Desset, I. Godor, P. Skillermark, M. Olsson, M. A. Imran, D. Sabella, M. J. Gonzalez, O. Blume, and A. Fehske, “How much energy is needed to run a wireless network?” IEEE Wireless Communications, vol. 18, no. 5, pp. 40–49, October 2011.
  • [52] D. W. K. Ng, E. S. Lo, and R. Schober, “Energy-efficient resource allocation in OFDMA systems with large numbers of base station antennas,” IEEE Transactions on Wireless Communications, vol. 11, no. 9, pp. 3292–3304, September 2012.
  • [53] G. Auer, O. Blume, V. Giannini, I. Godor, M. Imran, Y. Jading, E. Katranaras, M. Olsson, D. Sabella, P. Skillermark et al., “D2. 3: Energy efficiency analysis of the reference systems, areas of improvements and target breakdown,” Earth, vol. 20, no. 10, 2010.