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

Reconfigurable Intelligent Surface Aided
Wireless Localization

Yiming Liu, Erwu Liu and Rui Wang College of Electronics and Information Engineering, Tongji University, Shanghai, China
Emails: [email protected], [email protected], [email protected]
Abstract

The advantages of millimeter-wave and large antenna arrays technologies for accurate wireless localization received extensive attentions recently. However, how to further improve the accuracy of wireless localization, even in the case of obstructed line-of-sight, is largely undiscovered. In this paper, the reconfigurable intelligent surface (RIS) is introduced into the system to make the positioning more accurate. First, we establish the three-dimensional RIS-assisted wireless localization channel model. After that, we derive the Fisher information matrix and the Cramer-Rao lower bound for evaluating the estimation of absolute mobile station position. Finally, we propose an alternative optimization method and a gradient decent method to optimize the reflect beamforming, which aims to minimize the Cramer-Rao lower bound to obtain a more accurate estimation. Our results show that the proposed methods significantly improve the accuracy of positioning, and decimeter-level or even centimeter-level positioning can be achieved by utilizing the RIS with a large number of reflecting elements.

Index Terms:
Wireless localization, reconfigurable intelligent surface, millimeter-wave, Cramer-Rao lower bound, reflect beamforming design.

I Introduction

The fifth generation (5G) wireless technology offers great opportunities for accurate wireless localization due to the very high carrier frequency and large antenna arrays. Moreover, the sixth generation (6G) systems continue to develop towards even higher frequency ranges, e.g., at the millimeter-wave (mm-wave) as well as Tera Hertz (THz) ranges. The 6G white paper on localization and sensing released by University of Oulu [1] points out that 6G systems will not only provide ubiquitous communication but also empower high accuracy localization due to the very fine angular resolutions. Decimeter-level or even centimeter-level positioning will be achieved by taking advantages of the new 6G key technology enablers.

The advantages of mm-wave and large antenna arrays for accurate wireless localization have been extensively studied. Jeong, et al., propose an active beamforming method to enhance the localization accuracy of distributed antenna systems [2]. Shahmansoori, et al., study the position and orientation estimation through mm-wave massive multiple-input multiple-output (MIMO) systems [3]. Wang, Wu, and Shen prove the asymptotic spatial orthogonality of large-scale MIMO localization with general non-orthogonal waveforms [4]. They also derive the Fisher information matrices for the position and orientation to characterize the performance bounds of MIMO localization. Zhou, et al., focus on active beamforming to reduce the localization error, and propose a successive localization and beamforming scheme [5].

However, how to further improve the accuracy of wireless localization, even in the case of obstructed line-of-sight, is largely undiscovered. Thus, in this paper, we introduce the reconfigurable intelligent surface (RIS), which is an efficient method to control the wavefront of the impinging signals, into the system to make the positioning more accurate and energy efficient. Our prior work shows that an RIS-assisted wireless communication system can achieve both high spectral and energy efficiency [6]. Wu and Zhang verify that the RIS is able to drastically enhance the link quality over the conventional setup without the RIS [7].

In this paper, we introduce the RIS into the wireless localization system, and focus on the (passive) reflect beamforming to reduce the localization error. We first build the three-dimensional RIS-assisted wireless localization system model. After that, we derive the Fisher information matrix and the Cramer-Rao lower bound for the estimate of absolute mobile station (MS) position. For the sake of convenience in reflect beamforming design, we separate the response of RIS in the Fisher information matrix. Finally, we propose an alternative optimization method and a gradient decent method to optimize the reflect beamforming, which aims to minimize the Cramer-Rao lower bound. Our results show that the proposed methods significantly improve the accuracy of positioning, and decimeter-level or even centimeter-level positioning can be achieved by utilizing the RIS with a large number of reflecting elements.

II System and Channel Model

Encouraged by the potential of mm-wave signals and large antenna arrays to improve the accuracy of positioning, many standardized channel models have started to emerge [3, 8, 5]. We base the evaluation of our work on these models while introducing the RIS into the system to make the MS positioning more accurate. Introducing RIS can provide extra reflection paths which help in the estimation of MS position. On the one hand, it makes the positioning become possible when the line-of-sight is obstructed; On the other hand, it adds more position information for estimation.

II-A System Model

We consider an RIS-assisted wireless localization system as illustrated in Fig. 1, where the base station (BS) is equipped with NtN_{\mathrm{t}} antennas, the MS is equipped with NrN_{\mathrm{r}} antennas, and the RIS is equipped with NN reflecting elements. The BS and MS are placed in the horizontal plane, along the yy-axis direction, and the RIS is placed in the vertical plane. Although the BS and MS are equipped with a large number of antennas, they can fit within the compact form because of the small wavelength of mm-wave. Thus, they can be viewed as two points, and the positions of them are respectively denoted as 𝒑=[px,py,0]T\boldsymbol{p}=[p_{x},p_{y},0]^{\mathrm{T}} and 𝒒=[qx,qy,0]T\boldsymbol{q}=[q_{x},q_{y},0]^{\mathrm{T}}. Compared with the BS and MS, the RIS has a much larger size, thus each reflecting element needs to be considered separately. The position of the iith reflecting element is denoted as 𝒔i=[sxi,syi,szi]T\boldsymbol{s}^{i}=[s^{i}_{x},s^{i}_{y},s^{i}_{z}]^{\mathrm{T}}. The values of 𝒑\boldsymbol{p} and 𝒔i\boldsymbol{s}^{i} are assumed to be known, while the value of 𝒒\boldsymbol{q} is unknown and requires to be estimated.

Refer to caption

Figure 1: The RIS-assisted wireless localization system with an NtN_{\mathrm{t}}-antenna BS, an NrN_{\mathrm{r}}-antenna MS, and an RIS comprising NN reflecting elements. This paper considers the case that the line-of-sight is obstructed by some blockages.

In this paper, we focus on the case that the line-of-sight is obstructed, thus there exist NN reflection paths through RIS. The elevation and azimuth angle-of-departure (AoD) of the iith path are denoted as θi\theta_{i} and ϕi\phi_{i}. The elevation and azimuth angle-of-arrival (AoA) of the iith path are denoted as ϑi\vartheta_{i} and φi\varphi_{i}. Due to that the positions of BS and RIS are fixed and known, we can obtain the values of θi\theta_{i} and ϕi\phi_{i} by means of the geometrical relationship between them. The values of ϑi\vartheta_{i} and φi\varphi_{i} are unknown and requires to be estimated. In addition, position estimate is equivalent with the azimuth and elevation AoA estimate due to the geometrical relationship.

II-B Channel Model

We ignore the bounce reflections from the ground or other scatterers, since such paths get attenuated much more significantly than the paths through RIS. Based on the system model given above, the Nr×NtN_{\mathrm{r}}\times N_{\mathrm{t}} channel matrix can be expressed as

𝐇~=𝚲r(𝐇𝚽)𝚲tH.\tilde{\mathbf{H}}=\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}}\;\text{.} (1)

where the matrices 𝚲t\mathbf{\Lambda}_{\mathrm{t}} and 𝚲r\mathbf{\Lambda}_{\mathrm{r}} are the array response matrices at BS and MS, the diagonal matrix 𝐇\mathbf{H} is the propagation gain matrix of NN paths, and the diagonal matrix 𝚽\mathbf{\Phi} represents the operations at the RIS. The array response matrices 𝚲t\mathbf{\Lambda}_{\mathrm{t}} and 𝚲r\mathbf{\Lambda}_{\mathrm{r}} depend on the angular parameters, given by

𝚲t=[𝐚t(θ1,ϕ1),,𝐚t(θN,ϕN)]Nt×N,\mathbf{\Lambda}_{\mathrm{t}}=\left[\mathbf{a}_{\mathrm{t}}\left(\theta_{1},\phi_{1}\right),\cdots,\mathbf{a}_{\mathrm{t}}\left(\theta_{N},\phi_{N}\right)\right]\in\mathbb{C}^{N_{\mathrm{t}}\times N}\;\;\text{,} (2)
𝚲r=[𝐚r(ϑ1,φ1),,𝐚r(ϑN,φN)]Nr×N,\boldsymbol{\Lambda}_{\mathrm{r}}=\left[\mathbf{a}_{\mathrm{r}}\left(\vartheta_{1},\varphi_{1}\right),\cdots,\mathbf{a}_{\mathrm{r}}\left(\vartheta_{N},\varphi_{N}\right)\right]\in\mathbb{C}^{N_{\mathrm{r}}\times N}\;\text{,} (3)

where the ithi^{\text{{th}}} column vectors 𝐚t(θi,ϕi)\mathbf{a}_{\mathrm{t}}\left(\theta_{i},\phi_{i}\right) and 𝐚r(ϑi,φi)\mathbf{a}_{\mathrm{r}}\left(\vartheta_{i},\varphi_{i}\right) are

𝐚t(θi,ϕi)=[ej(11)ksinθisinϕi,,ej(Nt1)ksinθisinϕi]T,\mathbf{a}_{\mathrm{t}}\left(\theta_{i},\phi_{i}\right)=[e^{j(1-1)k\sin\theta_{i}\sin\phi_{i}},\cdots,e^{j(N_{\mathrm{t}}-1)k\sin\theta_{i}\sin\phi_{i}}]^{\mathrm{T}}\;\text{,} (4)
𝐚r(ϑi,φi)=[ej(11)ksinϑisinφi,,ej(Nr1)ksinϑisinφi]T.\mathbf{a}_{\mathrm{r}}\left(\vartheta_{i},\varphi_{i}\right)=[e^{j(1-1)k\sin\vartheta_{i}\sin\varphi_{i}},\cdots,e^{j(N_{\mathrm{r}}-1)k\sin\vartheta_{i}\sin\varphi_{i}}]^{\mathrm{T}}\text{.} (5)

The parameter k=2πd/λk=2\pi d/\lambda where dd is the separation between transmit/receive antennas at BS/MS, and λ\lambda is the wavelength of transmitted signal. The diagonal matrix 𝚽=diag[ejϱ]\mathbf{\Phi}=\operatorname{diag}[e^{j{\color[rgb]{0,0,0}\boldsymbol{\varrho}}}] where ejϱe^{j{\color[rgb]{0,0,0}\boldsymbol{\varrho}}} is an element-wise power operation, and the N×1N\times 1 vector ϱ=[ϱ1,,ϱN]T{\color[rgb]{0,0,0}\boldsymbol{\varrho}=[\varrho_{1},\cdots,\varrho_{N}]^{\mathrm{T}}} represents the phase shifts of NN reflecting elements at RIS. The diagonal matrix 𝐇=diag[𝐡]\mathbf{H}=\operatorname{diag}[\mathbf{h}] where the N×1N\times 1 vector 𝐡=[h1,,hN]T\mathbf{h}=[h_{1},\cdots,h_{N}]^{\mathrm{T}} represents the propagation gains of NN reflection paths, and the entries in it are independent and identically distributed.

II-C Received Signal Model

The signal transmitted by the BS is denoted as 𝐗Nt×L\mathbf{X}\in\mathbb{C}^{N_{\mathrm{t}}\times L} where LL represents the number of consumed time slots, and the column vector 𝒙(i)\boldsymbol{x}(i) in it represents the signal transmitted at the iith time slot. Applying the vectorization operation, the received signal 𝒚LNr×1\boldsymbol{y}\in\mathbb{C}^{LN_{\mathrm{r}}\times 1} at the MS can be expressed as

𝒚=[𝒚(1)𝒚(2)𝒚(L)]=[𝐇~𝒙(1)𝐇~𝒙(2)𝐇~𝒙(L)]+[𝒏𝒏𝒏],\boldsymbol{y}=\left[\begin{array}[]{c}\boldsymbol{y}(1)\\ \boldsymbol{y}(2)\\ \vdots\\ \boldsymbol{y}(L)\end{array}\right]=\left[\begin{array}[]{c}\tilde{\mathbf{H}}\boldsymbol{x}(1)\\ \tilde{\mathbf{H}}\boldsymbol{x}(2)\\ \vdots\\ \tilde{\mathbf{H}}\boldsymbol{x}(L)\end{array}\right]+\left[\begin{array}[]{c}\boldsymbol{n}\\ \boldsymbol{n}\\ \vdots\\ \boldsymbol{n}\end{array}\right]\;\text{,} (6)

where the vector 𝒏Nr×1\boldsymbol{n}\in\mathbb{C}^{N_{\mathrm{r}}\times 1} is an additive white Gaussian noise with the elements independently drawn from 𝒞𝒩(0,σ2)\mathcal{C}\mathcal{N}(0,\sigma^{2}), and the transmit power at the llth slot is pBS=𝔼{𝒙H(l)𝒙(l)}p_{\mathrm{BS}}=\mathbb{E}\{{\boldsymbol{x}^{\mathrm{H}}(l)}\boldsymbol{x}(l)\}.

III Cramer-Rao Bound on Position Estimation

Based on the channel model, the unknown parameters to be estimated can be denoted as a 3N3N dimensional vector 𝜼\boldsymbol{\eta},

𝜼=[ϑ1,,ϑN,φ1,,φN,h1,,hN]T.\boldsymbol{\eta}=[\vartheta_{1},\cdots,\vartheta_{N},\;\varphi_{1},\cdots,\varphi_{N},\;h_{1},\cdots,h_{N}]^{\mathrm{T}}\;\text{.} (7)

We denote the unbiased estimator of 𝜼\boldsymbol{\eta} as 𝜼^\hat{\boldsymbol{\eta}}, and based on the Cramer-Rao theorem [9, 10], the mean-square error is bounded as

𝔼[(𝜼^𝜼)(𝜼^𝜼)H]𝐉𝜼1,\mathbb{E}\left[(\hat{\boldsymbol{\eta}}-\boldsymbol{\eta})(\hat{\boldsymbol{\eta}}-\boldsymbol{\eta})^{\mathrm{H}}\right]\geq\mathbf{J}_{\boldsymbol{\eta}}^{-1}\;\text{,} (8)

where 𝐉𝜼\mathbf{J}_{\boldsymbol{\eta}} is the 3N×3N3N\times 3N Fisher information matrix, and [𝐉𝜼1]m,m[\mathbf{J}_{\boldsymbol{\eta}}^{-1}]_{m,m} is the Cramer-Rao lower bound for the mmth parameter estimate. The (m,n)(m,n)th entry of 𝐉𝜼\mathbf{J}_{\boldsymbol{\eta}} is defined as

[𝐉𝜼]m,n\displaystyle\left[\mathbf{J}_{\boldsymbol{\eta}}\right]_{m,n} 𝔼[2lnp(𝒚;𝜼)ηmηn]\displaystyle\triangleq\mathbb{E}\left[-\frac{\partial^{2}\ln p(\boldsymbol{y};\boldsymbol{\eta})}{\partial{\eta}_{m}\partial{\eta}_{n}}\right] (9)
𝔼[lnp(𝒚;𝜼)ηmlnp(𝒚;𝜼)ηn],\displaystyle\equiv\mathbb{E}\left[\frac{\partial\ln p(\boldsymbol{y};\boldsymbol{\eta})}{\partial{\eta}_{m}}\frac{\partial\ln p(\boldsymbol{y};\boldsymbol{\eta})}{\partial{\eta}_{n}}\right]\;\text{,}

where p(𝒚;𝜼)p(\boldsymbol{y};\boldsymbol{\eta}) is the likelihood function of the random vector 𝒚\boldsymbol{y} conditioned on 𝜼\boldsymbol{\eta}, and ηm\eta_{m} is the mmth entry of 𝜼\boldsymbol{\eta}. The proof of the identity in Eq. (9) is given in [10]. Based on the received signal model, p(𝒚;𝜼)p(\boldsymbol{y};\boldsymbol{\eta}) can be written as

p(𝒚;𝜼)=(2π)LNr2(detσ2𝐈)12e12[𝝁H(σ2𝐈)1𝝁],p(\boldsymbol{y};\boldsymbol{\eta})=(2\pi)^{-\frac{LN_{\mathrm{r}}}{2}}\left(\operatorname{det}\sigma^{2}\mathbf{I}\right)^{-\frac{1}{2}}e^{-\frac{1}{2}\left[\boldsymbol{\mu}^{\mathrm{H}}\left(\sigma^{2}\mathbf{I}\right)^{-1}\boldsymbol{\mu}\right]}\;\text{,} (10)

where the vector 𝝁\boldsymbol{\mu} is the mean vector of the random vector 𝒚\boldsymbol{y} conditioned on 𝜼\boldsymbol{\eta}.

To further obtain the Fisher information matrix 𝐉𝜼\mathbf{J}_{\boldsymbol{\eta}}, we first present the following Lemma from Eq. (6) in [11]:

Lemma.

For an NN dimensional random vector 𝐲\boldsymbol{y} which obeys the symmetric complex Gaussian distribution 𝒞𝒩(𝛍,𝚺)\mathcal{C}\mathcal{N}(\boldsymbol{\mu},\mathbf{\Sigma}), the (m,n)(m,n)th entry of the Fisher information matrix is given by

[𝐉]m,n=2𝔢{𝝁Hηm𝚺1𝝁ηn}+𝔗𝔯{𝚺1𝚺ηm𝚺1𝚺ηn}.\left[\mathbf{J}\right]_{m,n}=2\mathfrak{Re}\left\{\frac{\partial\boldsymbol{\mu}^{\mathrm{H}}}{\partial\eta_{m}}\mathbf{\Sigma}^{-1}\frac{\partial\boldsymbol{\mu}}{\partial\eta_{n}}\right\}+\mathfrak{Tr}\left\{\mathbf{\Sigma}^{-1}\frac{\partial\mathbf{\Sigma}}{\partial\eta_{m}}\mathbf{\Sigma}^{-1}\frac{\partial\mathbf{\Sigma}}{\partial\eta_{n}}\right\}. (11)

By using the above Lemma, the (m,n)(m,n)th entry of 𝐉𝜼\mathbf{J}_{\boldsymbol{\eta}} in Eq. (9) can be rewritten as

[𝐉𝜼]m,n=l=1L2σ2𝔢{𝝁H(l)ηm𝝁(l)ηn}=l=1L[𝐉𝜼(l)]m,n,\left[\mathbf{J}_{\boldsymbol{\eta}}\right]_{m,n}=\sum_{l=1}^{L}\frac{2}{\sigma^{2}}\mathfrak{Re}\left\{\frac{\partial{\boldsymbol{\mu}^{\mathrm{H}}(l)}}{\partial\eta_{m}}\frac{\partial\boldsymbol{\mu}(l)}{\partial\eta_{n}}\right\}=\sum_{l=1}^{L}\left[\mathbf{J}_{\boldsymbol{\eta}}(l)\right]_{m,n}\;\text{,} (12)

where the mean vector 𝝁(l)=𝐇~𝒙(l)\boldsymbol{\mu}(l)=\tilde{\mathbf{H}}\boldsymbol{x}(l). Eq. (12) demonstrates that the Fisher information matrix 𝐉𝜼\mathbf{J}_{\boldsymbol{\eta}} is the sum of the Fisher information matrix 𝐉𝜼(l)\mathbf{J}_{\boldsymbol{\eta}}(l) at each time slot. The rest in this section gives the solving process of 𝐉𝜼(l)\mathbf{J}_{\boldsymbol{\eta}}(l).

We rewrite the Fisher information matrix 𝐉𝜼(l)\mathbf{J}_{\boldsymbol{\eta}}(l) as a partitioned matrix in Eq. (13) which is for later use.

𝐉𝜼(l)=2σ2[𝓐B\hdashline[2pt/2pt]𝓒D] }2N } N 2N N\mathbf{J}_{\boldsymbol{\eta}}(l)=\frac{2}{\sigma^{2}}\begin{array}[]{c@{}l}\left[\begin{array}[]{ccc;{2pt/2pt}c}&&&\\ &\bm{\mathcal{A}}&&\bm{\mathcal{B}}\\ &&&\\ \hdashline[2pt/2pt]&&&\\ &\bm{\mathcal{C}}&&\bm{\mathcal{D}}\\ \end{array}\right]&\begin{array}[]{l}\left.\rule{-4.97922pt}{22.19315pt}\right\}{\scriptsize\text{2{N}}}\\ \left.\rule{-4.97922pt}{13.79959pt}\right\}{\scriptsize\text{{\;N}}}\end{array}\\[-5.0pt] \begin{array}[]{cc}\underbrace{\rule{58.89719pt}{0.0pt}}_{\text{2{N}}}\underbrace{\rule{10.66977pt}{0.0pt}}_{\text{{N}}}\end{array}\end{array} (13)

where the entries in submatrix 𝓐\bm{\mathcal{A}} contain the partial derivatives with respect to the azimuth/elevation AoA, while the entries in submatrices 𝓑\bm{\mathcal{B}}, 𝓒\bm{\mathcal{C}} and 𝓓\bm{\mathcal{D}} contain the partial derivatives with respect to the propagation gains.

Next, we give the partial derivatives of 𝝁(l)\boldsymbol{\mu}(l) with respect to the azimuth/elevation AoA. Before giving it, we first give the partial derivatives of the matrix 𝚲r(𝐇𝚽)𝚲tH\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}}. The (m,n)(m,n)th entry of the matrix 𝚲r(𝐇𝚽)𝚲tH\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}} is given by

[𝚲r(𝐇𝚽)𝚲tH]m,n=i=1Nhiej[ϱi+(m1)ξi+(1n)ζi],\left[\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}}\right]_{m,n}=\sum_{i=1}^{N}h_{i}e^{j\left[{\color[rgb]{0,0,0}\varrho_{i}}+(m-1)\xi_{i}+(1-n)\zeta_{i}\right]}\;\text{,} (14)

where ξi=ksinϑisinφi\xi_{i}=k\sin\vartheta_{i}\sin\varphi_{i} and ζi=ksinθisinϕi\zeta_{i}=k\sin\theta_{i}\sin\phi_{i}. To separate the response of RIS, the partial derivatives of the matrix 𝚲r(𝐇𝚽)𝚲tH\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}} with respect to the azimuth/elevation AoA are given by

[𝚲r(𝐇𝚽)𝚲tH]ϑi=ejϱi𝚵˙iNr×Nt,\frac{\partial\left[\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}}\right]}{\partial\vartheta_{i}}=e^{j{\color[rgb]{0,0,0}\varrho_{i}}}\boldsymbol{\dot{\Xi}}_{i}\in\mathbb{C}^{N_{\mathrm{r}}\times N_{\mathrm{t}}}\;\text{,} (15)
[𝚲r(𝐇𝚽)𝚲tH]φi=ejϱi𝚵¨iNr×Nt,\frac{\partial\left[\mathbf{\Lambda}_{\mathrm{r}}(\mathbf{H}\mathbf{\Phi})\mathbf{\Lambda}_{\mathrm{t}}^{\mathrm{H}}\right]}{\partial\varphi_{i}}=e^{j{\color[rgb]{0,0,0}\varrho_{i}}}\boldsymbol{\ddot{\Xi}}_{i}\in\mathbb{C}^{N_{\mathrm{r}}\times N_{\mathrm{t}}}\;\text{,} (16)

where

[𝚵˙i]m,n=hij(m1)ksinφicosϑiej[(m1)ξi+(1n)ζi],[\boldsymbol{\dot{\Xi}}_{i}]_{m,n}=h_{i}j(m-1)k\sin\varphi_{i}\cos\vartheta_{i}e^{j\left[(m-1)\xi_{i}+(1-n)\zeta_{i}\right]}\;\text{,} (17)
[𝚵¨i]m,n=hij(m1)ksinϑicosφiej[(m1)ξi+(1n)ζi].[\boldsymbol{\ddot{\Xi}}_{i}]_{m,n}=h_{i}j(m-1)k\sin\vartheta_{i}\cos\varphi_{i}e^{j\left[(m-1)\xi_{i}+(1-n)\zeta_{i}\right]}\;\text{.} (18)

Then, we obtain the partial derivatives of 𝝁(l)\boldsymbol{\mu}(l) with respect to the azimuth/elevation AoA as follows:

𝝁(l)ϑi=ejϱiϖ˙i(l)Nr×1,\frac{\partial\boldsymbol{\mu}(l)}{\partial\vartheta_{i}}=e^{j{\color[rgb]{0,0,0}\varrho_{i}}}\boldsymbol{\dot{\varpi}}_{i}(l)\in\mathbb{C}^{N_{\mathrm{r}}\times 1}\;\text{,} (19)
𝝁(l)φi=ejϱiϖ¨i(l)Nr×1,\frac{\partial\boldsymbol{\mu}(l)}{\partial\varphi_{i}}=e^{j{\color[rgb]{0,0,0}\varrho_{i}}}\boldsymbol{\ddot{\varpi}}_{i}(l)\in\mathbb{C}^{N_{\mathrm{r}}\times 1}\;\text{,} (20)

where ϖ˙i(l)=𝚵˙i𝒙(l)\boldsymbol{\dot{\varpi}}_{i}(l)=\boldsymbol{\dot{\Xi}}_{i}\boldsymbol{x}(l) and ϖ¨i(l)=𝚵¨i𝒙(l)\boldsymbol{\ddot{\varpi}}_{i}(l)=\boldsymbol{\ddot{\Xi}}_{i}\boldsymbol{x}(l).

Compared with the azimuth/elevation AoA, what we are more interested in is the absolute MS position 𝒒1:2=[qx,qy]T\boldsymbol{q}_{1:2}=[q_{x},q_{y}]^{\mathrm{T}}. The Fisher information matrix of it can be obtained by means of the 2×3N2\times 3N transformation matrix 𝐓\mathbf{T}, which is expressed as

𝐉𝒒(l)=𝐓𝐉𝜼(l)𝐓T,\mathbf{J}_{\boldsymbol{q}}(l)=\mathbf{T}\mathbf{J}_{\boldsymbol{\eta}}(l)\mathbf{T}^{\mathrm{T}}\;\text{,} (21)

where the transformation matrix 𝐓\mathbf{T} is defined as

𝐓𝜼T𝒒1:2.\mathbf{T}\triangleq\frac{\partial\boldsymbol{\eta}^{\mathrm{T}}}{\partial\boldsymbol{q}_{1:2}}\;\text{.} (22)

The entries of the transformation matrix 𝐓\mathbf{T} can be obtained by the geometrical relationship between the azimuth/elevation AoA and the MS position which is shown as follows:

ϑi=arctan[𝒒1:2𝒔1:2i2szi],\vartheta_{i}=\arctan\left[\frac{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}{s_{z}^{i}}\right]\;\text{,} (23)
φi=arccos[|qxsxi|𝒒1:2𝒔1:2i2].\varphi_{i}=\arccos\left[-\frac{\left|q_{x}-s_{x}^{i}\right|\;}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}\right]\;\text{.} (24)

Then, by computing the partial derivatives of the azimuth and elevation AoA with respect to the MS position, we obtain the transformation matrix 𝐓\mathbf{T} as follows:

𝐓=[𝓔F𝓖] N N N\begin{array}[]{cc}\mathbf{T}=\left[\begin{array}[]{ccc;{2pt/2pt}ccc;{2pt/2pt}ccc}&\bm{\mathcal{E}}&&&\bm{\mathcal{F}}&&&\bm{\mathcal{G}}&\end{array}\right]\par\\[-6.0pt] \begin{array}[]{cccc}\;\;\;\;\;\;\;\underbrace{\rule{43.39044pt}{0.0pt}}_{\text{{N}}}\underbrace{\rule{43.24817pt}{0.0pt}}_{\text{{N}}}\underbrace{\rule{43.24817pt}{0.0pt}}_{\text{{N}}}\end{array}\end{array} (25)

where the iith column vector of the submatrices 𝓔\bm{\mathcal{E}}, 𝓕\bm{\mathcal{F}} and 𝓖\bm{\mathcal{G}} respectively are

[𝓔]i=ϑi𝒒1:2=szi𝒒1:2𝒔1:2i22+(szi)2[cosφi,sinφi]T,[\bm{\mathcal{E}}]_{i}=\frac{\partial\vartheta_{i}}{\partial\boldsymbol{q}_{1:2}}=\frac{s_{z}^{i}}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}^{2}+{(s_{z}^{i})}^{2}}[-\cos\varphi_{i},\sin\varphi_{i}]^{\mathrm{T}}\;\text{,} (26)
[𝓕]i=φi𝒒1:2=1𝒒1:2𝒔1:2i2[sinφi,cosφi]T,[\bm{\mathcal{F}}]_{i}=\frac{\partial\varphi_{i}}{\partial\boldsymbol{q}_{1:2}}=\frac{1}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}[\sin\varphi_{i},\cos\varphi_{i}]^{\mathrm{T}}\;\text{,}\qquad\qquad\; (27)
[𝓖]i=hi𝒒1:2=[0,0]T.[\bm{\mathcal{G}}]_{i}=\frac{\partial h_{i}}{\partial\boldsymbol{q}_{1:2}}=[0,0]^{\mathrm{T}}\;\text{.}\;\qquad\qquad\qquad\qquad\qquad\qquad\qquad (28)

The Eqs. (26) - (28) are derived in subsection A of Appendix. Because the 2×N2\times N submatrix 𝓖\bm{\mathcal{G}} is a zero matrix, then based on the multiplication principle of partitioned matrix, Eq. (21) can be simplified as

𝐉𝒒(l)=2σ2𝐓~𝓐𝐓~T,\mathbf{J}_{\boldsymbol{q}}(l)=\frac{2}{\sigma^{2}}\tilde{\mathbf{T}}\bm{\mathcal{A}}\tilde{\mathbf{T}}^{\mathrm{T}}\;\text{,} (29)

where the matrix 𝐓~\tilde{\mathbf{T}} consists of the submatrices 𝓔\bm{\mathcal{E}} and 𝓕\bm{\mathcal{F}}, and the matrix 𝓐\bm{\mathcal{A}} is the 2N×2N2N\times 2N submatrix in Eq. (13).

We rewrite the matrix 𝓐\bm{\mathcal{A}} as a partitioned matrix as follows:

𝓐=[𝓗 I\hdashline[2pt/2pt]𝓙 K] }N }N N N\begin{array}[]{c@{}l}\bm{\mathcal{A}}=\left[\begin{array}[]{c;{2pt/2pt}c}&\\ \quad\bm{\mathcal{H}}&\quad\bm{\mathcal{I}}\\ &\\ \hdashline[2pt/2pt]&\\ \quad\bm{\mathcal{J}}&\quad\bm{\mathcal{K}}\\ &\\ \end{array}\right]\begin{array}[]{l}\left.\rule{-7.11317pt}{19.2056pt}\right\}{\scriptsize\text{{N}}}\\ \left.\rule{-7.11317pt}{19.2056pt}\right\}{\scriptsize\text{{N}}}\end{array}\\[-5.0pt] \begin{array}[]{ccc}\;\underbrace{\rule{41.25648pt}{0.0pt}}_{\text{{N}}}\underbrace{\rule{39.83385pt}{0.0pt}}_{\text{{N}}}\end{array}\end{array} (30)

Based on the definition of the (m,n)(m,n)th entry of 𝐉𝜼(l)\mathbf{J}_{\boldsymbol{\eta}}(l) in Eq. (12) and the partial derivatives of 𝝁(l)\boldsymbol{\mu}(l) with respect to the azimuth/elevation AoA in Eqs. (19) and (20), we find that the response of RIS in the (m,n)(m,n)th entry of the submatrix 𝓗\bm{\mathcal{H}} is same with those in the submatrices 𝓘\bm{\mathcal{I}}, 𝓙\bm{\mathcal{J}} and 𝓚\bm{\mathcal{K}}, which is ej(ϱnϱm)e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}. Then, the entries in the 2×22\times 2 Fisher information matrix 𝐉𝒒(l)\mathbf{J}_{\boldsymbol{q}}(l) can be given as

[𝐉𝒒(l)]1,1=2σ2m=1Nn=1N𝔢[ej(ϱnϱm)κm,n1,1(l)],\left[\mathbf{J}_{\boldsymbol{q}}(l)\right]_{1,1}=\frac{2}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\mathfrak{Re}\left[e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,n}^{1,1}(l)\right]\;\text{,} (31)
[𝐉𝒒(l)]1,2=2σ2m=1Nn=1N𝔢[ej(ϱnϱm)κm,n1,2(l)],\left[\mathbf{J}_{\boldsymbol{q}}(l)\right]_{1,2}=\frac{2}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\mathfrak{Re}\left[e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,n}^{1,2}(l)\right]\;\text{,} (32)
[𝐉𝒒(l)]2,1=2σ2m=1Nn=1N𝔢[ej(ϱnϱm)κm,n2,1(l)],\left[\mathbf{J}_{\boldsymbol{q}}(l)\right]_{2,1}=\frac{2}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\mathfrak{Re}\left[e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,n}^{2,1}(l)\right]\;\text{,} (33)
[𝐉𝒒(l)]2,2=2σ2m=1Nn=1N𝔢[ej(ϱnϱm)κm,n2,2(l)],\left[\mathbf{J}_{\boldsymbol{q}}(l)\right]_{2,2}=\frac{2}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\mathfrak{Re}\left[e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,n}^{2,2}(l)\right]\;\text{,} (34)

where the scalars κm,n1,1(l)\kappa_{m,n}^{1,1}(l), κm,n1,2(l)\kappa_{m,n}^{1,2}(l), κm,n2,1(l)\kappa_{m,n}^{2,1}(l) and κm,n2,2(l)\kappa_{m,n}^{2,2}(l) are

κm,n1,1(l)=\displaystyle\kappa_{m,n}^{1,1}(l)= αmxαnxϖ˙mH(l)ϖ˙n(l)+βmxαnxϖ¨mH(l)ϖ˙n(l)\displaystyle\;\alpha_{m}^{x}\alpha_{n}^{x}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l)+\beta_{m}^{x}\alpha_{n}^{x}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l) (35)
+\displaystyle+ αmxβnxϖ˙mH(l)ϖ¨n(l)+βmxβnxϖ¨mH(l)ϖ¨n(l),\displaystyle\;\alpha_{m}^{x}\beta_{n}^{x}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)+\beta_{m}^{x}\beta_{n}^{x}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)\;\text{,}
κm,n1,2(l)=\displaystyle\kappa_{m,n}^{1,2}(l)= αmxαnyϖ˙mH(l)ϖ˙n(l)+βmxαnyϖ¨mH(l)ϖ˙n(l)\displaystyle\;\alpha_{m}^{x}\alpha_{n}^{y}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l)+\beta_{m}^{x}\alpha_{n}^{y}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l) (36)
+\displaystyle+ αmxβnyϖ˙mH(l)ϖ¨n(l)+βmxβnyϖ¨mH(l)ϖ¨n(l),\displaystyle\;\alpha_{m}^{x}\beta_{n}^{y}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)+\beta_{m}^{x}\beta_{n}^{y}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)\;\text{,}
κm,n2,1(l)=\displaystyle\kappa_{m,n}^{2,1}(l)= αmyαnxϖ˙mH(l)ϖ˙n(l)+βmyαnxϖ¨mH(l)ϖ˙n(l)\displaystyle\;\alpha_{m}^{y}\alpha_{n}^{x}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l)+\beta_{m}^{y}\alpha_{n}^{x}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l) (37)
+\displaystyle+ αmyβnxϖ˙mH(l)ϖ¨n(l)+βmyβnxϖ¨mH(l)ϖ¨n(l),\displaystyle\;\alpha_{m}^{y}\beta_{n}^{x}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)+\beta_{m}^{y}\beta_{n}^{x}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)\;\text{,}
κm,n2,2(l)=\displaystyle\kappa_{m,n}^{2,2}(l)= αmyαnyϖ˙mH(l)ϖ˙n(l)+βmyαnyϖ¨mH(l)ϖ˙n(l)\displaystyle\;\alpha_{m}^{y}\alpha_{n}^{y}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l)+\beta_{m}^{y}\alpha_{n}^{y}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\dot{\varpi}}_{n}(l) (38)
+\displaystyle+ αmyβnyϖ˙mH(l)ϖ¨n(l)+βmyβnyϖ¨mH(l)ϖ¨n(l),\displaystyle\;\alpha_{m}^{y}\beta_{n}^{y}\boldsymbol{\dot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)+\beta_{m}^{y}\beta_{n}^{y}\boldsymbol{\ddot{\varpi}}_{m}^{\mathrm{H}}(l)\boldsymbol{\ddot{\varpi}}_{n}(l)\;\text{,}

and the parameters αmx\alpha_{m}^{x}, αmy\alpha_{m}^{y}, βmx\beta_{m}^{x} and βmy\beta_{m}^{y} respectively are the first and second entries of [𝓔]m[\bm{\mathcal{E}}]_{m} and [𝓕]m[\bm{\mathcal{F}}]_{m}. Then, by using Eq. (12), we obtain the entries of the Fisher information matrix 𝐉𝒒\mathbf{J}_{\boldsymbol{q}} as follows:

[𝐉𝒒]a,b=l=1L[𝐉𝒒(l)]a,b,a=1, 2;b=1, 2.\left[\mathbf{J}_{\boldsymbol{q}}\right]_{a,b}=\sum_{l=1}^{L}\left[\mathbf{J}_{\boldsymbol{q}}(l)\right]_{a,b}\text{,}\;a=1\text{,}\;2;\;b=1\text{,}\;2\;\text{.} (39)

Finally, we obtain the Cramer-Rao lower bound for the MS position estimate which is the trace of the inverse matrix of the Fisher information matrix 𝐉𝒒\mathbf{J}_{\boldsymbol{q}}. The above result can be summarized as a theorem:

Theorem.

For an RIS-assisted wireless localization system modeled as Section II, the Cramer-Rao lower bound for the estimate of absolute MS position can be expressed as

CRLB=𝔗𝔯(𝐉𝒒1)=[𝐉𝒒]1,1+[𝐉𝒒]2,2[𝐉𝒒]1,1[𝐉𝒒]2,2[𝐉𝒒]1,2[𝐉𝒒]2,1.\text{CRLB}=\mathfrak{Tr}\left(\mathbf{J}_{\boldsymbol{q}}^{-1}\right)=\frac{\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}+\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}}{\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}-\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,2}\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,1}}\;\text{.} (40)

IV Reflect Beamforming Design at RIS

In this paper, we aim to minimize the Cramer-Rao lower bound for the MS position estimate by optimizing the reflect beamforming at the RIS. Accordingly, the optimization problem can be formulated as

minϱ\displaystyle\min_{\boldsymbol{\varrho}} f(ϱ)=[𝐉𝒒]1,1+[𝐉𝒒]2,2[𝐉𝒒]1,1[𝐉𝒒]2,2[𝐉𝒒]1,2[𝐉𝒒]2,1\displaystyle\quad f({\boldsymbol{\varrho}})=\frac{\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}+\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}}{\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}-\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,2}\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,1}} (41)
s.t.\displaystyle\operatorname{s.t.} 0ϱn2π,n=1,,N.\displaystyle\quad{0\leq{\varrho_{n}}\leq 2\pi,\quad\forall n=1,\cdots,N}.

Because the objective function in Eq. (41) is a non-convex fractional function, it is difficult to obtain the global optimal solution. To further analyze this problem, we utilize the gradient decent method (GDM) to make the reflect beamforming design. In the gradient flow direction which is defined as the direction of the negative gradient ϱf(ϱ)-\nabla_{\boldsymbol{\varrho}}f(\boldsymbol{\varrho}), the function f(ϱ)f(\boldsymbol{\varrho}) decreases at the maximum descent rate. And each component of the gradient vector gives the rate of change of the scalar function in the component direction [12].

The function f(ϱ)f(\boldsymbol{\varrho}) is a scalar function with respect to an N×1N\times 1 vector-variable. Thus, the gradient of it is expressed as

ϱf(ϱ)=[f(ϱ)ϱ1,f(ϱ)ϱ2,,f(ϱ)ϱN]T,\nabla_{{\boldsymbol{\varrho}}}f({\boldsymbol{\varrho}})=\left[\frac{\partial f({\boldsymbol{\varrho}})}{\partial{\varrho_{1}}},\frac{\partial f({\boldsymbol{\varrho}})}{\partial{\varrho_{2}}},\cdots,\frac{\partial f({\boldsymbol{\varrho}})}{\partial{\varrho_{N}}}\right]^{\mathrm{T}}\;\text{,} (42)

where the partial derivative of f(ϱ)f(\boldsymbol{\varrho}) with respect to ϱi\varrho_{i} is given in Eq. (43) at the top of the next page.

f(ϱ)ϱi=([𝐉𝒒]1,1ϱi+[𝐉𝒒]2,2ϱi)𝔇𝔢𝔑𝔲([𝐉𝒒]1,1ϱi[𝐉𝒒]2,2+[𝐉𝒒]1,1[𝐉𝒒]2,2ϱi[𝐉𝒒]1,2ϱi[𝐉𝒒]2,1[𝐉𝒒]1,2[𝐉𝒒]2,1ϱi)𝔇𝔢2\frac{\partial f(\boldsymbol{\varrho})}{\partial\varrho_{i}}=\frac{\left(\frac{\partial\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}}{\partial\varrho_{i}}+\frac{\partial\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}}{\partial\varrho_{i}}\right)\mathfrak{De}-\mathfrak{N}_{\mathfrak{u}}\left(\frac{\partial\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}}{\partial\varrho_{i}}\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}+\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,1}\frac{\partial\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,2}}{\partial\varrho_{i}}-\frac{\partial\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,2}}{\partial\varrho_{i}}\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,1}-\left[\mathbf{J}_{\boldsymbol{q}}\right]_{1,2}\frac{\partial\left[\mathbf{J}_{\boldsymbol{q}}\right]_{2,1}}{\partial\varrho_{i}}\right)}{{\mathfrak{De}}^{2}} (43)

The parameters 𝔑𝔲\mathfrak{Nu} and 𝔇𝔢\mathfrak{De} in it represent the numerator and denominator of f(ϱ)f(\boldsymbol{\varrho}), respectively, and the partial derivatives of the entries in the Fisher information matrix 𝐉𝒒\mathbf{J}_{\boldsymbol{q}} with respect to ϱi\varrho_{i} is given as follows:

[𝐉q]1,1ϱi=4σ2l=1LniN𝔢[jej(ϱiϱn)κn,i1,1(l)],\frac{\partial\left[\mathbf{J}_{q}\right]_{1,1}}{\partial{\varrho_{i}}}=\frac{4}{\sigma^{2}}\sum_{l=1}^{L}\sum_{n\neq i}^{N}\mathfrak{Re}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}\kappa_{n,i}^{1,1}(l)\right]\;\text{,} (44)
[𝐉q]1,2ϱi=4σ2l=1LniN𝔢[jej(ϱiϱn)κn,i1,2(l)],\frac{\partial\left[\mathbf{J}_{q}\right]_{1,2}}{\partial{\varrho_{i}}}=\frac{4}{\sigma^{2}}\sum_{l=1}^{L}\sum_{n\neq i}^{N}\mathfrak{Re}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}\kappa_{n,i}^{1,2}(l)\right]\;\text{,} (45)
[𝐉q]2,1ϱi=4σ2l=1LniN𝔢[jej(ϱiϱn)κn,i2,1(l)],\frac{\partial\left[\mathbf{J}_{q}\right]_{2,1}}{\partial{\varrho_{i}}}=\frac{4}{\sigma^{2}}\sum_{l=1}^{L}\sum_{n\neq i}^{N}\mathfrak{Re}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}\kappa_{n,i}^{2,1}(l)\right]\;\text{,} (46)
[𝐉q]2,2ϱi=4σ2l=1LniN𝔢[jej(ϱiϱn)κn,i2,2(l)].\frac{\partial\left[\mathbf{J}_{q}\right]_{2,2}}{\partial{\varrho_{i}}}=\frac{4}{\sigma^{2}}\sum_{l=1}^{L}\sum_{n\neq i}^{N}\mathfrak{Re}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}\kappa_{n,i}^{2,2}(l)\right]\;\text{.} (47)

The Eqs. (44) - (47) are derived in subsection B of Appendix.

It should be noted that the objective function f(ϱ)f({\boldsymbol{\varrho}}), i.e., the Cramer-Rao lower bound for the MS position estimate is depend on the unknown parameter 𝜼\boldsymbol{\eta}, and we cannot directly utilize the GDM to optimize the objective function. To address this challenge, we adopt alternative optimization, as illustrated in Algorithm 1. More specifically, we start at an initial phase shift vector, and alternately update the estimator of 𝜼\boldsymbol{\eta} and optimize the phase shift vector ϱ\boldsymbol{\varrho}, until they converge. The estimation method used in Algorithm 1 is provided in the journal version, and will not be discussed here due to space limitation, and the detailed step of GDM-based reflect beamforming design is illustrated in Algorithm 2.

Algorithm 1 The Proposed Alternative Optimization Method
1:  Cramer-Rao lower bound: f(ϱ)f({\boldsymbol{\varrho}}).
2:  Initialize the phase shift vector ϱ[0]{\boldsymbol{\varrho}}[0].
3:  while 𝜼^\hat{\boldsymbol{\eta}} and ϱ{\boldsymbol{\varrho}} not converge do
4:     ithi^{\text{{th}}} iteration:
5:     Estimate the parameter vector 𝜼\boldsymbol{\eta} and denote as 𝜼^[i]\hat{\boldsymbol{\eta}}[i].
6:     Based on the current iteration estimator 𝜼^[i]\hat{\boldsymbol{\eta}}[i], the phase shift vector is optimized by using the GDM and denote as ϱ[i]{\boldsymbol{\varrho}}[i]. The GDM used is illustrated in Algorithm 2.
7:  end while
8:  Output: The estimator 𝜼^\hat{\boldsymbol{\eta}} and the reflect beamforming ϱ{\boldsymbol{\varrho}}.
Algorithm 2 The Proposed GDM-Based Reflect Beamforming
1:  Objective Function: f(ϱ)=𝔗𝔯(𝐉𝒒1)f({\boldsymbol{\varrho}})=\mathfrak{Tr}\left(\mathbf{J}_{\boldsymbol{q}}^{-1}\right).
2:  Input: The estimator 𝜼^[i]\hat{\boldsymbol{\eta}}[i].
3:  Set the number of iterations j=0j=0.
4:  Set the stop criterion for the loop: tolerance ϵ>0\epsilon>0.
5:  Take the phase shift vector result of the previous iteration as the initialized phase shift vector ϱ[i]=ϱ[i1]{\boldsymbol{\varrho}}[i]={\boldsymbol{\varrho}[i-1]}.
6:  Compute the objective function value under current ϱ[i]{\boldsymbol{\varrho}}[i].
7:  while stop criterion Δf(ϱ[i])>ϵ\Delta f(\boldsymbol{\varrho}[i])>\epsilon is not satisfied do
8:     Update the number of iterations j=j+1j=j+1.
9:     Choose ϱf(ϱ[i])-\nabla_{\boldsymbol{\varrho}}f(\boldsymbol{\varrho}[i]) as the search direction.
10:     Choose the step size tt via backtracking line search.
11:     Update the variable ϱ[i]:=ϱ[i]tϱf(ϱ[i])\boldsymbol{\varrho}[i]:=\boldsymbol{\varrho}[i]-t\nabla_{\boldsymbol{\varrho}}f(\boldsymbol{\varrho}[i]).
12:     Compute the objective function difference Δf(ϱ[i])\Delta f(\boldsymbol{\varrho}[i]).
13:  end while
14:  Output: jj, sub-optimal reflect beamforming ϱ[i]\boldsymbol{\varrho}[i].

V Numerical Results

This paper focuses on the impact of reflect beamforming on the Cramer-Rao lower bound for the MS position estimate, and aims to minimize it 111 Some prior works, like [3, 13], only provide the values of the Cramer-Rao lower bound for the estimate of AoA/AoD. But a small deviation in angle can result in a large deviation in absolute position, and the positioning accuracy can not be reflected directly. Thus, in this section, we present the values of the Cramer-Rao lower bound for the estimate of absolute MS position. . The estimation method is provided in the journal version, and will not be discussed here due to space limitation. Thus, we set up the system parameters to be known or have been estimated: the wavelength of mm-wave signal is set up as 0.0060.006, 𝒑=[0,0,0]T\boldsymbol{p}=[0,0,0]^{\mathrm{T}}, 𝒒=[50,100,0]T\boldsymbol{q}=[50,100,0]^{\mathrm{T}}, and the RIS is a uniform planar array in the vertical plane where 𝒔1=[20,50,20]T\boldsymbol{s}^{1}=[-20,50,20]^{\mathrm{T}} and the separation between each reflecting element is 0.10.1, all in meters. The propagation gains hi(i=1,,N)h_{i}\;(i=1,\cdots,N) of NN reflection paths are set up as random complex numbers which obey the distribution of 𝒞𝒩(0,1)\mathcal{C}\mathcal{N}(0,1).

V-A GDM-Based Reflect Beamforming

We first show the convergence behaviour of the proposed GDM-based algorithm in Fig. 2. In this simulation, we only consider 11 time slot consumed to transmit the pilot signal. The transmit and receive antenna numbers are both set up as 1010, and the separation equals to half-wavelength 0.0030.003. The RIS is set up as a 5×55\times 5 uniform planar array, i.e., there exist 2525 reflection paths. The SNR which is defined as pBS/(Nrσ2)p_{\mathrm{BS}}/(N_{\mathrm{r}}\sigma^{2}) are set up as 30dB30\;\text{dB} and 40dB40\;\text{dB}. (The impact of time slot number, reflecting element number, and SNR on the Cramer-Rao lower bound will be discussed in the next subsection.) The initial phase shift vector is generated randomly with the elements independently drawn from the uniform distribution on [0,2π][0,2\pi].

Refer to caption

Figure 2: The convergence behaviour of the proposed GDM-based algorithm.

The different dotted and solid curves in Fig. 2 are the gradient descent curves with different realizations of propagation gains. It is observed that by searching in the gradient flow direction, the Cramer-Rao lower bound values decrease quickly with the number of iterations. Compared with the case without optimizing the reflect beamforming, there is a significant improvement on Cramer-Rao lower bound when using the proposed algorithm. In addition, the convergence results show that by optimizing the reflect beamforming, the Cramer-Rao lower bound for the estimate of absolute MS position can attain about 0.1 and 0.01, i.e., decimeter-level or even centimeter-level positioning can be achieved by utilizing and optimizing the RIS, which satisfies the requirements of 6G wireless network technology.

V-B Impact of Time Slot, Reflecting Element Number, and SNR

Next, we show the impact of time slot number, reflecting element number, and SNR in Fig. 3. In this experiment, we consider the consumed time slot number in the interval of [1,10][1,10], the reflecting element number in the set of {16,25,36}\{16,25,36\}, and the SNR in the set of {20,30,40}\{20,30,40\} [dB]. It is observed that the Cramer-Rao lower bound decreases with the time slot number, the reflecting element number, and the SNR. The decimeter-level or even centimeter-level positioning can be achieved by utilizing the RIS with a large number of reflecting elements. But, it should be noted that the use of a large number of reflecting elements will result in the difficulty of estimating which is also the problem to be solved in the future.

Refer to caption

Figure 3: Cramer-Rao lower bound for the MS position estimate versus time slot with different reflecting element numbers and SNRs.

V-C Impact of MS Position

Finally, we show the impact of different MS position on the Cramer-Rao lower bound in Fig. 4. We consider two cases: one is that the xx-coordinate of MS position is in the interval of [0,100][0,100]; Another is that the yy-coordinate of MS position is in the interval of [50,150][50,150]. From the figure, we observe that the Cramer-Rao lower bound increases as the MS moves away from the RIS. More accurate localization can be achieved when the MS is closer to the RIS and more reflecting elements are utilized.

Refer to caption

Figure 4: Cramer-Rao lower bound for the MS position estimate versus xx and yy-coordinates of MS position with different numbers of reflecting elements.

VI Conclusion

In this paper, we utilize the advantages of mm-wave signals and large antenna arrays technologies, and introduce the RIS into the system to make the MS positioning more accurate. Our first contribution is to build the three-dimensional RIS-assisted wireless localization system model. After that, we derive the Fisher information matrix and the Cramer-Rao lower bound for the estimate of absolute MS position. Finally, we propose an alternative optimization method and a GDM-based algorithm to make the reflect beamforming design which aims to minimize the Cramer-Rao lower bound. The simulation results show that introducing RIS can make the positioning become possible when the line-of-sight is obstructed, and the proposed algorithm can make the estimation of MS position more accurate. The decimeter-level or even centimeter-level positioning can be achieved by utilizing the RIS with a large number of reflecting elements.

Appendix

VI-A Proof of Eqs. (26), (27) and (28)

By utilizing the geometrical relationship between the azimuth/elevation AoA and the MS position in Eqs. (24) and (23), and the derivatives of the inverse functions in Eq. (48),

(arccosx)=11x2,(arctanx)=11+x2,(\arccos x)^{\prime}=-\frac{1}{\sqrt{1-x^{2}}}\;\text{,}\;(\arctan x)^{\prime}=\frac{1}{1+x^{2}}\;\text{,} (48)

we give the derivatives of ϑi\vartheta_{i} and φi\varphi_{i} with respect to qxq_{x} as follows:

φiqx\displaystyle\frac{\partial\varphi_{i}}{\partial q_{x}} =arccos[sxiqx𝒒1:2𝒔1:2i2]qx\displaystyle=\frac{\partial\arccos\left[\frac{s_{x}^{i}-q_{x}}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}\right]}{\partial q_{x}} (49)
=𝒒1:2𝒔1:2i2+(sxiqx)121𝒒1:2𝒔1:2i22(qxsxi)1(sxiqx)2𝒒1:2𝒔1:2i22𝒒1:2𝒔1:2i22\displaystyle=\frac{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}+\left(s_{x}^{i}-q_{x}\right)\frac{1}{2}\frac{1}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}2\left(q_{x}-s^{i}_{x}\right)}{\sqrt{1-\frac{\left(s_{x}^{i}-q_{x}\right)^{2}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}^{2}}}\;\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}^{2}}
=𝒒1:2𝒔1:2i2(1(sxiqx)2𝒒1:2𝒔1:2i22)1(sxiqx)2𝒒1:2𝒔1:2i22𝒒1:2𝒔1:2i22\displaystyle=\frac{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}\left(1-\frac{\left(s_{x}^{i}-q_{x}\right)^{2}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}^{2}}\right)}{\sqrt{1-\frac{\left(s_{x}^{i}-q_{x}\right)^{2}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}^{2}}}\;\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}^{2}}
=1(sxiqx)2𝒒1:2𝒔1:2i22𝒒1:2𝒔1:2i2=sinφi𝒒1:2𝒔1:2i2,\displaystyle=\frac{\sqrt{1-\frac{\left(s_{x}^{i}-q_{x}\right)^{2}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}^{2}}}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}}=\frac{\sin\varphi_{i}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}}\;\text{,}
ϑiqx\displaystyle\frac{\partial\vartheta_{i}}{\partial q_{x}} =arctan[𝒒1:2𝒔1:2i2szi]qx\displaystyle=\frac{\partial\arctan\left[\frac{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}{s_{z}^{i}}\right]}{\partial q_{x}} (50)
=11+𝒒1:2𝒔1:2i22(szi)2121𝒒1:2𝒔1:2i22(qxsxi)szi(szi)2\displaystyle=\frac{1}{1+\frac{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}^{2}}{(s_{z}^{i})^{2}}}\frac{\frac{1}{2}\frac{1}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}2\left(q_{x}-s^{i}_{x}\right)s_{z}^{i}}{(s_{z}^{i})^{2}}\qquad\qquad\;
=1𝒒1:2𝒔1:2i22+(szi)2(qxsxi)szi𝒒1:2𝒔1:2i2\displaystyle=\frac{1}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}^{2}+(s_{z}^{i})^{2}}\frac{\left(q_{x}-s^{i}_{x}\right)s_{z}^{i}}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}}
=szicosφi𝒒1:2𝒔1:2i22+(szi)2.\displaystyle=\frac{-s_{z}^{i}\cos\varphi_{i}}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}^{2}+(s_{z}^{i})^{2}}\;\text{.}

Similarly, we obtain the derivatives of ϑi\vartheta_{i} and φi\varphi_{i} with respect to qyq_{y} as follows:

φiqy=cosφi𝒒1:2𝒔1:2i2,ϑiqy=szisinφi𝒒1:2𝒔1:2i22+(szi)2.\frac{\partial\varphi_{i}}{\partial q_{y}}=\frac{\cos\varphi_{i}}{\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\|_{2}}\;\text{,}\;\frac{\partial\vartheta_{i}}{\partial q_{y}}=\frac{s_{z}^{i}\sin\varphi_{i}}{\left\|\boldsymbol{q}_{1:2}-\boldsymbol{s}_{1:2}^{i}\right\|_{2}^{2}+(s_{z}^{i})^{2}}. (51)

In addition, the absolute MS position 𝒒\boldsymbol{q} is independent of the propagation gain hih_{i}, thus we have

hi𝒒1:2=[0,0]T.\frac{\partial h_{i}}{\partial\boldsymbol{q}_{1:2}}=[0,0]^{\mathrm{T}}\;\text{.} (52)

From the above, we complete the derivations of Eqs. (26), (27) and (28) in Section III.

VI-B Proof of Eqs. (44), (45), (46) and (47)

Take the partial derivative of the (1,1)(1,1)th entry of the Fisher information matrix 𝐉𝒒\mathbf{J}_{\boldsymbol{q}} with respect to ϱi{\color[rgb]{0,0,0}\varrho_{i}} as an example.

First, we give the partial derivative of [𝐉q(l)]1,1\left[\mathbf{J}_{q}(l)\right]_{1,1} as follows:

[𝐉q(l)]1,1ϱi\displaystyle\frac{\partial\left[\mathbf{J}_{q}(l)\right]_{1,1}}{\partial{\color[rgb]{0,0,0}\varrho_{i}}} ={2σ2m=1Nn=1N𝔢[ej(ϱnϱm)κm,n1,1(l)]}ϱi\displaystyle=\frac{\partial\left\{\frac{2}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\mathfrak{Re}\left[e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,n}^{1,1}(l)\right]\right\}}{\partial{\color[rgb]{0,0,0}\varrho_{i}}} (53)
={1σ2m=1Nn=1N[ej(ϱnϱm)κm,n1,1(l)]}ϱi\displaystyle=\frac{\partial\left\{\frac{1}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\left[e^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,n}^{1,1}(l)\right]\right\}}{\partial{\color[rgb]{0,0,0}\varrho_{i}}}
+{1σ2m=1Nn=1N[ej(ϱmϱn)(κm,n1,1(l))]}ϱi\displaystyle+\frac{\partial\left\{\frac{1}{\sigma^{2}}\sum_{m=1}^{N}\sum_{n=1}^{N}\left[e^{j({\color[rgb]{0,0,0}\varrho_{m}}-{\color[rgb]{0,0,0}\varrho_{n}})}(\kappa_{m,n}^{1,1}(l))^{*}\right]\right\}}{\partial{\color[rgb]{0,0,0}\varrho_{i}}}
=1σ2miN[jej(ϱiϱm)κm,i1,1(l)]\displaystyle={\frac{1}{\sigma^{2}}\sum_{m\neq i}^{N}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{m}})}\kappa_{m,i}^{1,1}(l)\right]}
+1σ2niN[jej(ϱnϱi)κi,n1,1(l)]\displaystyle+{\frac{1}{\sigma^{2}}\sum_{n\neq i}^{N}\left[-je^{j({\color[rgb]{0,0,0}\varrho_{n}}-{\color[rgb]{0,0,0}\varrho_{i}})}\kappa_{i,n}^{1,1}(l)\right]}
+1σ2niN[jej(ϱiϱn)(κi,n1,1(l))]\displaystyle+\frac{1}{\sigma^{2}}\sum_{n\neq i}^{N}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}(\kappa_{i,n}^{1,1}(l))^{*}\right]
+1σ2miN[jej(ϱmϱi)(κm,i1,1(l))]\displaystyle+\frac{1}{\sigma^{2}}\sum_{m\neq i}^{N}\left[-je^{j({\color[rgb]{0,0,0}\varrho_{m}}-{\color[rgb]{0,0,0}\varrho_{i}})}(\kappa_{m,i}^{1,1}(l))^{*}\right]
=4σ2niN𝔢[jej(ϱiϱn)κn,i1,1(l)].\displaystyle=\frac{4}{\sigma^{2}}\sum_{n\neq i}^{N}\mathfrak{Re}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}\kappa_{n,i}^{1,1}(l)\right]\;\text{.}

Then, by using Eq. (39), we obtain that

[𝐉q]1,1ϱi=4σ2l=1LniN𝔢[jej(ϱiϱn)κn,i1,1(l)].\frac{\partial\left[\mathbf{J}_{q}\right]_{1,1}}{\partial{\varrho_{i}}}=\frac{4}{\sigma^{2}}\sum_{l=1}^{L}\sum_{n\neq i}^{N}\mathfrak{Re}\left[je^{j({\color[rgb]{0,0,0}\varrho_{i}}-{\color[rgb]{0,0,0}\varrho_{n}})}\kappa_{n,i}^{1,1}(l)\right]\;\text{.} (54)

The derivations of Eqs. (45) - (47) follow the similar procedures and here we omit them due to space limitation.

From the above, we complete the derivations of Eqs. (44) - (47) in Section IV.

References

  • [1] A. Bourdoux, A. N. Barreto, B. van Liempd, C. de Lima, D. Dardari, D. Belot, E.-S. Lohan, G. Seco-Granados, H. Sarieddeen, H. Wymeersch, J. Suutala, J. Saloranta, M. Guillaud, M. Isomursu, M. Valkama, M. R. K. Aziz, R. Berkvens, T. Sanguanpuak, T. Svensson, and Y. Miao, “6G white paper on localization and sensing,” arXiv preprint:2006.01779, June 2020.
  • [2] S. Jeong, O. Simeone, A. Haimovich, and J. Kang, “Beamforming design for joint localization and data transmission in distributed antenna system,” IEEE Transactions on Vehicular Technology, vol. 64, no. 1, pp. 62–76, January 2015.
  • [3] A. Shahmansoori, G. E. Garcia, G. Destino, G. Seco-Granados, and H. Wymeersch, “Position and orientation estimation through millimeter-wave MIMO in 5G systems,” IEEE Transactions on Wireless Communications, vol. 17, no. 3, pp. 1822–1835, March 2018.
  • [4] Y. Wang, Y. Wu, and Y. Shen, “Joint spatiotemporal multipath mitigation in large-scale array localization,” IEEE Transactions on Signal Processing, vol. 67, no. 3, pp. 783–797, February 2019.
  • [5] B. Zhou, A. Liu, and V. Lau, “Successive localization and beamforming in 5G mmWave MIMO communication systems,” IEEE Transactions on Signal Processing, vol. 67, no. 6, pp. 1620–1635, March 2019.
  • [6] Y. Liu, E. Liu, and R. Wang, “Energy efficiency analysis of intelligent reflecting surface system with hardware impairments,” in 2020 IEEE Global Communications Conference: Wireless Communications (Globecom2020 WC), Taipei, Taiwan, December 2020.
  • [7] 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.
  • [8] Q. Nadeem, A. Kammoun, M. Debbah, and M. Alouini, “3D massive MIMO systems: Modeling and performance analysis,” IEEE Transactions on Wireless Communications, vol. 14, no. 12, pp. 6926–6939, December 2015.
  • [9] S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory.   Englewood Cliffs, NJ: PTR Prentice-Hall, 1993.
  • [10] L. L. Scharf, Statistical Signal Process: Detection, Estimation, and Time Series Analysis.   Reading, MA: Addison-Wesley, 1991.
  • [11] S. L. Collier, “Fisher information for a complex Gaussian random variable: Beamforming applications for wave propagation in a random medium,” IEEE Transactions on Signal Processing, vol. 53, no. 11, pp. 4236–4248, November 2005.
  • [12] X. Zhang, Matrix analysis and applications.   Cambridge University Press, 2017.
  • [13] J. He, H. Wymeersch, T. Sanguanpuak, O. Silven, and M. Juntti, “Adaptive beamforming design for mmwave RIS-aided joint localization and communication,” in 2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), 2020, pp. 1–6.