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

​​​

Fast Beam Training for IRS-Assisted
Multiuser Communications

Changsheng You, Member, IEEE, Beixiong Zheng, Member, IEEE, and Rui Zhang, Fellow, IEEE The authors are with the Department of Electrical and Computer Engineering, National University of Singapore 117583, Singapore (Email: {eleyouc, elezbe, elezhang}@nus.edu.sg).
Abstract

In this letter, we consider an intelligent reflecting surface (IRS)-assisted multiuser communication system, where an IRS is deployed to provide virtual line-of-sight (LoS) links between an access point (AP) and multiple users. We consider the practical codebook-based IRS passive beamforming and study efficient design for IRS reflect beam training, which is challenging due to the large number of IRS reflecting elements. In contrast to the conventional single-beam training, we propose a new multi-beam training method by dividing the IRS reflecting elements into multiple sub-arrays and designing their simultaneous multi-beam steering over time. By simply comparing the received signal power over time, each user can detect its optimal IRS beam direction with a high probability, even without searching over all possible beam directions as the single-beam training. Simulation results show that our proposed multi-beam training significantly reduces the training time of conventional single-beam training and yet achieves comparable IRS passive beamforming performance for data transmission.

Index Terms:
Intelligent reflecting surface (IRS), multi-beam training, passive beamforming.

I Introduction

Intelligent reflecting surface (IRS) has emerged as a promising cost-effective technology for enhancing the spectral and energy efficiency of future wireless networks [1]. In particular, by smartly controlling signal reflection via a massive number of low-cost passive reflecting elements, IRS is able to dynamically program the radio propagation environment for achieving signal enhancement and/or interference suppression. Compared to traditional active relay, IRS incurs much lower hardware cost and energy consumption due to its passive reflection. These appealing advantages have spurred intensive enthusiasm recently in deploying IRS to enhance the communication performance of various wireless systems [2, 3, 4, 5, 6].

Particularly, for millimeter-wave (mmWave) communications at high operation frequencies where the direct channels between an access point (AP) and its served users are susceptible to severe blockage and propagation loss, IRS can be properly deployed to provide virtual line-of-sight (LoS) AP-IRS-user links, and hence significantly enhance their communication performance [6]. To reap the large passive beamforming gain of IRS, it is indispensable for the IRS to conduct passive/reflect beam training in coordination with the AP’s transmit beam training for establishing high signal-to-noise ratio (SNR) links with IRS-assisted users before implementing efficient channel estimation and data transmission. This, however, is practically challenging due to the massive number of IRS reflecting elements that generate pencil-like sharp beams and thus require a large number of beam directions in the training codebook to cover the space of interest. The conventional single-beam training needs to search over all possible beam directions and inevitably incurs prohibitively high training overhead.

Refer to caption
Figure 1: IRS-assisted multiuser communication system.

This thus motivates this letter to study a more efficient beam training design for an IRS-assisted multiuser communication system as shown in Fig. 1, where an IRS is deployed to establish LoS links with both a multi-antenna AP and a group of single-antenna users that are assumed to be located near the helping IRS (e.g., in a hot spot scenario). As the AP and IRS are at fixed locations, we assume for simplicity that the AP’s transmit beamforming is fixed and thereby focus on designing the reflect beam training for IRS. To reduce the training time of conventional single-beam training, we propose a new multi-beam training method. Specifically, we divide the IRS reflecting elements into multiple sub-arrays and design their multi-beam codebook to steer different beam directions simultaneously over time. Then, each user can detect its optimal IRS beam direction with a high probability via simple received signal power/SNR comparisons over time, without the need of searching over all possible beam directions as the single-beam training. Simulation results show significant training time reduction by our proposed multi-beam training as compared to conventional single-beam training, yet without compromising much the IRS passive beamforming performance for data transmission. It is worth noting that multi-beam training design has also been proposed in [7]; however, it relies on random hashing (RH), which incurs a random number of training symbols for achieving unique beam identification. In contrast, our proposed multi-beam training applies with any given number of training symbols and is numerically shown to outperform that in [7] in terms of passive beamforming gain given the same training time.

II System Model

As shown in Fig. 1, we consider the downlink beam training in an IRS-assisted multiuser communication system, where an IRS is deployed to assist the communications between an AP equipped with an NAN_{\rm A}-antenna uniform linear array (ULA) and KK single-antenna users, denoted by the set 𝒦={1,2,,K}\mathcal{K}=\{1,2,\cdots,\!K\}. The IRS is composed of NI=Nx×NzN_{\rm I}\!=\!N_{\rm x}\!\times\!N_{\rm z} reflecting elements placed in the xx-zz plane, and is attached with a smart controller for tuning signal reflection at each reflecting element as well as exchanging information with the AP via a separate reliable link. The users are distributed in the same horizontal xx-yy plane with the IRS located in the center.

We consider the propagation environment with limited scattering (which is typical for mmWave channels) and adopt the commonly-used geometric channel model [8]. Assume that the direct AP-user links are blocked due to obstacles (e.g., buildings), whereas by properly deploying the IRS, there exists a deterministic LoS path in both the AP-IRS and IRS-user links. Let 𝐮(ϕ,N){\bf u}(\phi,N) denote the steering vector function, defined as

𝐮(ϕ,N)\displaystyle{\bf u}(\phi,N) [1,eȷπ1ϕ,,eȷπ(N1)ϕ]T,\displaystyle\triangleq\left[1,e^{-\jmath\pi 1\phi},\cdots,e^{-\jmath\pi(N-1)\phi}\right]^{T},\vspace{-10pt} (1)

where NN is the ULA array size, ϕ\phi denotes the constant phase difference between the observations at two adjacent antennas/elements, and ȷ\jmath denotes the imaginary unit. Since the AP and IRS are at fixed locations once deployed, the AP-IRS link typically has a much longer channel coherence time than the IRS-user link (due to user mobility) and thus can be considered as quasi-static. As such, we assume for simplicity that the AP has aligned its transmit beamforming with the AP-IRS LoS channel and thus can be treated as having an equivalent single antenna. Then, the effective channel from the AP to IRS, denoted by 𝐡NI×1{\bf h}\in{\mathbb{C}}^{N_{\rm I}\times 1}, can be modeled as 𝐡=h𝐚r(θIr,ϑIr){\bf h}=h{\bf a}_{\rm r}(\theta_{\rm I}^{\rm r},\vartheta_{\rm I}^{\rm r}). where hh denotes the complex-valued path gain of the AP-IRS link; θIr[0,π]\theta_{\rm I}^{\rm r}\in[0,\pi] and ϑIr[0,π]\vartheta_{\rm I}^{\rm r}\in[0,\pi] denote respectively the (physical) azimuth and elevation angles-of-arrival (AoAs) at the IRS. Moreover, 𝐚rNI×1{\bf a}_{\rm r}\in\mathbb{C}^{N_{\rm I}\times 1} represents the receive array response vector of IRS, which can be expressed as 𝐚r(θIr,ϑIr)=𝐮(ϕIr,Nx)𝐮(ψIr,Nz){\bf a}_{\rm r}(\theta_{\rm I}^{\rm r},\vartheta_{\rm I}^{\rm r})={\bf u}(\phi_{\rm I}^{\rm r},N_{\rm x})\otimes{\bf u}(\psi_{\rm I}^{\rm r},N_{\rm z}), where \otimes stands for the Kronecker product, ϕIr2dIλcos(θIr)sin(ϑIr)[2dIλ,2dIλ]\phi_{\rm I}^{\rm r}\triangleq\frac{2d_{\rm I}}{\lambda}\cos(\theta_{\rm I}^{\rm r})\sin(\vartheta_{\rm I}^{\rm r})\in[-\frac{2d_{\rm I}}{\lambda},\frac{2d_{\rm I}}{\lambda}] and ψIr2dIλcos(ϑIr)[2dIλ,2dIλ]\psi_{\rm I}^{\rm r}\triangleq\frac{2d_{\rm I}}{\lambda}\cos(\vartheta_{\rm I}^{\rm r})\in[-\frac{2d_{\rm I}}{\lambda},\frac{2d_{\rm I}}{\lambda}] are referred to as the horizontal and vertical spatial directions, respectively, with λ\lambda and dId_{\rm I} respectively denoting the signal wavelength and IRS’s reflecting element spacing. Note that there exists a one-to-one mapping between {ϕIr,ψIr}\{\phi_{\rm I}^{\rm r},\psi_{\rm I}^{\rm r}\} and {θIr,ϑIr}\{\theta_{\rm I}^{\rm r},\vartheta_{\rm I}^{\rm r}\}. Moreover, due to the same altitude of the IRS center and users, the elevation angles-of-departure (AoD) from the IRS to different users are all π/2\pi/2 and denoted by ϑI,ktϑIt=π/2,k𝒦\vartheta_{{\rm I},k}^{\rm t}\!\triangleq\vartheta_{{\rm I}}^{\rm t}\!=\!\pi/2,\!\forall k\in\mathcal{K}. Then, the IRS-user kk LoS path can be modeled as 𝐠kH=gk𝐛tH(θI,kt,ϑIt),k𝒦{\bf g}^{H}_{k}=g_{k}{\bf b}_{\rm t}^{H}(\theta_{{\rm I},k}^{\rm t},\vartheta_{{\rm I}}^{\rm t}),\forall k\in\mathcal{K}, where gkg_{k} denotes the complex-valued path gain of the IRS-user kk link; θI,kt[0,π]\theta_{{\rm I},k}^{\rm t}\in[0,\pi] denotes the azimuth AoD from the IRS to user kk; and 𝐛t(θI,kt,ϑIt)=𝐮(ϕI,kt,Nx)𝐮(ψIt,Nz){\bf b}_{\rm t}(\theta_{{\rm I},k}^{\rm t},\vartheta_{{\rm I}}^{\rm t})={\bf u}(\phi_{{\rm I},k}^{\rm t},N_{\rm x})\otimes{\bf u}(\psi_{{\rm I}}^{\rm t},N_{\rm z}) represents the transmit array response vector of IRS with ϕI,kt=2dIλcos(θI,kt)sin(ϑI,kt)\phi_{{\rm I},k}^{\rm t}=\frac{2d_{\rm I}}{\lambda}\cos(\theta_{{\rm I},k}^{\rm t})\sin(\vartheta_{{\rm I},k}^{\rm t}) and ψIt=2dIλcos(ϑIt)\psi_{{\rm I}}^{\rm t}=\frac{2d_{\rm I}}{\lambda}\cos(\vartheta_{{\rm I}}^{\rm t}).

Let 𝛀diag(eȷω1,eȷω2,,eȷωNI)NI×NI\bm{\Omega}\triangleq\mathrm{diag}(e^{\jmath\omega_{1}},e^{\jmath\omega_{2}},\cdots,e^{\jmath\omega_{N_{\rm I}}})\in\mathbb{C}^{N_{\rm I}\times N_{\rm I}} denote the diagonal IRS reflecting matrix, where for simplicity we assume that the reflection amplitude of each element is set to one (or its maximum value),111This assumption is valid for the ideal case of independent reflection amplitude-and-phase control; while for the practical case of phase-dependent amplitude control [9], we need to assume that the effective resistance of each reflecting element is sufficiently low so that its reflection amplitude variation over phase is negligible. and ωn\omega_{n}, n{1,2,,NI}n\in\{1,2,\cdots,N_{\rm I}\} denotes the reflection phase shift of element nn.222The proposed IRS beam-training method can be extended to the case with practical IRS discrete phase shifts by e.g., using the nearest-phase quantization for discretizing the continuous phase shifts as in [3]. Based on [3], the received signal at each user kk is given by

yk\displaystyle\vspace{-7pt}\!\!y_{k} =𝐠kH𝛀𝐡x+nk\displaystyle={\bf g}_{k}^{H}\bm{\Omega}{\bf h}x+{n}_{k}
=hgk𝐛tH(θI,kt,ϑIt)𝛀𝐚r(θIr,ϑIr)x+nk\displaystyle=hg_{k}{\bf b}_{\rm t}^{H}(\theta_{{\rm I},k}^{\rm t},\vartheta_{{\rm I}}^{\rm t})\bm{\Omega}{\bf a}_{\rm r}(\theta_{\rm I}^{\rm r},\vartheta_{\rm I}^{\rm r})x+{n}_{k}
=ηk𝐜kH𝐯x+nk,k𝒦,\displaystyle=\eta_{k}{\bf c}^{H}_{k}{\bf v}x+n_{k},\qquad\qquad\forall k\in\mathcal{K},\vspace{-6pt} (2)

where xx\in\mathbb{C} denotes the symbol transmitted by the AP with power PAP_{\rm A}, nk{n}_{k} is the received additive white Gaussian noise (AWGN) at user kk with power σ2\sigma^{2}, ηkhgk\eta_{k}\triangleq hg_{k}, 𝐯[ejω1,ejω2,,ejωNI]T{\bf v}\triangleq[e^{j\omega_{1}},e^{j\omega_{2}},\cdots,e^{j\omega_{N_{\rm I}}}]^{T}, and

𝐜kH\displaystyle{\bf c}^{H}_{k} 𝐛tH(θI,kt,ϑIt)𝐚rT(θIr,ϑIr)\displaystyle\triangleq{\bf b}_{\rm t}^{H}(\theta_{{\rm I},k}^{\rm t},\vartheta_{{\rm I}}^{\rm t})\odot{\bf a}^{T}_{\rm r}(\theta_{\rm I}^{\rm r},\vartheta_{\rm I}^{\rm r})
=(𝐮H(ϕI,kt,Nx)𝐮H(ψIt,Nz))(𝐮T(ϕIr,Nx)𝐮T(ψIr,Nz))\displaystyle=\!({\bf u}^{H}\!(\phi_{{\rm I},k}^{\rm t},N_{\rm x})\!\otimes\!{\bf u}^{H}\!(\psi_{{\rm I}}^{\rm t},N_{\rm z}))\!\odot\!({\bf u}^{T}\!(\phi_{\rm I}^{\rm r},N_{\rm x})\!\otimes\!{\bf u}^{T}\!(\psi_{\rm I}^{\rm r},N_{\rm z}))
=(𝐮H(ϕI,kt,Nx)𝐮T(ϕIr,Nx))(𝐮H(ψIt,Nz)𝐮T(ψIr,Nz))\displaystyle=\!({\bf u}^{H}\!(\phi_{{\rm I},k}^{\rm t},N_{\rm x})\!\odot\!{\bf u}^{T}\!(\phi_{\rm I}^{\rm r},N_{\rm x}))\!\otimes\!({\bf u}^{H}\!(\psi_{{\rm I}}^{\rm t},N_{\rm z})\!\odot\!{\bf u}^{T}\!(\psi_{\rm I}^{\rm r},N_{\rm z}))
𝐮H(φ~I,k,Nx)𝐮H(χ~I,Nz),\displaystyle\triangleq{\bf u}^{H}(\tilde{\varphi}_{{\rm I},k},N_{\rm x})\otimes{\bf u}^{H}(\tilde{\chi}_{{\rm I}},N_{\rm z}), (3)

where \odot stands for the Hadamard product; φ~I,kϕI,ktϕIr[4dIλ,4dIλ],k𝒦\tilde{\varphi}_{{\rm I},k}\triangleq\phi_{{\rm I},k}^{\rm t}-\phi_{\rm I}^{\rm r}\in[-\frac{4d_{\rm I}}{\lambda},\frac{4d_{\rm I}}{\lambda}],\forall k\in\mathcal{K}; and χ~IψItψIr[4dIλ,4dIλ]\tilde{\chi}_{{\rm I}}\triangleq\psi_{{\rm I}}^{\rm t}-\psi_{\rm I}^{\rm r}\in[-\frac{4d_{\rm I}}{\lambda},\frac{4d_{\rm I}}{\lambda}]. Then, by leveraging the property that 𝐮(ϕ,N){\bf u}(\phi,N) is a periodic function with period 22, we define φI,kφ~I,k(mod 2)[1,1],k𝒦\varphi_{{\rm I},k}\triangleq\tilde{\varphi}_{{\rm I},k}(\texttt{mod}\leavevmode\nobreak\ 2)\in[-1,1],\forall k\in\mathcal{K} as the effective cascaded IRS azimuth spatial direction for each user kk, and χIχ~I(mod 2)[1,1]\chi_{{\rm I}}\triangleq\tilde{\chi}_{{\rm I}}(\texttt{mod}\leavevmode\nobreak\ 2)\in[-1,1] as the common IRS elevation spatial direction for all the users, such that 𝐮(φI,k,Nx)=𝐮(φ~I,k,Nx),k𝒦{\bf u}(\varphi_{{\rm I},k},N_{\rm x})={\bf u}(\tilde{\varphi}_{{\rm I},k},N_{\rm x}),\forall k\in\mathcal{K}, and 𝐮(χI,Nz)=𝐮(χ~I,Nz){\bf u}(\chi_{{\rm I}},N_{\rm z})={\bf u}(\tilde{\chi}_{{\rm I}},N_{\rm z}), where a1(moda2)a_{1}(\texttt{mod}\leavevmode\nobreak\ a_{2}) denotes the modulo operation that returns the remainder after the division of a1a_{1}​ by a2a_{2}.

For the IRS reflect beam training, it can be easily observed from (2) that for each user kk, the optimal IRS beamforming vector is 𝐯=𝐜k=𝐮(φI,k,Nx)𝐮(χI,Nz){\bf v}={\bf c}_{k}={\bf u}({\varphi}_{{\rm I},k},N_{\rm x})\otimes{\bf u}({\chi}_{{\rm I}},N_{\rm z}), i.e., both the azimuth and elevation directions are perfectly aligned. To reduce the computational complexity for the joint three-dimensional (3D) IRS beam training, we first write 𝐯{\bf v} as a Hadamard product of two vectors, i.e., 𝐯=𝐯x𝐯z{\bf v}={\bf v}_{\rm x}\otimes{\bf v}_{\rm z}, where 𝐯x=[eȷω1,eȷω2,,eȷωNx]TNx×1{\bf v}_{\rm x}=[e^{\jmath\omega_{1}},e^{\jmath\omega_{2}},\cdots,e^{\jmath\omega_{N_{\rm x}}}]^{T}\in\mathbb{C}^{N_{\rm x}\times 1} and 𝐯z=[eȷω1,eȷω2,,eȷωNz]TNz×1{\bf v}_{\rm z}=[e^{\jmath\omega_{1}},e^{\jmath\omega_{2}},\cdots,e^{\jmath\omega_{N_{\rm z}}}]^{T}\in\mathbb{C}^{N_{\rm z}\times 1} are referred to as the horizontal and vertical IRS beam training vectors, respectively. As such, 𝐜kH𝐯{\bf c}^{H}_{k}{\bf v} in (2) can be rewritten as

𝐜kH𝐯\displaystyle{\bf c}^{H}_{k}{\bf v} =(𝐮H(φ~I,k,Nx)𝐮H(χ~I,Nz))(𝐯x𝐯z)\displaystyle=\left({\bf u}^{H}(\tilde{\varphi}_{{\rm I},k},N_{\rm x})\otimes{\bf u}^{H}(\tilde{\chi}_{{\rm I}},N_{\rm z})\right)({\bf v}_{\rm x}\otimes{\bf v}_{\rm z})
=(𝐮H(φI,k,Nx)𝐯x)(𝐮H(χI,Nz)𝐯z),\displaystyle=\left({\bf u}^{H}(\varphi_{{\rm I},k},N_{\rm x}){\bf v}_{\rm x}\right)\otimes\left({\bf u}^{H}(\chi_{{\rm I}},N_{\rm z}){\bf v}_{\rm z}\right), (4)

where the horizontal and vertical beam training vectors are decoupled. For simplicity, we assume that the IRS vertical beamforming has been aligned as it does not depend on users’ locations and thus focus on designing the IRS horizontal beam training for all the users. Specifically, given the fixed 𝐯z{\bf v}_{\rm z} and using (4), the received signal at each user kk in (2) can be simplified as

yk(𝐯x)\displaystyle y_{k}({\bf v}_{\rm x}) =(𝐮H(φI,k,Nx)𝐯x)ζkx+nk,k𝒦,\displaystyle=\left({\bf u}^{H}(\varphi_{{\rm I},k},N_{\rm x}){\bf v}_{\rm x}\right)\zeta_{k}x+{n}_{k},\leavevmode\nobreak\ \leavevmode\nobreak\ \forall k\in\mathcal{K}, (5)

where ζk=𝐮H(χI,Nz)𝐯zηk\zeta_{k}={\bf u}^{H}(\chi_{{\rm I}},N_{\rm z}){\bf v}_{\rm z}\eta_{k}.

III Single-Beam Training

Similar to [10], given NxN_{\rm x} IRS horizontal reflecting elements, we divide the entire spatial domain [1,1][-1,1] into JNxJ\triangleq N_{\rm x} equal-size sectors for the horizontal beam training, represented by their central directions that are given by α(j)=1+2j1Nx,j𝒥{1,2,,J}\alpha(j)=-1+\frac{2j-1}{N_{\rm x}},j\in\mathcal{J}\triangleq\{1,2,\cdots,J\}. As such, the single-beam training codebook can be constructed as 𝐖~={𝐰~(1),𝐰~(2),,𝐰~(J)}{\bf{\widetilde{W}}}=\{{\bf\widetilde{w}}(1),{\bf\widetilde{w}}(2),\cdots,{\bf\widetilde{w}}(J)\}, where 𝐰~(j)Nx×1,j𝒥\widetilde{\bf w}(j)\in\mathbb{C}^{N_{\rm x}\times 1},j\in\mathcal{J} denotes the codeword that steers reflecting beam towards direction α(j)\alpha(j), which can be set as [10] 𝐰~(j)=𝐮(α(j),Nx){\widetilde{\bf w}}(j)={\bf u}(\alpha(j),N_{\rm x}). Let 𝐀(𝐰~(j),φ)=|𝐮H(φ,Nx)𝐰~(j)|{\bf A}(\widetilde{\bf w}(j),\varphi)=|{\bf u}^{H}(\varphi,N_{\rm x})\widetilde{\bf w}(j)| denote the beam gain of 𝐰~(j)\widetilde{\bf w}(j) along the spatial direction φ[1,1]\varphi\in[-1,1]. It is well known that the beam pattern of 𝐰~(j)\widetilde{\bf w}(j) (i.e., {𝐀(𝐰~(j),φ)|φ[1,1]})\{{\bf A}(\widetilde{\bf w}(j),\varphi)|\leavevmode\nobreak\ \varphi\in[-1,1]\}) has a main-lobe with beam width 2/Nx2/N_{\rm x} centered at the direction φ=α(j)\varphi=\alpha(j), where it achieves the maximum beam gain of 𝐀(𝐰~(j),α(j))=Nx{\bf A}(\widetilde{\bf w}(j),\alpha(j))=N_{\rm x} [10]. Moreover, as NxN_{\rm x} increases, the main-lobe becomes narrower and the side-lobe diminishes.

Given the sampled directions, we denote by IkI_{k} the optimal IRS beam direction for each user kk, which is given by Ik=argminj𝒥|φI,kα(j)|,k𝒦I_{k}=\arg\min_{j\in\mathcal{J}}\left|\varphi_{{\rm I},k}-\alpha(j)\right|,\forall k\in\mathcal{K}. With the codebook 𝐖~\widetilde{\bf{W}}, a straightforward IRS beam-training method is as follows: The AP consecutively sends multiple training symbols while the IRS changes its reflecting direction in {𝐰~(j),j𝒥}\{{\widetilde{\bf w}}(j),j\in\mathcal{J}\} sequentially over different training symbols; then each user finds its best beam direction that achieves the maximum received signal power/SNR, which is given by I^k(ex)=argmaxj𝒥|yk(𝐰~(j))|2,k𝒦\widehat{I}^{(\rm ex)}_{k}=\arg\max_{j\in\mathcal{J}}|y_{k}(\widetilde{\bf w}(j))|^{2},\forall k\in\mathcal{K}. However, such an exhaustive-search based single-beam training requires at least Tt(ex)=NxT^{(\rm ex)}_{\rm t}=N_{\rm x} training symbols, which can be practically prohibitive due to the massive number of IRS reflecting elements, thus incurring large training overhead/delay for establishing high-SNR links. As such, this training method is not suitable for delay-sensitive and/or short-packet transmissions.

IV Multi-Beam Training

To reduce the training time of conventional single-beam training, we propose a new multi-beam training method for IRS-assisted multiuser communications in this section.

First, we divide the (horizontal) IRS reflecting elements into MM sub-arrays, each consisting of LNx/ML\triangleq N_{\rm x}/M (assumed to be an integer) adjacent reflecting elements. For each sub-array m{1,2,,M}m\in\mathcal{M}\triangleq\{1,2,\cdots,M\}, we equip it with an individual codebook, 𝐖m{\bf W}_{m}, which comprises J=NxJ=N_{\rm x} codewords that cover the same sampled directions as the single-beam codebook, i.e., {α(j),j𝒥}\{\alpha(j),j\in\mathcal{J}\}. As such, we have 𝐖m={𝐰m(1),𝐰m(2),,𝐰m(J)},m,{\bf W}_{m}=\{{\bf w}_{m}(1),{\bf w}_{m}(2),\cdots,{\bf w}_{m}(J)\},\forall m\in\mathcal{M}, where 𝐰m(j)L×1{\bf w}_{m}(j)\in\mathbb{C}^{L\times 1}, j𝒥j\in\mathcal{J} represents the codeword of sub-array mm that steers reflecting beam in direction α(j)\alpha(j) using LL reflecting elements only. Based on the single-beam codeword 𝐰~(j){\bf\widetilde{w}}(j), we construct 𝐰m(j){\bf w}_{m}(j) as

𝐰m(j)[𝐰~(j)](m1)L+1:mL=eȷ(m1)Lα(j)𝐮(α(j),L),\displaystyle{\bf w}_{m}(j)\triangleq[{\widetilde{\bf w}(j)}]_{(m-1)L+1:mL}=e^{\jmath(m-1)L\alpha(j)}{\bf u}(\alpha(j),L),\vspace{-3pt}

such that when all the MM sub-arrays steer reflecting beams in the same direction α(j)\alpha(j), the composite multi-beam codeword [𝐰1T(j),𝐰2T(j),,𝐰MT(j)]T[{\bf w}^{T}_{1}(j),{\bf w}^{T}_{2}(j),\cdots,{\bf w}^{T}_{M}(j)]^{T} is equivalent to the single-beam counterpart 𝐰~(j)\widetilde{\bf w}(j). Compared to the full-array codeword 𝐰~(j)\widetilde{\bf w}(j), each sub-array codeword 𝐰~m(j){\bf\widetilde{w}}_{m}(j) has a wider beam width (i.e., 2M/Nx2M/N_{\rm x} versus 2/Nx2/N_{\rm x}) as well as a smaller beam gain (i.e., Nx/MN_{\rm x}/M versus NxN_{\rm x}), as illustrated in Figs. 2(a) and 2(b), respectively.

Refer to caption
Figure 2: Illustration of the proposed IRS multi-beam training with Nx=32N_{\rm x}=32, M=4M=4, L=8L=8, and dI=λ/2d_{\rm I}=\lambda/2.

Next, for the proposed multi-beam training, let the IRS steer sub-array beams towards multiple different directions simultaneously which generally change over training symbol durations according to the multi-beam codebook {𝐖m,m}\{{\bf W}_{m},m\in\mathcal{M}\}. By properly designing the beam directions of IRS sub-arrays over different training symbols, each user’s optimal beam direction can be found via simple received signal power/SNR comparisons over time with a high probability. For ease of exposition, we consider a typical case where M=2RM=2^{R} with RR\in\mathbb{Z}, LL is an even number, and Nx=MLN_{\rm x}=ML. Our proposed fast beam-training method consists of two phases, namely, IRS beam sweeping and IRS beam identification, which are elaborated as follows.

IV-1 IRS Beam Sweeping

This phase consists of 1+log2M1+\log_{2}M rounds of beam sweeping, where in each round, the AP sends multiple training symbols that are reflected by different sets of IRS sub-array reflecting beam directions. For each round r{1,2,,log2M+1}r\in\{1,2,\cdots,\log_{2}M+1\}, we denote by B(r,b)B(r,b) the bin that collects the sub-array beam directions (arranged in an ascending order) during the bb-th training symbol. For any beam-direction set 𝒜𝒥\mathcal{A}\subseteq\mathcal{J}, we define its intra-set distance as ds(𝒜)=minp,q𝒜;pq|pq|d_{\rm s}(\mathcal{A})=\min_{p,q\in\mathcal{A};p\neq q}|p-q|. As such, a larger intra-set distance indicates that the beams indexed by 𝒜\mathcal{A} are farther separated in the spatial domain (see Fig. 2(b)). For r=1r=1, we map the NxN_{\rm x} directions into LL bins, each comprising MM directions. To separate the beam directions in each bin as far as possible for minimizing the inter-beam interference, we set the bins as B(1,b)={b,b+L,,b+(M1)L},b{1,2,,L}B(1,b)=\{b,b+L,\cdots,b+(M-1)L\},\forall b\in\{1,2,\cdots,L\}. It can be shown that such a direction-bin mapping maximizes the minimum intra-bin distance among all the bins with ds(B(1,b))=L,b{1,2,,L}d_{\rm s}(B(1,b))=L,\forall b\in\{1,2,\cdots,L\}. As illustrated in Figs. 2(c) and 2(d), for the case with Nx=32N_{\rm x}\!=\!32 and M=4M\!=\!4, the individual beam patterns of sub-array beams in B(1,1)={1,9,17,25}B(1,1)=\{1,9,17,25\} (corresponding to the codeword 𝐯x=[𝐰1T(1),𝐰2T(9),𝐰3T(17),𝐰4T(25)]T{\bf v}_{\rm x}=[{\bf w}^{T}_{1}(1),{\bf w}^{T}_{2}(9),{\bf w}^{T}_{3}(17),{\bf w}^{T}_{4}(25)]^{T}) are well separated in the spatial domain (see Fig. 2(c)), such that the effective beam pattern even after accounting for the inter-beam interference still features strong beam directionality to the 44 directions (see Fig. 2(d)).

In the subsequent (log2M)(\log_{2}M)-rounds of beam sweeping, we exploit different combinations of IRS beam directions to help each user identify its best beam direction in the next beam identification phase. Specifically, in round 22, for each initial bin B(1,b)B(1,b) with b{1,2,,L}b\in\{1,2,\cdots,L\}, we partition its MM directions into 22 equal-size sub-sets as [B(1,b)]1:M/2[B(1,b)]_{1:M/2} and [B(1,b)](M/2)+1:M[B(1,b)]_{(M/2)+1:M}, each consisting of adjacent M/2M/2 directions. To determine which sub-set contains the best beam direction, instead of individually beam-searching the 22 sub-sets and comparing their beam power, we propose to test only one of them (with half number of sub-arrays) for reducing the training time, by exploiting the fact that the searched sub-set is likely to contain the best beam direction if it yields a large received power above a certain threshold (as specified later in the next subsection), and vice versa. Moreover, to further reduce the training time, we make full use of the MM sub-arrays to allow simultaneous search of two sub-sets from two different initial bins, which, however, introduces the interference between different beam sub-sets. To address this issue, we first pair the initial bins into L/2L/2 groups as G()={B(1,),B(1,+L/2)},[1,2,,L/2]G(\ell)=\{B(1,\ell),B(1,\ell+L/2)\},\forall\ell\in[1,2,\cdots,L/2], such that the beam directions in the two bins for all groups are separated as far as possible with the identical (maximum) intra-group distance given by ds(G())=L/2,[1,2,,L/2]d_{\rm s}(G(\ell))=L/2,\forall\ell\in[1,2,\cdots,L/2]. Then, for each group \ell, we extract the odd sub-set of B(1,)B(1,\ell) and the even sub-set of B(1,+L/2)B(1,\ell+L/2) to construct a new bin (as illustrated in Fig. 2(e)). As such, L/2L/2 bins are constructed for r=2r=2, which are set as B(2,b)={[B(1,b)]1:M/2,[B(1,b+L/2)](M/2)+1:M},b[1,2,,L/2].B(2,b)=\{[B(1,b)]_{1:M/2},[B(1,b+L/2)]_{(M/2)+1:M}\},\forall b\in[1,2,\cdots,L/2]. It can be verified that by using the above bin grouping-and-extracting, the second-round of beam sweeping achieves the same max-min intra-bin distance as the first round (i.e., both are LL). Similarly, for round 33, as illustrated in Fig. 2(e), we further partition each of the sub-sets in round 22 into 22 equal-size smaller sub-sets and select one of them for beam searching; the new bins are constructed by following a similar procedure in round 22. To summarize, for r[2,3,,log2M+1]r\in[2,3,\cdots,\log_{2}M+1], each round of beam sweeping consists of L/2L/2 bins, which are set as

B(r,b)={[B(1,b)]1:u(r),[B(1,b+L/2)]u(r)+1:2u(r),\displaystyle B(r,b)=\{[B(1,b)]_{1:u(r)},[B(1,b+L/2)]_{u(r)+1:2u(r)},
[B(1,b)]2u(r)+1:3u(r),[B(1,b+L/2)]3u(r)+1:4u(r),\displaystyle\qquad\qquad\leavevmode\nobreak\ [B(1,b)]_{2u(r)\!+\!1:3u(r)},[B(1,b+L/2)]_{3u(r)\!+\!1:4u(r)},
,[B(1,b)]M2u(r)+1:Mu(r),\displaystyle\qquad\qquad\leavevmode\nobreak\ \leavevmode\nobreak\ \leavevmode\nobreak\ \cdots,[B(1,b)]_{M\!-\!2u(r)\!+\!1:M-u(r)},
[B(1,b+L/2)]Mu(r)+1:M},b[1,2,,L/2],\displaystyle\qquad\qquad[B(1,b+L/2)]_{M\!-\!u(r)+1:M}\},\forall b\in[1,2,\cdots,L/2],\vspace{-3pt}

where u(r)=M/(2r1)u(r)=M/(2^{r-1}). Moreover, for each round of beam sweeping, the identical (maximum) intra-bin distance for different bins can be numerically deduced as

ds(B(r,b))={L,if r{1,2},L/2,if r{3,4,,log2M+1}.\displaystyle d_{\rm s}(B(r,b))=\begin{cases}&\!\!\!\!\!L,\leavevmode\nobreak\ \leavevmode\nobreak\ \leavevmode\nobreak\ \leavevmode\nobreak\ \mbox{if $r\in\{1,2\}$},\\ &\!\!\!\!\!L/2,\leavevmode\nobreak\ \mbox{if $r\in\{3,4,\cdots,\log_{2}M+1\}$}.\end{cases}\vspace{-5pt}

For illustration, we provide in Fig. 2(f) an example of all the designed bins in the beam-sweeping phase for the case with Nx=32N_{\rm x}=32 and M=4M=4.

Based on the above beam-sweeping design, the total number of training symbols of our proposed multi-beam training method is given by

Tt(fa)=L+L(log2M)2=NxM(1+log2M2),T^{(\rm fa)}_{\rm t}=L+\frac{L(\log_{2}M)}{2}=\frac{N_{\rm x}}{M}\left(1+\frac{\log_{2}M}{2}\right),\vspace{-5pt} (6)

which monotonically decreases with an increasing MM (i.e., IRS reflecting elements are divided into more sub-arrays), and is smaller than that of the single-beam training with Tt(ex)=NxT^{\rm(ex)}_{\rm t}=N_{\rm x} for M>1M>1.

IV-2 IRS Beam Identification

After the beam-sweeping phase, each user can identify its best IRS reflecting beam direction independently based on their own received powers/SNRs in the first phase. Consider an arbitrary user kk. Let Pk(r,b)P_{k}(r,b) denote its received power from the bb-th bin of the rr-th round of beam sweeping and I^k(r)\widehat{I}_{k}(r) represent the set of candidate directions for its best beam direction after the rr-th round of beam sweeping. For r=1r=1, I^k(r)\widehat{I}_{k}(r) is set as the best bin that has the largest received power, i.e., I^k(1)=B(1,bk)\widehat{I}_{k}(1)=B(1,b^{*}_{k}) with bk=argmaxb{1,2,,L}Pk(1,b)b_{k}^{*}=\arg\max_{b\in\{1,2,\cdots,L\}}P_{k}(1,b). While for each of the subsequent rounds r{2,3,,log2M+1}r\in\{2,3,\cdots,\log_{2}{M}+1\}, the user only needs to inspect one bin that has common directions with I^k(1)\widehat{I}_{k}(1) as only it may potentially contain the best beam direction, which is denoted by B(r,bk(r))B(r,b_{k}(r)) with bk(r)={b{1,2,,L/2}|B(r,b)I^k(1)}b_{k}(r)=\{b\in\{1,2,\cdots,L/2\}|B(r,b)\cap\widehat{I}_{k}(1)\neq\varnothing\}. For this bin, as the expected received power from the corresponding multiple beams that cover/do not cover the best direction is approximately (ignoring the receiver noise and any inter-beam interference) Pk(1,bk)P_{k}(1,b_{k}^{*}) and 0, respectively, we set the binary-decision threshold on the received power as Pk(th)(Pk(1,bk)+0)/2=Pk(1,bk)/2P^{(\rm th)}_{k}\triangleq(P_{k}(1,b_{k}^{*})+0)/2=P_{k}(1,b_{k}^{*})/2 for determining whether B(r,bk(r))B(r,b_{k}(r)) contains the best beam direction or not. As such, for each r{2,3,,log2M+1}r\in\{2,3,\cdots,\log_{2}{M}+1\}, combining the binary decision with I^k(r1)\widehat{I}_{k}(r-1), the new candidate directions for round rr are determined as follows.

I^k(r)={I^k(r1)B(r,bk(r)),if Pk(r,b)Pk(th),I^k(r1)B(r,bk(r)),if Pk(r,b)<Pk(th),k𝒦.\widehat{I}_{k}(r)\!\!=\!\!\begin{cases}&\!\!\!\!\widehat{I}_{k}(r-1)\!\cap\!B(r,b_{k}(r)),\leavevmode\nobreak\ \mbox{if $P_{k}(r,b)\!\geq\!P^{(\rm th)}_{k}$},\\ &\!\!\!\!\widehat{I}_{k}(r-1)\!\setminus\!B(r,b_{k}(r)),\leavevmode\nobreak\ \mbox{if $P_{k}(r,b)\!<\!P^{(\rm th)}_{k}$},\\ \end{cases}\forall k\in\mathcal{K}.\vspace{-8pt}

It can be verified that the size of I^k(r)\widehat{I}_{k}(r) is logarithmically decreasing as |I^k(r)|=M/(2r1),r{1,2,,log2M+1}|\widehat{I}_{k}(r)|=M/(2^{r-1}),\forall r\in\{1,2,\cdots,\log_{2}{M}+1\}. An illustrative example is provided as follows to demonstrate the detailed procedures for identifying a unique beam direction for an arbitrary user.

Example 1.

Consider the case with Nx=32N_{\rm x}=32 and M=4M=4; the designed bins are shown in Fig. 2(f). For r=1r=1, assuming that user kk receives the largest power from bin B(1,5)B(1,5), we set I^k(1)=B(1,5)={5,13,21,29}\widehat{I}_{k}(1)=B(1,5)=\{5,13,21,29\}. As such, for r=2r=2, the user only needs to examine bin B(2,1)B(2,1), since only it has common directions with bin B(1,5)B(1,5). Supposing Pk(2,1)<Pk(th)P_{k}(2,1)<P^{(\rm th)}_{k}, we decide that B(2,1)B(2,1) does not contain the best beam direction of user kk and thus obtain I^k(2)=I^k(1)B(2,1)={5,13}\widehat{I}_{k}(2)=\widehat{I}_{k}(1)\setminus B(2,1)=\{5,13\}. Last, for r=3r=3, user kk only needs to inspect bin B(3,1)B(3,1). Assuming Pk(3,1)>Pk(th)P_{k}(3,1)>P^{(\rm th)}_{k}, we finally identify the best beam direction for user kk as I^k(fa)=I^k(3)=I^k(2)B(3,1)={13}\widehat{I}_{k}^{(\rm fa)}=\widehat{I}_{k}(3)=\widehat{I}_{k}(2)\cap B(3,1)=\{13\}.

Note that for each user kk, the identified best beam direction, I^k(fa)\widehat{I}_{k}^{(\rm fa)}, may not be the actual optimal beam direction, IkI_{k}, or that obtained by the single-beam training, I^k(ex)\widehat{I}_{k}^{(\rm ex)}, due to the receiver noise, interference due to channel non-LoS (NLoS) components, and inter-beam interference in practice. Although increasing MM can help reduce the training time of the proposed multi-beam training method (see (6)), it will decrease the sub-array beam gains as well as cause more severe inter-beam interference, thus resulting in degraded beam identification accuracy, as will be shown in the next section by simulations. Hence, there exists a fundamental trade-off between training time and resultant passive beamforming performance in the proposed multi-beam training method by adjusting MM.

V Simulation Results

This section provides simulation results to numerically validate our proposed design. We consider a mmWave system operating at a carrier frequency of 3030 GHz. For simplicity, we consider an IRS array placed horizontally and centered at (0,0,0)(0,0,0) meter (m), which is composed of Nx=160N_{\rm x}=160 reflecting elements with dI=λ/4d_{\rm I}=\lambda/4. There are K=5K=5 users randomly distributed on a semi-circle around the IRS with distance of 22 m. The AP centered at (0,16,0)(0,16,0) m is equipped with NA=64N_{\rm A}=64 antennas with half-wavelength antenna spacing. For the large-scale path loss, the reference channel power gain at a distance of 11 m is set as ξ0=62\xi_{0}=-62 dB, and the path loss exponents of the AP-IRS and IRS-user links are set as γAI=2.3\gamma_{\rm AI}=2.3 and γIU=2\gamma_{\rm IU}=2, respectively. The small-scale fading is modeled by the Rician fading, with the AP-IRS and IRS-user Rician factors set as κAI=5\kappa_{\rm AI}=5 dB and κIU=10\kappa_{\rm IU}=10 dB, respectively. We define the average SNR of the IRS-assisted mmWave system as

SNR=PA(ξ0DAIγAI)(ξ0DIUγIU)Nx2NAσ2,{\rm SNR}=\frac{P_{\rm A}(\xi_{0}D_{\rm AI}^{-\gamma_{\rm AI}})(\xi_{0}D_{\rm IU}^{-\gamma_{\rm IU}})N^{2}_{\rm x}N_{\rm A}}{\sigma^{2}},\vspace{-5pt} (7)

where DAID_{\rm AI} and DIUD_{\rm IU} denote respectively the AP-IRS and IRS-user distances, and the noise power is set as σ2=109\sigma^{2}=-109 dBm. To characterize the beam identification accuracy, we define Psuc=k=1K𝕀(I^k=Ik)KP_{\rm suc}=\frac{\sum_{k=1}^{K}\mathbb{I}(\widehat{I}_{k}=I_{k})}{K} as its success rate, where 𝕀()\mathbb{I}(\cdot) stands for the indicator function. Moreover, to show the passive beamforming gain for data transmission in the identified single-beam direction, I^k\widehat{I}_{k}, we define the average achievable rate of all users as R¯=k=1KRkK\bar{R}=\frac{\sum_{k=1}^{K}R_{k}}{K}, where Rk=log2(1+PA|(𝐮H(φI,k,Nx)𝐯x,k)ζk|2Γσ2)R_{k}=\log_{2}\left(1+\frac{P_{\rm A}|\left({\bf u}^{H}(\varphi_{{\rm I},k},N_{\rm x}){\bf v}_{{\rm x},k}\right)\zeta_{k}|^{2}}{\Gamma\sigma^{2}}\right), 𝐯x,k=𝐮(α(I^k),Nx){\bf v}_{{\rm x},k}={\bf u}(\alpha(\widehat{I}_{k}),N_{\rm x}), and Γ=9\Gamma=9 dB denotes the SNR gap due to the practical modulation and coding. Note that we ignore the loss of achievable rate due to training overhead for ease of comparison. The simulation results are averaged over 15001500 Rician fading channel realizations.

Refer to caption
(a) Success beam identification rate versus SNR for different numbers of IRS sub-arrays.
Refer to caption
(b) Average achievable rate versus SNR for different numbers of IRS sub-arrays.
Figure 3: Performance comparison of the proposed multi-beam training with the conventional single-beam training and RH based multi-beam training

.

Figs. 3(a) and 3(b) show the effects of the number of IRS sub-arrays (MM) and SNR on the training overhead, success beam identification rate, and average achievable rate. The proposed multi-beam training is compared with the conventional single-beam training as well as the RH based multi-beam training proposed in [7] that conducts the max-min intra-bin distance direction-bin mapping followed by multiple rounds of RH for beam sweeping, and applies a voting mechanism for beam identification. For fair comparison, we enforce the same training time for the RH based multi-beam training as our proposed one by limiting its number of direction-bin mappings, so as to compare their beam identification accuracy and passive beamforming gain with the same training overhead. Several interesting observations are made as follows. First, with a small number of sub-arrays (i.e., M=2M=2), the proposed multi-beam training not only reduces 25%25\% of the training overhead of the single-beam training (i.e., 120120 versus 160160), but also achieves a very close success beam identification rate and average achievable rate. Second, by slightly increasing the number of sub-arrays to M=4M=4, the proposed multi-beam training achieves 50%50\% training time reduction with respect to the single-beam training (i.e., 8080 versus 160160), while it still attains a high success beam identification rate at high SNR (e.g., Psuc92%P_{\rm suc}\approx 92\% for SNR = 46.446.4 dB) as well as close rate performance to the single-beam training (see Fig. 3(b)). However, the proposed multi-beam training with M=8M=8 is observed to suffer a substantial loss in the beam identification accuracy even in the high-SNR regime (see Fig. 3(a)) and thus degraded passive beamforming gain (see Fig. 3(b)), due to more severe inter-beam interference. Moreover, it is observed that the proposed multi-beam training significantly outperforms the RH based benchmark for all values of M{2,4,8}M\in\{2,4,8\} in terms of both the beam identification accuracy and passive beamforming gain, owing to its more efficient beam sweeping and identification designs. In particular, the beam identification accuracy of the RH based multi-beam training with M=2M\!=\!2 is almost invariant with the increase of SNR, since its RH round in beam training only randomly covers half of the total beam directions, thus inevitably missing some directions and greatly limiting the voting-based beam identification performance.

VI Conclusions

In this letter, we proposed a fast IRS reflect beam-training method for an IRS-assisted multiuser communication system. It was shown that by dividing IRS elements into multiple sub-arrays and properly designing sub-array beam directions over different training symbols with users’ independent beam identification based on received power/SNR comparisons, our proposed multi-beam training can significantly reduce the training overhead of conventional single-beam training, yet achieving comparable passive beamforming performance for data transmission. Moreover, it is worth noting that the proposed multi-beam training method is general and can also be applied to IRS’s vertical beam training as well as AP’s transmit beam training to multiple users without IRS or with fixed IRS (horizontal) reflection.

References

  • [1] Q. Wu and R. Zhang, “Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,” IEEE Commun. Mag., vol. 58, no. 1, pp. 106–112, Jan. 2020.
  • [2] B. Zheng, C. You, and R. Zhang, “Intelligent reflecting surface assisted multi-user OFDMA: Channel estimation and training design,” Available: http://arxiv.org/abs/2003.00648.
  • [3] C. You, B. Zheng, and R. Zhang, “Channel estimation and passive beamforming for intelligent reflecting surface: Discrete phase shift and progressive refinement,” to appear in IEEE J. Sel. Areas Commun.
  • [4] M.-M. Zhao, Q. Wu, M.-J. Zhao, and R. Zhang, “Intelligent reflecting surface enhanced wireless network: Two-timescale beamforming optimization,” Available: http://arxiv.org/abs/1912.01818.
  • [5] B. Ning, Z. Chen, W. Chen, and Y. Du, “Channel estimation and transmission for intelligent reflecting surface assisted THz communications,” in Proc. IEEE Intl. Conf. Commun. (ICC), Dublin, Ireland, Jun. 2020.
  • [6] X. Tan, Z. Sun, D. Koutsonikolas, and J. M. Jornet, “Enabling indoor mobile millimeter-wave networks based on smart reflect-arrays,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Honolulu, HI, USA, Apr. 2018, pp. 270–278.
  • [7] H. Hassanieh, O. Abari, M. Rodriguez, M. Abdelghany, D. Katabi, and P. Indyk, “Fast millimeter wave beam alignment,” in Proc. ACM Conf. Spec. Interest Group Data Commun., Budapest, Hungary, Aug. 2018, pp. 432–445.
  • [8] O. El Ayach, S. Rajagopal, S. Abu-Surra, Z. Pi, and R. W. Heath, “Spatially sparse precoding in millimeter wave MIMO systems,” IEEE Trans. Wireless Commun., vol. 13, no. 3, pp. 1499–1513, Mar. 2014.
  • [9] S. Abeywickrama, R. Zhang, Q. Wu, and C. Yuen, “Intelligent reflecting surface: Practical phase shift model and beamforming optimization,” IEEE Trans. Commun., DoI: 10.1109/TCOMM.2020.3001125.
  • [10] Z. Xiao, T. He, P. Xia, and X.-G. Xia, “Hierarchical codebook design for beamforming training in millimeter-wave communication,” IEEE Trans. Wireless Commun., vol. 15, no. 5, pp. 3380–3392, May 2016.