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

RIS-aided Near-Field MIMO Communications: Codebook and Beam Training Design

Suyu Lv,  , Yuanwei Liu, ,
Xiaodong Xu, , Arumugam Nallanathan, ,
and A. Lee Swindlehurst
Suyu Lv is with the State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China (e-mail: [email protected]).Xiaodong Xu is with the State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China, and also with the Department of Broadband Communication, Peng Cheng Laboratory, Shenzhen 518066, Guangdong, China (e-mail: [email protected]).Yuanwei Liu and Arumugam Nallanathan are with the School of Electronic Engineering and Computer Science, Queen Mary University of London, London E1 4NS, U.K. (e-mail: [email protected]; [email protected]).A. Lee Swindlehurst is with the Center for Pervasive Communications and Computing, Henry Samueli School of Engineering, University of California at Irvine, Irvine, CA 92697 USA (e-mail: [email protected]).
Abstract

Downlink reconfigurable intelligent surface (RIS)-assisted multi-input-multi-output (MIMO) systems are considered with far-field, near-field, and hybrid-far-near-field channels. According to the angular or distance information contained in the received signals, 1) a distance-based codebook is designed for near-field MIMO channels, based on which a hierarchical beam training scheme is proposed to reduce the training overhead; 2) a combined angular-distance codebook is designed for mixed-far-near-field MIMO channels, based on which a two-stage beam training scheme is proposed to achieve alignment in the angular and distance domains separately. For maximizing the achievable rate while reducing the complexity, an alternating optimization algorithm is proposed to carry out the joint optimization iteratively. Specifically, the RIS coefficient matrix is optimized through the beam training process, the optimal combining matrix is obtained from the closed-form solution for the mean square error (MSE) minimization problem, and the active beamforming matrix is optimized by exploiting the relationship between the achievable rate and MSE. Numerical results reveal that: 1) the proposed beam training schemes achieve near-optimal performance with a significantly decreased training overhead; 2) compared to the angular-only far-field channel model, taking the additional distance information into consideration will effectively improve the achievable rate when carrying out beam design for near-field communications.

Index Terms:
Beam training, codebook, multi-input-multi-output (MIMO), near-field communications (NFC), reconfigurable intelligent surface (RIS).

I Introduction

Millimeter wave (mmWave) communications (30 - 300 GHz) and Terahertz (THz) communications (0.1 - 10 THz) have been recognized as promising candidate technologies for future B5G/6G networks to realize the communication goals of ultra-wide bandwidth and ultra-high transmission rate [1, 2, 3]. Although possessing extremely high bandwidth, mmWave and THz communication suffer from high propagation losses due to penetration, reflection and diffraction, resulting in a reduced link budget compared to that in the sub-6 GHz scenario [4].

To tackle the problems caused by high-frequency communications, reconfigurable intelligent surface (RIS) technology has received extensive research attention due to its distinctive capability of restructuring the wireless propagation environment and establishing additional reliable reflection-based links between the base station (BS) and the user [5, 6]. RISs consist of numerous passive controllable reflecting elements that can adjust the phase shift of incident signals with extremely low power consumption, and thus have been regarded as one of the main enabling solutions to achieve green communication and coverage extension for next-generation wireless systems [7].

The low-cost and low-complexity characteristics of RIS reflecting elements have also promoted the emergence of extremely large-scale RIS to realize higher array gain. However, with an increase in the number of RIS reflecting elements, the boundary separating the near-field communication (NFC) region and far-field communication (FFC) region becomes more distant from the RIS, making the near-field region non-negligible [8, 9, 10]. In contrast to the plane wave model in the far-field region, the electromagnetic structure in the near-field region is fundamentally different and the spherical wave model should be used [8]. The spherical-wave propagation model for NFC contains both angular and distance information, which allows the resulting beam patterns to focus on a specific point [9]. Thus, NFC can utilize the new dimension of distance to realize more precise signal enhancement, interference management and user localization for RIS-assisted wireless networks [11, 12, 13, 14].

However, reliable phase shift design for RIS-assisted communication systems relies heavily on accurate channel state information (CSI), which is challenging to obtain due to the passive property of RISs. In addition, the massive number of RIS elements in a multi-input-multi-output (MIMO) system will also lead to extremely large pilot overhead and high channel estimation complexity. Compared to cascaded channel estimation based on least squares or minimum mean squared error, codebook-based beam training has been widely adopted for mmWave or THz communication systems [15, 16, 17]. The beam training method can obtain CSI by estimating the physical directions of channel paths rather than the entire channel, thus realizing lower complexity. Moreover, beam training can directly achieve reliable beamforming by selecting a phase-shift vector from among a set of pre-defined “codewords” during the training procedure, and thus is considered to be an efficient approach to acquire CSI in RIS-assisted wireless communication systems [18, 19, 20]. Existing codebook design and beam training schemes cannot be directly applied to RIS-assisted NFC systems or hybrid FFC & NFC systems.

I-A Prior Works

I-A1 Channel modeling for NFC

Signals in the far field of an array lead to planar wavefronts that produce linear phase variations and negligible amplitude differences across the array. However, the situation is different for near-field signals. In order to achieve better performance through reasonable resource allocation, accurate channel models are essential for NFC. Hybrid-field channel modeling schemes were studied in [21] and [22], where the far-field and near-field components are separately estimated. A polar-domain representation for near-field channel models was proposed in [23], accounting for the information in both the angular and distance domains. Considering the different multi-path characteristics observed by antennas at different distances in large-scale MIMO NFC systems, the authors in [24] proposed a non-stationary distance modeling framework.

I-A2 Beam training schemes

The beam training process is implemented by searching for the optimal beam from multiple predefined directional beams (codewords). For beam training, testing all codewords in the codebook during the training process is the most straightforward approach. However, the codebook and the resulting training overhead can be extremely large for large-scale massive MIMO systems, especially when considering both angular and distance information in NFC. The authors in [15] proposed a new hierarchical codebook to achieve uniform beam alignment performance with low overhead for mmWave communication systems. For mmWave and sub-THz systems with multiple users, [4] and [16] proposed hierarchical beamforming training strategies to carry out simultaneous training for multiple users. Aiming at overcoming the resolution limit of directional angle estimation, [25] proposed a codebook-based beam search approach for mmWave massive MIMO transmissions. However, these codebooks are designed for the far-field case. Considering the spherical wavefront propagation model for NFC, [17, 26] proposed a two-phase beam training method to sequentially perform the beam sweeping in the angular and distance domains.

I-A3 Beam training design for RISs

To implement beam training for RIS-based systems, one must first construct an appropriate RIS codebook based on information about the cascaded channel. Then, based on the information obtained during the training phase, the RIS selects the optimal codeword from the predesigned codebook to perform passive beamforming. For RISs with massive numbers of elements, highly efficient beam training schemes with good performance are required to reduce the training overhead. The authors in [19] first proposed a hierarchical codebook-generating method using pattern synthesis, then provided a hierarchical beam training method using two multi-mainlobe codewords in each layer. To train multiple users at the same time, a multi-lobe beam training mechanism was proposed in [27] based on the BS-RIS joint codebook, thus achieving reduced overhead. A multi-beam training method was proposed for a RIS-assisted multiuser system in [28], by dividing the RIS into multiple sub-surfaces and designing multi-beam directions over time. Although [20, 29, 30] proposed beam training schemes for RIS-assisted NFC systems, only limited scenarios with single-antenna users were considered.

I-B Motivation and Contributions

As the size of the RIS increases, the near-field region becomes non-negligible. In NFC, CSI is not only related to the angle but also distance, thus the acquisition of CSI becomes very important for proper beam design. The methods for obtaining CSI can be roughly classified into two categories: channel estimation and beam training [30]. In this article, we consider the use of beam training to simultaneously estimate the channel parameters and perform passive beamforming [31], which is simpler than performing channel estimation first and then separately determining the optimal beamforming.

Although there are numerous beam training schemes for FFC, codebook and beam training design for NFC are still in their infancy, especially for RIS-assisted systems. Moreover, the effect of different channel modeling methods for FFC and NFC has not been well investigated. In order to fill this gap, in this article we focus on four different channel models for downlink MIMO RIS-aided systems. Furthermore, we design codebooks and beam training schemes for near-field and mixed-far-near-field channels, which are further used for RIS reflecting coefficient optimization. The main contributions of our work are listed as follows:

  1. 1.

    We consider four different channel models for a downlink RIS-assisted MIMO system, namely, i) FF: far-field model for both BS-RIS and RIS-user links; ii) NF: near-field model for BS-RIS link, far-field model for RIS-user link; iii) FN: far-field model for BS-RIS link, near-field model for RIS-user link; iv) NN: near-field model for both BS-RIS and RIS-user links. Here, the assumption of far-field propagation leads to a planar-wave channel model, while near-field propagation leads to a spherical-wave channel model.

  2. 2.

    According to the angular or distance information contained in the received signals, we design i) a distance-based codebook for the NN channel model, based on which we propose a hierarchical beam training scheme to reduce the training overhead; ii) a combined angular-distance codebook for NF and FN channel models, based on which we propose a two-stage beam training scheme to separately achieve alignment in the angular and distance domains.

  3. 3.

    To maximize the achievable rate, we propose an alternating optimization (AO) algorithm to carry out the joint optimization of the RIS coefficients and the transmit and receive beamformers in an iterative manner. Specifically, the RIS coefficient matrix is obtained by the proposed beam training schemes, the optimal combining matrix at the user is obtained from the closed-form solution for the mean square error (MSE) minimization problem, and the active beamforming matrix at the BS is optimized by exploiting the relationship between the achievable rate and the MSE.

  4. 4.

    We present numerical results revealing that: i) the proposed hierarchical and two-stage beam training approaches yield achievable rate performance similar to the exhaustive search (ES) method while significantly reducing the training overhead; ii) compared to angular-only far-field channel models, the achievable rate is improved by exploiting the additional distance information when performing the beam design for NFC.

The organization for the rest of this article is as follows. In Section II, we describe the proposed RIS-assisted MIMO system and the four considered channel models. In Section III, we design different codebooks for the different channel models based on the angular or distance information in the received signals. In Section IV, we propose an AO algorithm to carry out the joint optimization in an iterative manner for maximizing the achievable rate. In particular, two beam training algorithms are proposed in Section IV-A based on the predesigned codebooks, the combining matrix optimization is given in Section IV-B, and the active beamforming matrix optimization is described in Section IV-C. Simulation results and conclusions are given in Section V and Section VI, respectively.

II System Model

Refer to caption
Figure 1: Different channel models for RIS-assisted communication system.

We consider a RIS-assisted downlink communication scenario, where a single multi-antenna BS serves a multi-antenna user. The direct path between the BS and the user is assumed to be blocked due to the existence of propagation obstacles. The BS is equipped with an NBN_{\rm{B}}-element uniform linear array (ULA) of antennas, and the user is equipped with an NUN_{\rm{U}}-element ULA. The RIS consists of a uniform planar array (UPA) with M=MxMyM={M_{x}}{M_{y}} passive reflecting elements, where Mx{M_{x}} and My{M_{y}} denote the number of elements along the horizontal axis and vertical axis, respectively.

Four different channel models are considered for the RIS-assisted communication system, as shown in Fig. 1. Specifically, these four channel models are respectively abbreviated as (a) FF: far-field model for both BS-RIS and RIS-user links; (b) NF: near-field model for BS-RIS link, far-field model for RIS-user link; (c) FN: far-field model for BS-RIS link, near-field model for RIS-user link; (d) NN: near-field model for both BS-RIS and RIS-user links. We assume that the system operates at a frequency of fcf_{c}, so the wavelength of the signal is λc=cfc\lambda_{c}=\frac{c}{f_{c}}. Denote the array spacing as dd, which we will assume here to be d=λc/2d=\lambda_{c}/2. Denote the array apertures of the BS, RIS and user as DBD_{B}, DRD_{R} and DUD_{U}, respectively. For the BS and the user with ULAs, the array apertures are calculated as DB=(NB1)dD_{\rm{B}}=\left(N_{\rm{B}}-1\right)d and DU=(NU1)dD_{\rm{U}}=\left(N_{\rm{U}}-1\right)d, respectively; for the RIS with a UPA, the array aperture is calculated as DR=[(Mx1)d]2+[(My1)d]2D_{\rm{R}}=\sqrt{\left[\left(M_{x}-1\right)d\right]^{2}+\left[\left(M_{y}-1\right)d\right]^{2}}. The comparison between the far-field region and near-field region in RIS-assisted systems is summarized in TABLE I, including the Rayleigh boundary when d=λc/2d=\lambda_{c}/2.

TABLE I: Comparison between the far-field and near-field regions in RIS-assisted systems
BS-RIS channel RIS-user channel
Far-field rB,R>2(DB+DR)2λcr_{{\rm{B}},{\rm{R}}}>\frac{2\left(D_{\rm{B}}+D_{\rm{R}}\right)^{2}}{\lambda_{c}} rR,U>2(DR+DU)2λcr_{{\rm{R}},{\rm{U}}}>\frac{2\left(D_{\rm{R}}+D_{\rm{U}}\right)^{2}}{\lambda_{c}}
Near-field rB,R2(DB+DR)2λcr_{{\rm{B}},{\rm{R}}}\leq\frac{2\left(D_{\rm{B}}+D_{\rm{R}}\right)^{2}}{\lambda_{c}} rR,U2(DR+DU)2λcr_{{\rm{R}},{\rm{U}}}\leq\frac{2\left(D_{\rm{R}}+D_{\rm{U}}\right)^{2}}{\lambda_{c}}
Boundary(d=λc/2)\begin{array}[]{cc}\rm{Boundary}\\ \left(d=\lambda_{c}/2\right)\\ \end{array} [(NB1)+(Mx1)2+(My1)2]2λc2\frac{\left[\left(N_{\rm{B}}-1\right)+\sqrt{\left(M_{x}-1\right)^{2}+\left(M_{y}-1\right)^{2}}\right]^{2}{\lambda_{c}}}{2} [(NU1)+(Mx1)2+(My1)2]2λc2\frac{\left[\left(N_{\rm{U}}-1\right)+\sqrt{\left(M_{x}-1\right)^{2}+\left(M_{y}-1\right)^{2}}\right]^{2}{\lambda_{c}}}{2}

II-A Channel Model

In order to explore the differences among the four channel scenarios in terms of signal model, beam design, transmission performance, etc., we first provide mathematical descriptions of the models below. More specifically, we will first present the far-field model for the BS-RIS and RIS-user channels, then give the near-field model for the BS-RIS and RIS-user channels, and finally obtain the cascaded channel models for the four channel scenarios mentioned above.

II-A1 Far-field channel model

When the far-field channel model is considered, the channel between the BS and RIS is characterized by the Saleh-Valenzuela channel model [32], given by

𝐆B,Rfar=MNBLBl=0LB1βl𝐚R(αlA,φlA)𝐚BH(αlD),{{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{far}}}=\sqrt{\frac{{{M}{N_{\rm{B}}}}}{L_{\rm{B}}}}\sum\limits_{l=0}^{L_{\rm{B}}-1}{{\beta_{l}}{\bf{a}}_{\rm{R}}\left({\alpha_{l}^{\rm{A}}},{\varphi_{l}^{\rm{A}}}\right){{\bf{a}}_{\rm{B}}^{H}}\left({\alpha_{l}^{\rm{D}}}\right)}, (1)

where LBL_{\rm{B}} is the number of paths between the BS and RIS, β0{\beta_{0}} represents the complex gain of the line-of-sight (LoS) component, βl(1lLB1){\beta_{l}}\left(1\leq l\leq L_{\rm{B}}-1\right) denotes the complex gain of the ll-th non-line-of-sight (NLoS) path [33], αlA{\alpha_{l}^{\rm{A}}} and φlA\varphi_{l}^{\rm{A}} denote the azimuth and elevation angle of arrival (AoA) associated with the RIS, αlD{\alpha_{l}^{\rm{D}}} denotes the angle of departure (AoD) associated with the BS, and 𝐚R(αlA,φlA){\bf{a}}_{\rm{R}}\left({\alpha_{l}^{\rm{A}}},{\varphi_{l}^{\rm{A}}}\right) and 𝐚B(αlD){{\bf{a}}_{\rm{B}}}\left({\alpha_{l}^{\rm{D}}}\right) are the array response vectors associated with the RIS and the BS, respectively.

For a UPA with MxM_{x} and MyM_{y} elements (MxMy=M{M_{x}}{M_{y}}=M) on the horizontal and the vertical axes respectively, the RIS array response vector is given by

𝐚R(α,φ)=1M[1,,ej2πdλc(Mx1)sinαsinφ]T[1,,ej2πdλc(My1)cosφ]T,\begin{array}[]{l}{{\bf{a}}_{\rm{R}}}\left({\alpha,\varphi}\right)=\frac{1}{{\sqrt{M}}}\Big{[}1,\cdots,{e^{-j\frac{{2\pi d}}{\lambda_{c}}{\left({{M_{x}}-1}\right)\sin\alpha\sin\varphi}}}\Big{]}^{T}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\otimes\Big{[}1,\cdots,e^{-j\frac{{2\pi d}}{\lambda_{c}}{\left({{M_{y}}-1}\right)\cos\varphi}}\Big{]}^{T},\end{array} (2)

where 0x(Mx1)0\leq x\leq(M_{x}-1) and 0y(My1)0\leq y\leq(M_{y}-1), and \otimes is the Kronecker product. For the ULA with NBN_{\rm{B}} elements at the BS, the array response vector is expressed as [34]

𝐚B(α)=1NB[1,,ej(NB1)2πdλcsinα]T,{{\bf{a}}_{\rm{B}}}\left(\alpha\right)=\frac{1}{{\sqrt{N_{\rm{B}}}}}{\left[1,\cdots,{e^{-j\left({N_{\rm{B}}-1}\right)\frac{{2\pi d}}{\lambda_{c}}\sin\alpha}}\right]^{T}}, (3)

where 0nb(NB1)0\leq n_{b}\leq(N_{\rm{B}}-1). Since the response vector of a ULA is constant in the elevation domain, we omit the parameter φ{\varphi} in the response vector of the BS in (3).

Similarly, the channel between the RIS and user in the far-field region is given by

𝐆R,Ufar=MNULUl=0LU1βl𝐚U(αlA)𝐚RH(αlD,φlD),{\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{far}}=\sqrt{\frac{{{M}{N_{\rm{U}}}}}{L_{\rm{U}}}}\sum\limits_{l=0}^{L_{\rm{U}}-1}{{\beta_{l}}{\bf{a}}_{\rm{U}}\left({\alpha_{l}^{\rm{A}}}\right){{\bf{a}}_{\rm{R}}^{H}}\left({\alpha_{l}^{\rm{D}}},{\varphi_{l}^{\rm{D}}}\right)}, (4)

where LUL_{\rm{U}} is the number of paths between the RIS and user, αlA{\alpha_{l}^{{\rm{A}}}} denotes the azimuth AoA associated with the user, αlD{\alpha_{l}^{\rm{D}}} and φlD{\varphi_{l}^{\rm{D}}} denote the azimuth and elevation AoD associated with the RIS respectively, and the array response vectors 𝐚R(αlD,φlD){\bf{a}}_{\rm{R}}\left({\alpha_{l}^{\rm{D}}},{\varphi_{l}^{\rm{D}}}\right) and 𝐚U(αlA){\bf{a}}_{\rm{U}}\left({\alpha_{l}^{{\rm{A}}}}\right) can be generated similarly to (2) and (3).

Remark 1.

Assume that the number of RIS elements is far larger than the number of BS and user antennas. When the far-field channel model is considered (no matter whether the BS-RIS link or the RIS-user link follows the far-field model), the rank rr of the cascaded BS-RIS-user channel satisfies rmin{LB,LU}r\leq\min\left\{L_{\rm{B}},L_{\rm{U}}\right\}, and we say that the channel has rr degrees of freedom (DoFs) [35]. Thus, the dimension of the transmitted signal vector should satisfy qrmin{LB,LU}q\leq r\leq\min\left\{L_{\rm{B}},L_{\rm{U}}\right\}. When environmental scattering is absent and no NLoS paths are present, the rank of the cascaded channel is 1.

II-A2 Near-field channel model

For communications in the near-field domain, we consider a three-dimensional topology. In FFC, the signal propagation paths from transmitters to receivers can be regarded as parallel to each other if they share the same AoA. However, in NFC, the angle distribution is also related to the distance between specific points of transmitters and receivers. Assume that all the BS antennas are located on the xx-axis, where the coordinate of the midpoint of the BS array is denoted as (0,0,0)\left(0,0,0\right). Thus, the coordinate of the nbn_{b}-th antenna at the BS can be denoted as

𝐪B(nb)=(n~bd,0,0),{\bf{q}}_{\rm{B}}\left(n_{b}\right)=\left({{\tilde{n}}_{b}}d,0,0\right), (5)

where n~b=nbNB12{{\tilde{n}}_{b}}=n_{b}-\frac{N_{\rm{B}}-1}{2}.

Similarly, assume that all of the user antennas are parallel to the xx-axis, where the coordinate of the midpoint of the user array is (xU,yU,zU)\left(x_{\rm{U}},y_{\rm{U}},z_{\rm{U}}\right). Thus, the location of nun_{u}-th antenna at the user can be denoted as

𝐪U(nu)=(xU+n~ud,yU,zU),{\bf{q}}_{\rm{U}}\left(n_{u}\right)=\left(x_{\rm{U}}+{{\tilde{n}}_{u}}d,y_{\rm{U}},z_{\rm{U}}\right), (6)

where n~u=nuNU12{{\tilde{n}}_{u}}=n_{u}-\frac{N_{\rm{U}}-1}{2}.

Assume that all elements of the RIS are parallel to the XY-plane. Denote the coordinate of the midpoint of the RIS as (xR,yR,zR)\left(x_{\rm{R}},y_{\rm{R}},z_{\rm{R}}\right). Thus, the coordinate of the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS can be expressed as

𝐪R(mx,my)=(xR+m~xd,yR+m~yd,zR),{\bf{q}}_{\rm{R}}\left(m_{x},m_{y}\right)=\left(x_{\rm{R}}+{{\tilde{m}}_{x}}d,y_{\rm{R}}+{{\tilde{m}}_{y}}d,z_{\rm{R}}\right), (7)

where m~x=mxMx12{{\tilde{m}}_{x}}=m_{x}-\frac{M_{x}-1}{2} and m~y=myMy12{{\tilde{m}}_{y}}=m_{y}-\frac{M_{y}-1}{2}. Further, assume that the location and topology of the RIS are known.

Based on the above geometry, the LoS link for the near-field channel between BS and RIS can be modeled as [36]

𝐆B,Rnear=[𝐠B,R1,,𝐠B,Rmxy,,𝐠B,RM]T,{{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{near}}}=\left[{\bf{g}}_{{\rm{B}},{\rm{R}}}^{1},\cdots,{\bf{g}}_{{\rm{B}},{\rm{R}}}^{m_{xy}},\cdots,{\bf{g}}_{{\rm{B}},{\rm{R}}}^{M}\right]^{T}, (8)

where 𝐠B,Rmxy=[κmxy,1ej2πλcdmxy,1B,,{\bf{g}}_{{\rm{B}},{\rm{R}}}^{m_{xy}}=\Big{[}\kappa_{m_{xy},1}e^{-j\frac{{2\pi}}{\lambda_{c}}d_{m_{xy},1}^{\rm{B}}},\cdots, κmxy,NBej2πλcdmxy,NBB]T\kappa_{m_{xy},N_{\rm{B}}}e^{-j\frac{{2\pi}}{\lambda_{c}}d_{m_{xy},N_{\rm{B}}}^{\rm{B}}}\Big{]}^{T} and κmxy,nb1dmxy,nbB\kappa_{m_{xy},n_{b}}\propto\frac{1}{d_{m_{xy},n_{b}}^{\rm{B}}} denotes the free-space large-scale path loss between the nbn_{b}-th antenna of the BS and the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS. The distance between the nbn_{b}-th antenna of the BS and the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS is given by

dmxy,nbB=𝐪B(nb)𝐪R(mx,my)2,d_{m_{xy},n_{b}}^{\rm{B}}=\left\|{\bf{q}}_{\rm{B}}\left(n_{b}\right)-{\bf{q}}_{\rm{R}}\left(m_{x},m_{y}\right)\right\|_{2}, (9)

which can be expanded as

dmxy,nbB=(xR+m~xdn~bd)2+(yR+m~yd)2+zR2=rmxyB2+(n~bd)22n~bdrmxyBsinαmxyBsinφmxyB(a)rmxyBn~bdsinαmxyBsinφmxyB+(n~bd)2(1sin2αmxyBsin2φmxyB)2rmxyB,\begin{array}[]{l}d_{m_{xy},n_{b}}^{\rm{B}}=\sqrt{\left(x_{\rm{R}}+{{\tilde{m}}_{x}}d-{{\tilde{n}}_{b}}d\right)^{2}+\left(y_{\rm{R}}+{{\tilde{m}}_{y}}d\right)^{2}+z_{\rm{R}}^{2}}\\ \;\;\;\;\;\;\;=\sqrt{{r_{m_{xy}}^{\rm{B}}}^{2}+\left({{\tilde{n}}_{b}}d\right)^{2}-2{{\tilde{n}}_{b}}dr_{m_{xy}}^{\rm{B}}\sin\alpha_{m_{xy}}^{\rm{B}}\sin\varphi_{m_{xy}}^{\rm{B}}}\\ \;\;\;\;\;\;\;\overset{\left(a\right)}{\approx}r_{m_{xy}}^{\rm{B}}-{{\tilde{n}}_{b}}d\sin\alpha_{m_{xy}}^{\rm{B}}\sin\varphi_{m_{xy}}^{\rm{B}}\\ \;\;\;\;\;\;\;\;\;\;\;+\frac{\left({{\tilde{n}}_{b}}d\right)^{2}\left(1-\sin^{2}\alpha_{m_{xy}}^{\rm{B}}\sin^{2}\varphi_{m_{xy}}^{\rm{B}}\right)}{2r_{m_{xy}}^{\rm{B}}},\end{array} (10)

with rmxyBr_{m_{xy}}^{\rm{B}} denoting the distance from (0,0,0)\left(0,0,0\right) and the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS, αmxyB\alpha_{m_{xy}}^{\rm{B}}, φmxyB\varphi_{m_{xy}}^{\rm{B}} denoting the corresponding azimuth and elevation angle, respectively, and (a){\left(a\right)} is obtained based on the first-order Taylor expansion 1+x=1+12x18x2+𝒪(x3)\sqrt{1+x}=1+\frac{1}{2}x-\frac{1}{8}x^{2}+{\cal{O}}\left(x^{3}\right).

Similarly, the LoS near-field channel between the RIS and user can be modeled as

𝐆R,Unear=[𝐠R,U1,,𝐠R,Unu,,𝐠R,UNU]T,{{\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{near}}}=\left[{\bf{g}}_{{\rm{R}},{\rm{U}}}^{1},\cdots,{\bf{g}}_{{\rm{R}},{\rm{U}}}^{n_{u}},\cdots,{\bf{g}}_{{\rm{R}},{\rm{U}}}^{N_{\rm{U}}}\right]^{T}, (11)

where 𝐠R,Unu=[κnu,1ej2πλcdnu,1U,,κnu,Mej2πλcdnu,MU]T{\bf{g}}_{{\rm{R}},{\rm{U}}}^{n_{u}}=\left[\kappa_{n_{u},1}e^{-j\frac{{2\pi}}{\lambda_{c}}d_{n_{u},1}^{\rm{U}}},\cdots,\kappa_{n_{u},M}e^{-j\frac{{2\pi}}{\lambda_{c}}d_{n_{u},M}^{\rm{U}}}\right]^{T} and κnu,mxy1dnu,mxyU\kappa_{n_{u},m_{xy}}\propto\frac{1}{d_{n_{u},m_{xy}}^{\rm{U}}} denote the free-space large-scale path loss between the nun_{u}-th antenna of the user and the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS. The distance between the nun_{u}-th antenna of the user and the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS is given by

dnu,mxyU=𝐪U(nu)𝐪R(mx,my)2,d_{n_{u},m_{xy}}^{\rm{U}}=\left\|{\bf{q}}_{\rm{U}}\left(n_{u}\right)-{\bf{q}}_{\rm{R}}\left(m_{x},m_{y}\right)\right\|_{2}, (12)

which can be approximated as

dnu,mxyUrmxyUn~udsinαmxyUsinφmxyU+(n~ud)2(1sin2αmxyUsin2φmxyU)2rmxyU,\begin{array}[]{l}d_{n_{u},m_{xy}}^{\rm{U}}{\approx}\;r_{m_{xy}}^{\rm{U}}-{{\tilde{n}}_{u}}d\sin\alpha_{m_{xy}}^{\rm{U}}\sin\varphi_{m_{xy}}^{\rm{U}}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;+\frac{\left({{\tilde{n}}_{u}}d\right)^{2}\left(1-\sin^{2}\alpha_{m_{xy}}^{\rm{U}}\sin^{2}\varphi_{m_{xy}}^{\rm{U}}\right)}{2r_{m_{xy}}^{\rm{U}}},\end{array} (13)

with rmxyUr_{m_{xy}}^{\rm{U}} denoting the distance from the midpoint of the user array and the (mx,my)\left(m_{x},m_{y}\right)-th element of the RIS, αmxyU\alpha_{m_{xy}}^{\rm{U}}, φmxyU\varphi_{m_{xy}}^{\rm{U}} denoting the corresponding azimuth and elevation angle, respectively.

Remark 2.

When both the BS-RIS and RIS-user links are in the near-field region, the rank of the cascaded LoS channel is r=min{NB,NU,M}r=\min\left\{N_{\rm{B}},N_{\rm{U}},M\right\}, which will be much larger than 1 in the case of large-scale arrays, even in the absence of NLoS paths. Thus, one of the main advantages of NFC is that they possess higher DoFs without relying on abundant environmental scattering.

II-A3 Cascaded channel model

Denote the phase-shift matrix of the RIS as 𝚯=diag(ϕ1,,{\bf{\Theta}}={\rm diag}\big{(}\phi_{1},\cdots, ϕm,,ϕM)\phi_{m},\cdots,\phi_{M}\big{)}, with ϕm=ejθm,θm[0,2π)\phi_{m}=e^{-j\theta_{m}},\theta_{m}\in\left[0,2\pi\right) denoting the phase-shift coefficient of the mm-th RIS element. Therefore, the cascaded channels of the four scenarios mentioned above can be expressed as

1)\displaystyle 1)\; 𝐇FF=𝐆R,Ufar𝚯𝐆B,Rfar,\displaystyle{\bf{H}}_{\rm{FF}}={\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{far}}{\bf{\Theta}}{{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{far}}}, (14a)
2)\displaystyle 2)\; 𝐇NF=𝐆R,Ufar𝚯𝐆B,Rnear,\displaystyle{\bf{H}}_{\rm{NF}}={\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{far}}{\bf{\Theta}}{{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{near}}}, (14b)
3)\displaystyle 3)\; 𝐇FN=𝐆R,Unear𝚯𝐆B,Rfar,\displaystyle{\bf{H}}_{\rm{FN}}={\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{near}}{\bf{\Theta}}{{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{far}}}, (14c)
4)\displaystyle 4)\; 𝐇NN=𝐆R,Unear𝚯𝐆B,Rnear.\displaystyle{\bf{H}}_{\rm{NN}}={\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{near}}{\bf{\Theta}}{{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{near}}}. (14d)

II-B Signal Model

We assume that fully-digital beamforming is adopted at the BS, and thus the BS transmitted signal is given by

𝐬=𝐖𝐱,{\bf{s}}={\bf{W}}{\bf{x}}, (15)

where 𝐱q×1{\bf{x}}\in{\mathbb{C}}^{q\times 1} is the symbol vector, satisfying 𝔼[𝐱𝐱H]=𝐈q{\mathbb{E}}\left[{\bf{x}}{\bf{x}}^{H}\right]={\bf{I}}_{q}, and 𝐖NB×q{\bf{W}}\in{\mathbb{C}}^{N_{\rm{B}}\times q} is the beamforming matrix or precoder.

Assuming the receiver adopts a linear combiner, the received signal at the user is given by

𝐲=𝐔H𝐇𝐖𝐱+𝐔H𝐧,{\bf{y}}={\bf{U}}^{H}{\bf{H}}{\bf{W}}{\bf{x}}+{\bf{U}}^{H}{\bf{n}}, (16)

where 𝐔NU×q{\bf{U}}\in{\mathbb{C}}^{N_{\rm{U}}\times q} is the combining matrix, 𝐇{𝐇FF,𝐇NF,𝐇FN,𝐇NN}{\bf{H}}\in\left\{{\bf{H}}_{\rm{FF}},{\bf{H}}_{\rm{NF}},{\bf{H}}_{\rm{FN}},{\bf{H}}_{\rm{NN}}\right\} is the cascaded channel between the BS and the user based on the specific channel model, and 𝐧𝒞𝒩(𝟎,σ2𝐈NU){\bf{n}}\in{\cal{CN}}\left({\bf{0}},\sigma^{2}{\bf{I}}_{N_{\rm{U}}}\right) is additive white Gaussian noise (AWGN).

The maximum achievable data rate (bits/s/Hz) for the user is given by

R(𝐖,𝚯)=log2|𝐈NU+𝐇𝐖𝐖H𝐇Hσ2|,R\left({\bf{W}},{\bf{\Theta}}\right)=\log_{2}\left|{\bf{I}}_{N_{\rm{U}}}+{\bf{H}}{\bf{W}}{\bf{W}}^{H}{\bf{H}}^{H}\sigma^{-2}\right|, (17)

where |𝐗|\left|{\bf{X}}\right| represents the determinant of the matrix 𝐗{\bf{X}}.

Remark 3.

Equation (17) characterizes the maximum achievable rate when the optimal combiner at the user, denoted as 𝐔opt{\bf{U}}_{\rm{opt}}, is adopted. Given {𝐖,𝚯}\left\{{\bf{W}},{\bf{\Theta}}\right\}, closed-form solutions for 𝐔opt{\bf{U}}_{\rm{opt}} can be obtained, as detailed in the sequel.

III RIS Codebook Design

The precise design of the RIS coefficient matrix requires accurate channel information, which is difficult to obtain due to the passivity of RISs. Therefore, in this article, we consider exploiting beam training, which can perform channel estimation and RIS coefficient optimization simultaneously. To begin with, in this section, we will first design codebooks for different channel models. Based on the information contained in the received signals, angular-domain and distance-based codebooks are designed for FF and NN models respectively, while a combined angular-distance (AD) codebook is designed for NF and FN models. Each column in the designed codebook corresponds to one candidate RIS passive beamforming vector.

III-A Angular-domain Codebook for FF

In this subsection, we consider an angular-domain codebook that is universal in the far-field domain. Generally, existing RIS codebooks for FF channel models aim at aligning the beam to the strongest propagation path to maximize the beamforming gain. Ignoring weak paths, the signal at the user can be written as

𝐲FF=β0𝐔H𝐚U(α0A)𝐚RH(α0D,φ0D)diag(ϕ)𝐚R(α0A,φ0A)𝐚BH(α0D)𝐖𝐱+𝐔H𝐧,\begin{array}[]{l}{\bf{y}}_{\rm{FF}}={\beta_{0}}^{\prime}{\bf{U}}^{H}{{\bf{a}}_{\rm{U}}\left({\alpha_{0}^{\rm{A}}}\right){{\bf{a}}_{\rm{R}}^{H}}\left({\alpha_{0}^{\rm{D}}},{\varphi_{0}^{\rm{D}}}\right)}{\rm diag}\left({\bm{\phi}}\right)\\ \;\;\;\;\;\;\;\;\;{{\bf{a}}_{\rm{R}}\left({\alpha_{0}^{\rm{A}}},{\varphi_{0}^{\rm{A}}}\right){{\bf{a}}_{\rm{B}}^{H}}\left({\alpha_{0}^{\rm{D}}}\right)}{\bf{W}}{\bf{x}}+{\bf{U}}^{H}{\bf{n}},\end{array} (18)

where β0{\beta_{0}}^{\prime} denotes the complex gain of the cascaded LoS channel. By substituting the array response vectors 𝐚R(α0D,φ0D){{\bf{a}}_{\rm{R}}}\left({\alpha_{0}^{\rm{D}}},{\varphi_{0}^{\rm{D}}}\right) and 𝐚R(α0A,φ0A){\bf{a}}_{\rm{R}}\left({\alpha_{0}^{\rm{A}}},{\varphi_{0}^{\rm{A}}}\right) into (18), the user’s signal can be reformulated as

𝐲FF=β0𝐔H𝐚U(α0A)m=1Mej(θm+νmAνmD)𝐚BH(α0D)𝐖𝐱+𝐔H𝐧,\begin{array}[]{l}{\bf{y}}_{\rm{FF}}={\beta_{0}}^{\prime}{\bf{U}}^{H}{\bf{a}}_{\rm{U}}\left({\alpha_{0}^{\rm{A}}}\right)\sum\limits_{m=1}^{M}e^{-j\left(\theta_{m}+\nu_{m}^{{\rm{A}}}-\nu_{m}^{{\rm{D}}}\right)}{{\bf{a}}_{\rm{B}}^{H}}\left({\alpha_{0}^{\rm{D}}}\right){\bf{W}}{\bf{x}}\\ \;\;\;\;\;\;\;\;\;\;\;+{\bf{U}}^{H}{\bf{n}},\end{array} (19)

where νmA=2πdλc[(mx1)sinα0Asinφ0A+(my1)cosφ0A]\nu_{m}^{{\rm{A}}}=\frac{{2\pi d}}{\lambda_{c}}\left[\left({{m_{x}}-1}\right)\sin\alpha_{0}^{\rm{A}}\sin\varphi_{0}^{\rm{A}}+{\left({{m_{y}}-1}\right)\cos\varphi_{0}^{\rm{A}}}\right] and νmD=2πdλc[(mx1)sinα0Dsinφ0D+(my1)cosφ0D]\nu_{m}^{{\rm{D}}}=\frac{{2\pi d}}{\lambda_{c}}\big{[}\left({{m_{x}}-1}\right)\sin\alpha_{0}^{\rm{D}}\sin\varphi_{0}^{\rm{D}}+\left({{m_{y}}-1}\right)\cos\varphi_{0}^{\rm{D}}\big{]}. Thus, the optimal RIS phase-shift coefficients are θm=νmDνmA\theta_{m}=\nu_{m}^{{\rm{D}}}-\nu_{m}^{{\rm{A}}}. All candidate angle pairs on the beam grid should be considered when accurate channel state information is unavailable, which is one of the primary principles for far-field codebook design.

Assume that 𝐔{\bf{U}} and 𝐖{\bf{W}} have already been designed to align with the strongest path. 𝐔{\bf{U}} and 𝐖{\bf{W}} can be designed with the channel information obtained through beam training, and we will show how 𝐔{\bf{U}} and 𝐖{\bf{W}} can be obtained later. Thus, the RIS codebook for the FF channel model can be designed as [28] [30]

FF=[𝐛(β1,δ1),,𝐛(βmx,δmy),,𝐛(βMx,δMy)],\begin{array}[]{l}{\cal{F}}_{\rm{FF}}=\Big{[}{\bf{b}}\left(\beta_{1},\delta_{1}\right),\cdots,{\bf{b}}\left(\beta_{m_{x}},\delta_{m_{y}}\right),\cdots,{\bf{b}}\left(\beta_{M_{x}},\delta_{M_{y}}\right)\Big{]}^{*},\end{array} (20)

where βmx=2mxMx1Mx\beta_{m_{x}}=\frac{2{m_{x}}-{M_{x}}-1}{M_{x}} with mx=1,,Mx{m_{x}}=1,\cdots,{M_{x}}, δmy=2myMy1My\delta_{m_{y}}=\frac{2{m_{y}}-{M_{y}}-1}{M_{y}} with my=1,,My{m_{y}}=1,\cdots,{M_{y}}, and 𝐛(β,δ){{\bf{b}}}\left({\beta,\delta}\right) is the following far-field steering vector

𝐛(β,δ)=[1,,ej2πdλc(Mx1)βδ]T[1,,ej2πdλc(My1)δ]T.\begin{array}[]{l}{{\bf{b}}}\left({\beta,\delta}\right)=\Big{[}1,\cdots,{e^{-j\frac{{2\pi d}}{\lambda_{c}}{\left({{M_{x}}-1}\right)\beta\delta}}}\Big{]}^{T}\otimes\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;{\Big{[}1,\cdots,e^{-j\frac{{2\pi d}}{\lambda_{c}}{\left({{M_{y}}-1}\right)\delta}}}\Big{]}^{T}.\end{array} (21)

Each column of FF{\cal{F}}_{\rm{FF}} is a candidate beam codeword for the RIS in the far-field domain. This angular-domain codebook design makes full use of the angular information of the far-field paths.

III-B Distance-based Codebook Design for NN

Angular-only far-field codebooks are not applicable to near-field channels, even if only one or the other of the BS-RIS and RIS-user links is in the near-field domain because both distance and angular information are embedded in the received signal. Therefore, novel codebooks are required to match the channels in the near-field region. When both the BS-RIS link and RIS-user link are in the near-field domain, the combined signal at the user is given by (22) at the bottom of the next page, where νnu,m,nb=2πλc(dnu,mU+dm,nbB)\nu_{n_{u},m,n_{b}}=\frac{{2\pi}}{\lambda_{c}}\left(d_{n_{u},m}^{\rm{U}}+d_{m,n_{b}}^{\rm{B}}\right), determined by the sum of the distances from the BS to RIS and from the RIS to the user.

𝐲NN=(λc4π)2𝐔H[m=1M1d1,mUdm,1Bej(θm+ν1,m,1)m=1M1d1,mUdm,NBBej(θm+ν1,m,Nb)m=1M1dnu,mUdm,1Bej(θm+νnu,m,1)m=1M1dnu,mUdm,NBBej(θm+νnu,m,NB)m=1M1dNU,mUdm,1Bej(θm+νNU,m,1)m=1M1dNU,mUdm,NBBej(θm+νNU,m,NB)]𝐖𝐱+𝐔H𝐧,\begin{array}[]{l}{\bf{y}}_{{\rm{NN}}}=\left(\frac{\lambda_{c}}{4\pi}\right)^{2}{\bf{U}}^{H}\begin{bmatrix}\sum\limits_{m=1}^{M}\frac{1}{d_{1,m}^{\rm{U}}d_{m,1}^{\rm{B}}}e^{-j\left(\theta_{m}+\nu_{1,m,1}\right)}&\cdots&\sum\limits_{m=1}^{M}\frac{1}{d_{1,m}^{\rm{U}}d_{m,N_{\rm{B}}}^{\rm{B}}}e^{-j\left(\theta_{m}+\nu_{1,m,N_{b}}\right)}\\ \vdots&&\vdots\\ \sum\limits_{m=1}^{M}\frac{1}{d_{n_{u},m}^{\rm{U}}d_{m,1}^{\rm{B}}}e^{-j\left(\theta_{m}+\nu_{n_{u},m,1}\right)}&\cdots&\sum\limits_{m=1}^{M}\frac{1}{d_{n_{u},m}^{\rm{U}}d_{m,N_{\rm{B}}}^{\rm{B}}}e^{-j\left(\theta_{m}+\nu_{n_{u},m,N_{\rm{B}}}\right)}\\ \vdots&&\vdots\\ \sum\limits_{m=1}^{M}\frac{1}{d_{N_{\rm{U}},m}^{\rm{U}}d_{m,1}^{\rm{B}}}e^{-j\left(\theta_{m}+\nu_{N_{\rm{U}},m,1}\right)}&\cdots&\sum\limits_{m=1}^{M}\frac{1}{d_{N_{\rm{U}},m}^{\rm{U}}d_{m,N_{\rm{B}}}^{\rm{B}}}e^{-j\left(\theta_{m}+\nu_{N_{\rm{U}},m,N_{\rm{B}}}\right)}\end{bmatrix}{\bf{W}}{\bf{x}}+{\bf{U}}^{H}{\bf{n}},\end{array} (22)

Define the following array steering vector related to the distance

𝒇(x,y,z)=exp[j2πλc(r1,1,,rmx,my,,rMx,My)]T,\begin{array}[]{l}{\bm{f}}\left(x,y,z\right)=\exp\left[-j\frac{{2\pi}}{{\lambda_{c}}}\left(r_{1,1},\cdots,r_{m_{x},m_{y}},\cdots,r_{M_{x},M_{y}}\right)\right]^{T},\end{array} (23)

where (x,y,z)\left(x,y,z\right) denotes the coordinate of the BS or the user, and rmx,my=(x,y,z),𝐪R(mx,my)2r_{m_{x},m_{y}}=\left\|\left(x,y,z\right),{\bf{q}}_{\rm{R}}\left(m_{x},m_{y}\right)\right\|_{2}. Generally, the height of the BS or the user is constant. Therefore, for the design of the near-field codebooks, we mainly consider the exploration of xx and yy, and the zz component in 𝒇(x,y,z){\bm{f}}\left(x,y,z\right) will be omitted hereafter.

Definition 1.

The \star operator is defined as follows for vectors of equal dimensions:

[𝐱1,,𝐱M][𝐲1,,𝐲N]=[𝐱1𝐲1,,𝐱1𝐲N,,𝐱M𝐲N],\begin{array}[]{l}\;\;\;\;\left[{\bf{x}}_{1},\cdots,{\bf{x}}_{M}\right]\star\left[{\bf{y}}_{1},\cdots,{\bf{y}}_{N}\right]\\ =\left[{\bf{x}}_{1}\odot{\bf{y}}_{1},\cdots,{\bf{x}}_{1}\odot{\bf{y}}_{N},\cdots,{\bf{x}}_{M}\odot{\bf{y}}_{N}\right],\end{array} (24)

where \odot denotes the Hadamard product.

We use a pair of coordinates to represent the rectangular sampling range on the XY-plane as (xmink,ymink)\left(x^{k}_{\min},y^{k}_{\min}\right) and (xmaxk,ymaxk)\left(x^{k}_{\max},y^{k}_{\max}\right), where xminkx^{k}_{\min} (yminky^{k}_{\min}) and xmaxkx^{k}_{\max} (ymaxky^{k}_{\max}) are the minimum and the maximum xx (yy)-coordinate of the sampling points respectively, and k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\} indicates the BS or user. Denote the number of points sampled on the xx-axis and yy-axis as SxS_{x} and SyS_{y}, respectively. Taking the corresponding distance between the sampling points into account, the codebook at the RIS for the NN channel model is given by

NN=[𝒇(x1U,y1U),,𝒇(xsxU,ysyU),,𝒇(xSxU,ySyU)][𝒇(x1B,y1B),,𝒇(xsxB,ysyB),,𝒇(xSxB,ySyB)],\begin{array}[]{l}{\cal{F}}_{\rm{NN}}=\Big{[}{\bm{f}}\left(x_{1}^{\rm{U}},y_{1}^{\rm{U}}\right),\cdots,{\bm{f}}\left(x_{s_{x}}^{\rm{U}},y_{s_{y}}^{\rm{U}}\right),\cdots,{\bm{f}}\left(x_{S_{x}}^{\rm{U}},y_{S_{y}}^{\rm{U}}\right)\Big{]}^{*}\\ \;\;\;\;\;\;\;\;\;\;\star\Big{[}{\bm{f}}\left(x_{1}^{\rm{B}},y_{1}^{\rm{B}}\right),\cdots,{\bm{f}}\left(x_{s_{x}}^{\rm{B}},y_{s_{y}}^{\rm{B}}\right),\cdots,{\bm{f}}\left(x_{S_{x}}^{\rm{B}},y_{S_{y}}^{\rm{B}}\right)\Big{]}^{*},\end{array} (25)

where xsxkx_{s_{x}}^{k} and ysxky_{s_{x}}^{k} are given by

xsxk=xmink+(sx12)xmaxkxminkSx,sx=1,,Sx,x_{s_{x}}^{k}=x^{k}_{\min}+\left(s_{x}-\frac{1}{2}\right)\frac{{x^{k}_{\max}-x^{k}_{\min}}}{{S_{x}}},\;s_{x}=1,\cdots,S_{x}, (26a)
ysyk=ymink+(sy12)ymaxkyminkSy,sy=1,,Sy.y_{s_{y}}^{k}=y^{k}_{\min}+\left(s_{y}-\frac{1}{2}\right)\frac{{y^{k}_{\max}-y^{k}_{\min}}}{{S_{y}}},\;s_{y}=1,\cdots,S_{y}. (26b)

The size of the codebook will increase with the number of sampling points in each direction, and the accuracy of the RIS beamforming will improve correspondingly.

III-C Combined AD Codebook Design for Hybrid FFC & NFC

In this section, we consider hybrid cascaded channel models, where one side of the RIS is in the far-field and the other is in the near-field. As such, the link on one side of RIS only needs to consider angular information, while the link on the other side needs to consider both angular and distance information. Taking the FN channel model as an example, i.e., with the BS-RIS link in the far-field and the RIS-user link in the near-field, the received signal at the user is given by

𝐲FN=𝐔H𝐆R,Uneardiag(ϕ)𝐆B,Rfar𝐖𝐱+𝐔H𝐧=β0λc4πM𝐔H[m=1M1d1,mUej(θm+ν1,mA),,m=1M1dNU,mUej(θm+νNU,mA)]T𝐚BH(α0D)𝐖𝐱+𝐔H𝐧,\begin{array}[]{l}{\bf{y}}_{{\rm{FN}}}={\bf{U}}^{H}{{\bf{G}}_{{\rm{R}},{\rm{U}}}^{\rm{near}}}{\rm diag}\left({\bm{\phi}}\right){{\bf{G}}_{{\rm{B}},{\rm{R}}}^{\rm{far}}}{\bf{W}}{\bf{x}}+{\bf{U}}^{H}{\bf{n}}\\ \;\;\;=\frac{{\beta_{0}}\lambda_{c}}{4\pi{\sqrt{M}}}{\bf{U}}^{H}\bigg{[}\sum\limits_{m=1}^{M}\frac{1}{d_{1,m}^{\rm{U}}}e^{-j\left(\theta_{m}+\nu_{1,m}^{{\rm{A}}}\right)},\cdots,\\ \;\;\;\sum\limits_{m=1}^{M}\frac{1}{d_{N_{\rm{U}},m}^{\rm{U}}}e^{-j\left(\theta_{m}+\nu_{N_{\rm{U}},m}^{{\rm{A}}}\right)}\bigg{]}^{T}{{\bf{a}}_{\rm{B}}^{H}}\left({\alpha_{0}^{\rm{D}}}\right){\bf{W}}{\bf{x}}+{\bf{U}}^{H}{\bf{n}},\end{array} (27)

where

νnu,mA=2πλc[(mx1)dsinα0Asinφ0A+(my1)dcosφ0A+dnu,mU].\begin{array}[]{l}\nu_{n_{u},m}^{\rm{A}}=\frac{{2\pi}}{\lambda_{c}}\bigg{[}\left({{m_{x}}-1}\right)d\sin\alpha_{0}^{\rm{A}}\sin\varphi_{0}^{\rm{A}}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;+{\left({{m_{y}}-1}\right)d\cos\varphi_{0}^{\rm{A}}}+d_{n_{u},m}^{\rm{U}}\bigg{]}.\end{array} (28)

Similar to the assumptions above for FF channels, we assume that the transmit or receive beam related to the far-field link has been designed to align with the steering vector of the strongest path. That is to say, 𝐖{\bf{W}} has been aligned to 𝐚BH(α0D){{\bf{a}}_{\rm{B}}^{H}}\left({\alpha_{0}^{\rm{D}}}\right) when designing the RIS codebook.

Considering the array response in both the distance and angular domains, we define the array steering vector as

𝐜(x,y,β,δ)=[ej2πλcd1,1,,ej2πλcdMx,My]T{[1,,ej2πdλc(Mx1)βδ]T[1,,ej2πdλc(My1)δ]T},\begin{array}[]{l}{{\bf{c}}}\left({x,y,\beta,\delta}\right)=\Big{[}{e^{-j\frac{{2\pi}}{\lambda_{c}}d_{1,1}}},\cdots,{e^{-j\frac{{2\pi}}{\lambda_{c}}d_{M_{x},M_{y}}}}\Big{]}^{T}\odot\\ \left\{\Big{[}1,\cdots,{e^{-j\frac{{2\pi d}}{\lambda_{c}}{\left({{M_{x}}-1}\right)\beta\delta}}}\Big{]}^{T}\otimes{\Big{[}1,\cdots,e^{-j\frac{{2\pi d}}{\lambda_{c}}{\left({{M_{y}}-1}\right)\delta}}}\Big{]}^{T}\right\},\end{array} (29)

where dmx,my=(x,y,z),𝐪R(mx,my)2d_{m_{x},m_{y}}=\left\|\left(x,y,z\right),{\bf{q}}_{\rm{R}}\left(m_{x},m_{y}\right)\right\|_{2} and zz is assumed to be fixed and known.

A codebook design for hybrid cascaded channel models should cover not only the angular region of all possible signals, but their distances as well. Therefore, based on the received signal model given in (27), the codebook for hybrid cascaded channel models should be designed to include the following two components.

III-C1 Angular-domain sweeping, similar to FFC

To align the phase on the FFC side, the full angular range will be covered in the predesigned codebook. Therefore, the first component of the RIS codebook for hybrid cascaded channel models is given by

Hb1=[𝐛(β1,δ1),,𝐛(βmx,δmy),,𝐛(βMx,δMy)],\begin{array}[]{l}{\cal{F}}_{\rm{Hb}}^{1}=\Big{[}{\bf{b}}\left(\beta_{1},\delta_{1}\right),\cdots,{\bf{b}}\left(\beta_{m_{x}},\delta_{m_{y}}\right),\cdots,{\bf{b}}\left(\beta_{M_{x}},\delta_{M_{y}}\right)\Big{]}^{*},\end{array} (30)

where βmx=2mxMx1Mx\beta_{m_{x}}=\frac{2{m_{x}}-{M_{x}}-1}{M_{x}} with mx=1,,Mx{m_{x}}=1,\cdots,{M_{x}}, δmy=2myMy1My\delta_{m_{y}}=\frac{2{m_{y}}-{M_{y}}-1}{M_{y}} with my=1,,My{m_{y}}=1,\cdots,{M_{y}}.

III-C2 Distance-domain sampling, similar to NFC

For each given angle pair β\beta and δ\delta, all possible sampling points in the feasible range should be included to align the phase on the NFC side. Therefore, the second component of the RIS codebook for hybrid cascaded channel models is given by

Hb2,k=[𝒇(x1k,y1k),,𝒇(xsxk,ysyk),,𝒇(xSxk,ySyk)],\begin{array}[]{l}{\cal{F}}_{\rm{Hb}}^{2,k}=\Big{[}{\bm{f}}\left(x_{1}^{k},y_{1}^{k}\right),\cdots,{\bm{f}}\left(x_{s_{x}}^{k},y_{s_{y}}^{k}\right),\cdots,{\bm{f}}\left(x_{S_{x}}^{k},y_{S_{y}}^{k}\right)\Big{]}^{*},\end{array} (31)

where xsxkx_{s_{x}}^{k} and ysxky_{s_{x}}^{k}, k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\}, are defined as in (26). In particular, k=Bk={\rm{B}} for the NF case, and k=Uk={\rm{U}} for the FN case.

Accordingly, the codebook at the RIS for hybrid cascaded channel models can be designed as

NF=Hb1Hb2,B,{\cal{F}}_{\rm{NF}}={\cal{F}}_{\rm{Hb}}^{1}\star{\cal{F}}_{\rm{Hb}}^{2,{\rm{B}}}, (32a)
FN=Hb1Hb2,U,{\cal{F}}_{\rm{FN}}={\cal{F}}_{\rm{Hb}}^{1}\star{\cal{F}}_{\rm{Hb}}^{2,{\rm{U}}}, (32b)

where the definition of \star is given in (24).

IV AO-based Algorithm for Maximizing Rate

We aim to maximize the achievable rate by jointly optimizing the combining matrix 𝐔\bf{U} at the user, the digital beamforming matrix 𝐖{\bf{W}} at the BS, and the reflecting coefficient matrix 𝚯{\bf{\Theta}} at the RIS. Suppose each passive beamforming vector at the RIS is selected from the predesigned codebooks. Therefore, the mathematical form of the optimization problem can be given as

(P)\displaystyle({\rm{P}})\; max𝐖,ϕR(𝐖,diag(ϕ)),\displaystyle\max\limits_{\bf{W},{\bm{\phi}}}R\left({\bf{W}},{\rm diag}\left({\bm{\phi}}\right)\right), (33a)
s.t.\displaystyle s.t.\; 𝐖F2Pmax,\displaystyle\left\|{\bf{W}}\right\|_{F}^{2}\leq P_{\max}, (33b)
ϕ,\displaystyle{\bm{\phi}}\in{\cal{F}}, (33c)

where {FF,NF,FN,NN}{\cal{F}}\in\left\{{\cal{F}}_{\rm{FF}},{\cal{F}}_{\rm{NF}},{\cal{F}}_{\rm{FN}},{\cal{F}}_{\rm{NN}}\right\} in (33c) is the predesigned codebook based on the specific channel model.

To handle the highly-coupled non-convex problem in (33), we propose an alternating optimization algorithm in this section, where three sub-problems will be solved in an iterative manner. First, based on the predesigned codebooks, different beam training schemes will be proposed to perform the channel estimation and the RIS optimization for the specific channel models. Second, a closed-form solution for the receive combining matrix at the user is obtained. Finally, the active beamforming problem is solved by exploiting the relationship between the achievable rate and the mean square error using convex optimization. Details for solving these sub-problems are given in the following subsections.

IV-A Beam Training Design for RIS

IV-A1 Angular-domain Beam Sweeping for FF

The most direct method to perform beam training for this case is sweeping through all possible angles if the resulting training overhead is acceptable. The size of the FF codebook in (20) depends on the number of RIS reflecting elements. Based on the given angle pair βmx,δmy\left\langle{\beta_{m_{x}},\delta_{m_{y}}}\right\rangle, the corresponding codeword is 𝐛(βmx,δmy){{\bf{b}}}\left({\beta_{m_{x}},\delta_{m_{y}}}\right), and the achievable rate can be calculated as

R(𝐖,diag(𝐛(βmx,δmy))),R\left({\bf{W}},{\rm diag}\left({{\bf{b}}}\left({\beta_{m_{x}},\delta_{m_{y}}}\right)\right)\right), (34)

with given beamforming matrix 𝐖{\bf{W}}. The optimal codeword is selected as the one that yields the maximum rate after sweeping through all candidate codewords in (20).

IV-A2 Hierarchical Beam Training Scheme for NN

From (25) and (26), we see that the NN codebook size is determined by the number of sampled points on the xx-axis and yy-axis. The beam training overhead can be reduced by reducing the codebook size (i.e., increasing the step size between the codebook samples), but this will reduce the performance of the beam training. In order to solve this problem, we design a hierarchical beam training approach that consists of several different levels of sub-codebooks. These sub-codebook levels are determined using different sampling ranges and sampling step sizes.

Refer to caption
Figure 2: Illustration for the proposed hierarchical beam training procedure.

As illustrated in Fig. 2, we divide the sampling range parallel to the XY-plane into four sub-ranges in each layer, and find the range corresponding to the optimal codeword as the sampling range of the next layer. More particularly, in the ll-th layer, the rectangular sampling range defined by the coordinate pairs (xmink,ymink)\left(x^{k}_{\min},y^{k}_{\min}\right) and (xmaxk,ymaxk)\left(x^{k}_{\max},y^{k}_{\max}\right), k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\}, is divided into the following four sub-ranges:

1)\displaystyle 1)\; (xmink,ymink),(xmink+xΔ,ymink+yΔ),\displaystyle\left(x^{k}_{\min},y^{k}_{\min}\right),\;\left(x^{k}_{\min}+x_{\Delta},y^{k}_{\min}+y_{\Delta}\right), (35a)
2)\displaystyle 2)\; (xmink+xΔ,ymink),(xmaxk,ymink+yΔ),\displaystyle\left(x^{k}_{\min}+x_{\Delta},y^{k}_{\min}\right),\;\left(x^{k}_{\max},y^{k}_{\min}+y_{\Delta}\right), (35b)
3)\displaystyle 3)\; (xmink+xΔ,ymink+yΔ),(xmaxk,ymaxk),\displaystyle\left(x^{k}_{\min}+x_{\Delta},y^{k}_{\min}+y_{\Delta}\right),\;\left(x^{k}_{\max},y^{k}_{\max}\right), (35c)
4)\displaystyle 4)\; (xmink,ymink+yΔ),(xmink+xΔ,ymaxk),\displaystyle\left(x^{k}_{\min},y^{k}_{\min}+y_{\Delta}\right),\;\left(x^{k}_{\min}+x_{\Delta},y^{k}_{\max}\right), (35d)

where xΔ=12[xmaxkxmink]x_{\Delta}=\frac{1}{2}\left[x^{k}_{\max}-x^{k}_{\min}\right] and yΔ=12[ymaxkymink]y_{\Delta}=\frac{1}{2}\left[y^{k}_{\max}-y^{k}_{\min}\right]. Therefore, the sub-codebook for sub-range ii of B{\rm{B}} and sub-range jj of U{\rm{U}} in the ll-th layer, denoted by NN(l,i,j),i,j=1,2,3,4{\cal{F}}_{\rm{NN}}\left(l,i,j\right),i,j=1,2,3,4, can be generated based on (25). Each column in NN(l,i,j){\cal{F}}_{\rm{NN}}\left(l,i,j\right) corresponds to a codeword ϕl,i,j,s{\bm{\phi}}_{l,i,j,s}, with ss denoting the column index in sub-codebook NN(l,i,j){\cal{F}}_{\rm{NN}}\left(l,i,j\right). Based on the given beamforming matrix 𝐖{\bf{W}} and codeword ϕl,i,j,s{\bm{\phi}}_{l,i,j,s}, the achievable rate can be calculated as

R(𝐖,diag(ϕl,i,j,s)).R\left({\bf{W}},{\rm{diag}}\left({\bm{\phi}}_{l,i,j,s}\right)\right). (36)

By adopting the ES method, the optimal codeword can be obtained for the first layer, as well as the optimal sampling sub-range pair i,j\left\langle i,j\right\rangle, which will be the sampling range in the next layer. This process is repeated until the maximum number of layers LL is reached.

Algorithm 1 Hierarchical Beam Training Scheme for NN
0:  sampling range x(y)min(max)kx(y)^{k}_{\min(\max)}, k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\}, number of sampled points in each layer SxS_{x} and SyS_{y}, maximum layer LmaxL_{\max}.
0:  𝚯opt{\bf{\Theta}}_{\rm{opt}}, RoptR_{\rm{opt}}.
1:  Initialization: l=1l=1, x(y)min(max)k(l)=x(y)min(max)kx(y)^{k}_{\min(\max)}\left(l\right)=x(y)^{k}_{\min(\max)}, k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\}, Ropt=0R_{\rm{opt}}=0.
2:  repeat
3:     Divide the sampling ranges corresponding to both the BS and the user into four sub-ranges according to (35);
4:     Generate sub-codebooks NN(l,i,j),i,j=1,2,3,4{\cal{F}}_{\rm{NN}}\left(l,i,j\right),i,j=1,2,3,4, based on (25), where ii is the sampling sub-range index for B{\rm{B}} and jj is the sampling sub-range index for U{\rm{U}};
5:     Calculate R(𝐖,𝚯)R\left({\bf{W}},{\bf{\Theta}}\right) for each codeword;
6:     Find the maximum R(𝐖,𝚯)R\left({\bf{W}},{\bf{\Theta}}\right), the corresponding codeword 𝚯opt{\bf{\Theta}}_{\rm{opt}}, and the corresponding optimal sampling sub-range index pair i,j\left\langle i,j\right\rangle;
7:     Update x(y)min(max)B(l+1)=x(y)min(max)B(l,i)x(y)^{\rm{B}}_{\min(\max)}\left(l+1\right)=x(y)^{\rm{B}}_{\min(\max)}\left(l,i\right);
8:     Update x(y)min(max)U(l+1)=x(y)min(max)U(l,j)x(y)^{\rm{U}}_{\min(\max)}\left(l+1\right)=x(y)^{\rm{U}}_{\min(\max)}\left(l,j\right);
9:     ll+1l\leftarrow l+1;
10:  until l=Lmaxl=L_{\max}.

The hierarchical beam training procedure is summarized in Algorithm 1. We define the size of the codebook as the number of candidate codewords, i.e., the number of column vectors. There are 16 sub-codebooks in each layer, and the size of each sub-codebook is (SxSy)2\left(S_{x}S_{y}\right)^{2}. Therefore, with a given maximum number of training layers LL, the training overhead can be calculated as 16L(SxSy)216L\left(S_{x}S_{y}\right)^{2}. For the same sampling grid resolution and hence beam training accuracy, the training overhead of ES will be 4L+1(SxSy)24^{L+1}\left(S_{x}S_{y}\right)^{2}.

IV-A3 Two-Stage Beam Training Scheme for FN and NF

The size of codebooks NF{\cal{F}}_{\rm{NF}} and FN{\cal{F}}_{\rm{FN}} is determined by the product of the number of RIS elements and the number of sample points, which can be extremely large especially for large RISs. Thus, while ES is a straightforward way to find the optimal codeword from the predefined codebooks, the training overhead and consumed time can be unacceptable. We therefore propose a two-stage beam training scheme for the FN and NF channel models. Specifically, all candidate angles are swept through in stage one, and the distance is determined in stage two based on the selected direction. The details are given as follows.

Stage 1 Angular-domain beam sweeping: In the first stage, we aim to find the optimal beamforming angle based on the far-field codebook given in (20), with the objective of maximizing the achievable rate in (17). All sampled angles will be swept through in this stage, and the one yielding the maximum achievable rate will be selected. Therefore, the selected indices in the angular-domain sweeping stage can be expressed mathematically as

mx,myopt=argmax{𝐛(βmx,δmy)FF|R(𝐖,𝚯mx,my)},\begin{array}[]{l}\;\;\;\;\left\langle m_{x},m_{y}\right\rangle_{\rm{opt}}\\ ={\rm{argmax}}\Big{\{}{{\bf{b}}}\left({\beta_{m_{x}},\delta_{m_{y}}}\right)\in{\cal{F}}_{\rm{FF}}\left|R\left({\bf{W}},{\bf{\Theta}}_{{m_{x},m_{y}}}\right)\right.\Big{\}},\end{array} (37)

where 𝚯mx,my=diag(𝐛(βmx,δmy)){\bf{\Theta}}_{{m_{x},m_{y}}}={\rm diag}\left({{\bf{b}}}\left({\beta_{m_{x}},\delta_{m_{y}}}\right)\right). Denote the optimal index pair as mx,my\left\langle m^{\prime}_{x},m^{\prime}_{y}\right\rangle.

Stage 2 Distance-domain sampling: In NFC, the beam can be designed to point at a particular location, rather than just a specific angle. Thus, in the second stage, we aim to determine the optimal focusing point for the optimal direction. With a given angle pair mx,my\left\langle m^{\prime}_{x},m^{\prime}_{y}\right\rangle, the selected sampling point in the distance domain can be determined by

xsxk,ysykopt=argmax{(xsxk,ysyk)𝒟k|R(𝐖,𝚯xsxk,ysyk)},\begin{array}[]{l}\;\;\;\;\left\langle x_{s_{x}}^{k},y_{s_{y}}^{k}\right\rangle_{\rm{opt}}\\ ={\rm{argmax}}\left\{\left(x_{s_{x}}^{k},y_{s_{y}}^{k}\right)\in{\cal{D}}_{k}\left|R\left({\bf{W}},{\bf{\Theta}}_{x_{s_{x}}^{k},y_{s_{y}}^{k}}\right)\right.\right\},\end{array} (38)

where 𝒟k{\cal{D}}_{k} lies in the sampling range for kk, k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\}, and 𝚯xsxk,ysyk=diag(𝐜(xsxk,ysyk,βmx,δmy)){\bf{\Theta}}_{x_{s_{x}}^{k},y_{s_{y}}^{k}}={\rm diag}\left({{\bf{c}}}\left(x_{s_{x}}^{k},y_{s_{y}}^{k},\beta_{m^{\prime}_{x}},\delta_{m^{\prime}_{y}}\right)\right).

Similar to the analysis in Section IV-A2, we adopt a hierarchical beam training scheme in this stage to strike a balance between the training overhead and accuracy. Thus, the two-stage beam training procedure is summarized in Algorithm 2. The overhead of the proposed two-stage beam training scheme is M+4LSxSyM+4L{S_{x}}{S_{y}}, while that of the ES method is M×4LSxSyM\times 4L{S_{x}}{S_{y}}.

Remark 4.

The proposed beam training algorithms can be easily extended to scenarios with multiple users by dividing the RIS into multiple sub-surfaces, where each sub-surface implements the proposed beam training schemes to realize beam alignment for each user.

Algorithm 2 Two-Stage Beam Training Scheme for Hybrid Cascaded Channel Models
0:  MxM_{x}, MyM_{y}, sampling range x(y)min(max)kx(y)^{k}_{\min(\max)}, k{B,U}k\in\left\{{\rm{B}},{\rm{U}}\right\}, number of sampled points in each layer SxS_{x} and SyS_{y}, maximum layer LmaxL_{\max}.
0:  𝚯opt{\bf{\Theta}}_{\rm{opt}}, RoptR_{\rm{opt}}.
1:  Initialization: mx=1m_{x}=1, my=1m_{y}=1, Ropt=0R_{\rm{opt}}=0.
2:  Stage 1:
3:  Generate sub-codebook Hb1{\cal{F}}_{\rm{Hb}}^{1} based on (30);
4:  repeat
5:     repeat
6:        if R(𝐖,𝚯mx,my)>RoptR\left({\bf{W}},{\bf{\Theta}}_{{m_{x},m_{y}}}\right)>R_{\rm{opt}} then
7:           Ropt=R(𝐖,𝚯mx,my)R_{\rm{opt}}=R\left({\bf{W}},{\bf{\Theta}}_{{m_{x},m_{y}}}\right);
8:           mx,myopt=mx,my\left\langle m_{x},m_{y}\right\rangle_{\rm{opt}}=\left\langle{{m_{x}},{m_{y}}}\right\rangle;
9:        end if
10:        mxmx+1m_{x}\leftarrow m_{x}+1;
11:     until mx=Mxm_{x}=M_{x};
12:     mymy+1m_{y}\leftarrow m_{y}+1.
13:  until my=Mym_{y}=M_{y};
14:  Stage 2:
15:  repeat
16:     Divide the sampling ranges corresponding to the BS (NF Case) or the user (FN Case) into four sub-ranges according to (35);
17:     Generate sub-codebooks Hy2(l,i),i=1,2,3,4{\cal{F}}_{\rm{Hy}}^{2}\left(l,i\right),i=1,2,3,4, based on (31), where ii is the sampling sub-range index for B{\rm{B}} (NF Case) or U{\rm{U}} (FN Case);
18:     Generate NF/FN={Hb1}mx,myoptHb2,k{\cal{F}}_{{\rm{NF}}/{\rm{FN}}}={\left\{{\cal{F}}_{\rm{Hb}}^{1}\right\}}_{\left\langle m_{x},m_{y}\right\rangle_{\rm{opt}}}\star{\cal{F}}_{\rm{Hb}}^{2,k};
19:     Calculate R(𝐖,𝚯xsxk,ysyk)R\left({\bf{W}},{\bf{\Theta}}_{x_{s_{x}}^{k},y_{s_{y}}^{k}}\right) for each codeword;
20:     Find the maximum R(𝐖,𝚯xsxk,ysyk)R\left({\bf{W}},{\bf{\Theta}}_{x_{s_{x}}^{k},y_{s_{y}}^{k}}\right), the corresponding codeword 𝚯opt{\bf{\Theta}}_{\rm{opt}}, and the corresponding optimal sampling sub-range index ii;
21:     Update x(y)min(max)k(l+1)=x(y)min(max)k(l,i)x(y)^{k}_{\min(\max)}\left(l+1\right)=x(y)^{k}_{\min(\max)}\left(l,i\right);
22:     ll+1l\leftarrow l+1;
23:  until l=Lmaxl=L_{\max}.

IV-B Closed-form Solution for 𝐔\bf{U}

With the estimated channel information acquired through the beam training, we can perform the BS beamforming and the user combining design. Although the combining matrix 𝐔\bf{U} is not present in the objective function (17), it will have an impact on the BS beamforming design and the achievable rate. Therefore, we derive the optimal combining matrix 𝐔\bf{U} at the user below. The principle of combining matrix design is to recover the original transmitted signals, which can be transformed into a mean square error (MSE) minimization problem. The MSE matrix of the user is given by

𝐄=𝔼[(𝐲𝐱)(𝐲𝐱)H]=(𝐔H𝐇𝐖𝐈q)(𝐔H𝐇𝐖𝐈q)H+σ2𝐔H𝐔,\begin{array}[]{l}{\bf{E}}={\mathbb{E}}\left[\left({\bf{y}}-{\bf{x}}\right)\left({\bf{y}}-{\bf{x}}\right)^{H}\right]\\ \;\;=\left({\bf{U}}^{H}{\bf{H}}{\bf{W}}-{\bf{I}}_{q}\right)\left({\bf{U}}^{H}{\bf{H}}{\bf{W}}-{\bf{I}}_{q}\right)^{H}+\sigma^{2}{\bf{U}}^{H}{\bf{U}},\end{array} (39)

and thus the mathematical form of the combining matrix optimization problem can be written as

(P1)min𝐔Tr(𝐄).({\rm{P1}})\;\min\limits_{\bf{U}}{\rm{Tr}}\left({\bf{E}}\right). (40)

With given 𝐖\bf{W} and 𝚯{\bf{\Theta}}, the optimal solution 𝐔{\bf{U}} of problem (40) can be obtained by solving Tr(𝐄)/𝐔=𝟎{\partial{\rm{Tr}}\left({\bf{E}}\right)}/{\partial{\bf{U}}}={\bf{0}}. After some simple derivations, the optimal combining matrix 𝐔{\bf{U}} is found to be

𝐔opt=(𝐇𝐖𝐖H𝐇H+σ2𝐈NU)1𝐇𝐖,{\bf{U}}_{\rm{opt}}=\left({\bf{H}}{\bf{W}}{\bf{W}}^{H}{\bf{H}}^{H}+\sigma^{2}{\bf{I}}_{N_{\rm{U}}}\right)^{-1}{\bf{H}}{\bf{W}}, (41)

which is necessary for the optimal value of 𝐖{\bf{W}} to achieve the maximum of (17).

IV-C Active Beamforming Matrix Optimization

To solve the transmit beamforming optimization problem, we introduce an auxiliary matrix 𝐅0{\bf{F}}\succeq 0, and reformulate the original optimization as follows by exploiting the relationship between the achievable rate and the MSE [37]

(P)max𝐅,𝐖,ϕf(𝐅,𝐖,ϕ),s.t.(33b),(33c),\begin{array}[]{l}({\rm{P^{\prime}}})\;\max\limits_{{\bf{F}},\bf{W},{\bm{\phi}}}f\left({\bf{F}},{\bf{W}},{\bm{\phi}}\right),\\ s.t.\;\;(\ref{P_max}),(\ref{CodebookConstraint}),\end{array} (42)

where f(𝐅,𝐖,ϕ)f\left({\bf{F}},{\bf{W}},{\bm{\phi}}\right) is given by

f(𝐅,𝐖,ϕ)=log|𝐅|Tr(𝐅𝐄).f\left({\bf{F}},{\bf{W}},{\bm{\phi}}\right)=\log\left|{\bf{F}}\right|-{\rm{Tr}}\left({\bf{F}}{\bf{E}}\right). (43)

The optimal 𝐅{\bf{F}} of problem (42) can be obtained by solving f/𝐅=𝟎{\partial f}/{\partial{\bf{F}}}={\bf{0}}, which is given by 𝐅=𝐄1{\bf{F}}={\bf{E}}^{-1}. With given 𝐅{\bf{F}}, 𝐔{\bf{U}} and ϕ{\bm{\phi}}, the beamforming optimization problem can be expressed by substituting 𝐄{\bf{E}} into (43) and removing the constant terms:

(P2)min𝐖Tr(𝐖H𝐇H𝐔𝐅𝐔H𝐇𝐖)2Tr((𝐅𝐔H𝐇𝐖))s.t.(33b),\begin{array}[]{l}({\rm{P2}})\;\min\limits_{\bf{W}}{\rm{Tr}}\left({\bf{W}}^{H}{\bf{H}}^{H}{\bf{U}}{\bf{F}}{\bf{U}}^{H}{\bf{H}}{\bf{W}}\right)-2{\rm{Tr}}\left(\Re\left({\bf{F}}{\bf{U}}^{H}{\bf{H}}{\bf{W}}\right)\right)\\ s.t.\;\;(\ref{P_max}),\end{array} (44)

which is a convex optimization problem and its optimal solution can be obtained using standard methods.

IV-D Overall Algorithm

The overall alternating optimization algorithm for maximizing the achievable rate is summarized in Algorithm 3, where the optimal solutions in each iteration are the inputs for the next iteration. First, with given 𝐔(t){{\bf{U}}^{\left(t\right)}} and 𝚯(t){{\bf{\Theta}}^{\left(t\right)}} at the tt-th iteration, the optimal 𝚯(t+1){{\bf{\Theta}}^{\left({t+1}\right)}} can be obtained by carrying out the beam training scheme based on Algorithm 2 or Algorithm 1. The estimated channel information can also be obtained in this step. Then, with given 𝚯(t+1){{\bf{\Theta}}^{\left(t+1\right)}} and 𝐖(t){{\bf{W}}^{\left(t\right)}}, we calculate and update the combining matrix 𝐔(t+1){{\bf{U}}^{\left({t+1}\right)}} according to (41). Although 𝐔{\bf{U}} is not included in the expression of the objective function in (17), it will serve as input for the next step in solving 𝐖{{\bf{W}}}. Last, with given 𝐔(t+1){{\bf{U}}^{\left({t+1}\right)}}, 𝚯(t+1){{\bf{\Theta}}^{\left(t+1\right)}} and 𝐖(t){{\bf{W}}^{\left(t\right)}}, we first obtain the reformulated objective function by substituting 𝐄(t){\bf{E}}^{\left({t}\right)} in (39) into (43), and then obtain the optimized beamforming matrix 𝐖(t+1){{\bf{W}}^{\left({t+1}\right)}} by solving problem (44). This process is repeated until a maximum number of iterations is reached or the convergence condition is satisfied. The proposed algorithm is summarized in Fig. 3.

Refer to caption
Figure 3: Illustration for the proposed algorithm.

The computational complexity of the beam training mainly comes from sorting, which requires 𝒪(M){\cal O}\left(M\right) operations for angular-domain beam sweeping, 𝒪(16L(SxSy)2){\cal O}\left(16L\left(S_{x}S_{y}\right)^{2}\right) operations for the hierarchical beam training scheme, and 𝒪(M+4LSxSy){\cal O}\left(M+4L{S_{x}}{S_{y}}\right) operations for the two-stage beam training algorithm. Solving problem (P1){\left({\rm{P1}}\right)} for the combining matrix involves matrix inversion, leading to a computational complexity of 𝒪(NU3){\cal O}\left(N_{\rm{U}}^{3}\right) [38]. According to [39], the worst-case complexity for solving problem (P2){\left({\rm{P2}}\right)} is 𝒪(q3NB3){\cal O}\left(q^{3}N_{\rm{B}}^{3}\right) using efficient interior-point methods. Thus, the overall computational complexity of the proposed algorithm is 𝒪(I3(M+q3NB3+NU3)){\cal O}\left(I_{3}\left(M+q^{3}N_{\rm{B}}^{3}+N_{\rm{U}}^{3}\right)\right) for FF with angular-domain beam sweeping, 𝒪(I3(16L(SxSy+q3NB3+NU3))){\cal O}\left(I_{3}\left(16L\left(S_{x}S_{y}+q^{3}N_{\rm{B}}^{3}+N_{\rm{U}}^{3}\right)\right)\right) for NN with hierarchical beam training, and 𝒪(I3(M+4LSxSy+q3NB3+NU3)){\cal O}\left(I_{3}\left(M+4L{S_{x}}{S_{y}}+q^{3}N_{\rm{B}}^{3}+N_{\rm{U}}^{3}\right)\right) for NF and FN with two-stage beam training, with I3I_{3} representing the number of iterations required for the convergence of Algorithm 3.

Algorithm 3 Alternating Optimization-based Algorithm for Maximizing Achievable Rate
0:  R(𝐖,𝚯)R\left({\bf{W}},{\bf{\Theta}}\right), maximum iteration times T{T}, convergence threshold ζ{\zeta}.
0:  𝐔opt{{\bf{U}}_{\rm{opt}}}, 𝚯opt{{\bf{\Theta}}_{\rm{opt}}}, 𝐖opt{{\bf{W}}_{\rm{opt}}}.
1:  Initialization: t=0t=0, 𝐔(t){{\bf{U}}^{\left(t\right)}}, 𝚯(t){{\bf{\Theta}}^{\left(t\right)}}, 𝐖(t){{\bf{W}}^{\left(t\right)}}, R(t)(𝐖,𝚯)R^{\left({t}\right)}\left({\bf{W}},{\bf{\Theta}}\right).
2:  while  tTt\leq T and Γζ\Gamma\geq\zeta  do
3:     For given 𝐔(t){{\bf{U}}^{\left({t}\right)}} and 𝐖(t){{\bf{W}}^{\left({t}\right)}}, perform beam training based on Algorithm 2 or Algorithm 1, and obtain 𝚯(t+1){{\bf{\Theta}}^{\left({t+1}\right)}};
4:     For given 𝚯(t+1){{\bf{\Theta}}^{\left(t+1\right)}} and 𝐖(t){{\bf{W}}^{\left(t\right)}}, calculate and update 𝐔(t+1){{\bf{U}}^{\left({t+1}\right)}} according to (41);
5:     For given 𝐔(t+1){{\bf{U}}^{\left({t+1}\right)}}, 𝚯(t+1){{\bf{\Theta}}^{\left(t+1\right)}} and 𝐖(t){{\bf{W}}^{\left(t\right)}}, update 𝐖(t+1){{\bf{W}}^{\left({t+1}\right)}} by solving problem (44);
6:     Calculate R(𝐖(t+1),𝚯(t+1)){R\left({\bf{W}}^{\left({t+1}\right)},{\bf{\Theta}}^{\left({t+1}\right)}\right)};
7:     Calculate Γ=|R(𝐖(t+1),𝚯(t+1))R(𝐖(t),𝚯(t))||R(𝐖(t),𝚯(t))|\Gamma=\frac{{\left|R\left({\bf{W}}^{\left({t+1}\right)},{\bf{\Theta}}^{\left({t+1}\right)}\right)-R\left({\bf{W}}^{\left({t}\right)},{\bf{\Theta}}^{\left({t}\right)}\right)\right|}}{{\left|R\left({\bf{W}}^{\left({t}\right)},{\bf{\Theta}}^{\left({t}\right)}\right)\right|}};
8:     tt+1t\leftarrow t+1;
9:  end while

V Numerical Results

Numerical results are provided in this section to validate the effectiveness of our proposed approach. The simulation configurations listed in TABLE II are used unless stated otherwise. The following parameter settings were used when executing the beam training schemes for both the hierarchical beam training algorithm for the NN channel model and the second beam training stage for hybrid cascaded channel models. For hierarchical beam training, the sampled range in each direction is set as [1000λc,1000λc]\left[-1000\lambda_{c},1000\lambda_{c}\right]. For example, denote the coordinate of the BS antenna midpoint as (xBS,yBS,zBS)\left(x_{\rm{BS}},y_{\rm{BS}},z_{\rm{BS}}\right), where zBSz_{\rm{BS}} is fixed. The sampled ranges of the BS in the xx- and yy-directions are [xBS1000λc,xBS+1000λc]\left[x_{\rm{BS}}-1000\lambda_{c},x_{\rm{BS}}+1000\lambda_{c}\right] and [yBS1000λc,yBS+1000λc]\left[y_{\rm{BS}}-1000\lambda_{c},y_{\rm{BS}}+1000\lambda_{c}\right], respectively. The same applies to the sampled ranges of the user. The numbers of sampled points for hierarchical beam training in the xx- and yy-directions are both set as Sx=Sy=2S_{x}=S_{y}=2. The simulation results are obtained by averaging over 500 channel realizations.

TABLE II: Simulation Configurations
Parameter Value
Carrier frequency 30Ghz
Noise power -105dBm
Power budget at the BS 30 dBm
BS’s coordinate (0,0,0)\left(0,0,0\right)m
User’s coordinate (24,0,0)\left(24,0,0\right)m
RIS’s coordinate (10,0,8)\left(10,0,8\right)m
Number of BS antennas 16
Number of user antennas 8
Number of RIS elements along xx/yy-axis 60, 2
Antenna spacing λc/2\lambda_{c}/2
Number of NLoS channels for far-field region 2
Refer to caption
Figure 4: Achievable rate vs. training layers of hierarchical beam training scheme.

To determine the number of training layers of the hierarchical beam training scheme, we show the relationship between the achievable rate and the number of training layers in Fig. 4. It can be seen that when Lmax12L_{\max}\geq 12, the achievable rate no longer increases with LmaxL_{\max}. Although the achievable rate only improves slightly from Lmax=2L_{\max}=2 to Lmax=12L_{\max}=12, we set the total number of training layers hereafter as Lmax=12L_{\max}=12 for better performance. Also, we depict the achievable rate obtained by the ES approach when the number of sampled points is set as 8 and 16 in each direction. The size of the NFC codebook is (SxSy)2\left(S_{x}S_{y}\right)^{2}, so it can be extremely large for large SxS_{x} and SyS_{y}. Thus, we only considered two scenarios with small SxS_{x} and SyS_{y} to compare the performance between the proposed hierarchical beam training and ES approaches. Note that we divide the whole sampling range into two sub-ranges in each direction, so there are 4 sampled points in each direction when Sx=Sy=2S_{x}=S_{y}=2 for hierarchical beam training. Therefore, the proposed hierarchical algorithm achieves the same accuracy as ES with Sx=Sy=8S_{x}=S_{y}=8 when the number of training layers is 2, and it is also the same for Sx=Sy=16S_{x}=S_{y}=16 when the number of training layers is 3, which verifies the effectiveness of our proposed approach which has significantly reduced training costs.

Refer to caption
Figure 5: Beam training overhead vs. sampling step size in multiples of dd.

The required beam training overhead of various training algorithms for different sampling step sizes is compared in Fig. 5. For NN channel modeling, the proposed hierarchical near-field beam training approach greatly reduces the training overhead compared to ES beam training, especially when the sampling step size is small. When the step size is 160dd, the overhead of the hierarchical beam training approach is only about 2% of that required for ES. When the step size is 500dd, these two schemes have the same training overhead, and the required number of training layers for hierarchical beam training is 1. For hybrid FFC & NFC channel models, hierarchical beam training always requires less overhead than ES, regardless of the sampling step size.

Refer to caption
Figure 6: Convergence performance of the proposed algorithm.

The convergence performance of the proposed AO-based algorithm is shown in Fig. 6. Based on the simulation parameters provided earlier, we can calculate that both the BS-RIS and RIS-user links are within the near-field region. Since the NN channel model with hierarchical beam training is more accurate since it considers both angular and distance information of the cascaded links, it will provide a higher achievable rate. Even though the NN channel model is adopted, the performance obtained with angular-domain beam training is poor, because distance information is not considered. The FF channel model has the worst performance due to the accumulative channel estimation error of links on both sides of the RIS. Furthermore, it can be seen that the achievable rate for the NF channel model is higher than that for FN, which is due to the fact that: 1) the BS and RIS are closer together than the RIS and user, and 2) the BS has more antennas than the user. Thus, it is more critical for the BS-RIS link to adopt the near-field channel model to realize phase alignment.

Refer to caption
Figure 7: Normalized received signal strength.

For the NN channel model, the normalized received signal strength is depicted in Fig. 7. We can see that the maximum received power appears at coordinate (24, 0), which is exactly where the user is located. Since the user’s antennas are distributed parallel to the xx-axis, the received signal strength is also dispersed along the xx-axis. Moreover, the RIS reflecting elements are more distributed along the xx-axis direction, which will also lead to such a distribution of reflected signals. Unlike FFC, NFC can achieve beam focusing, concentrating the energy of the beam at a specific location.

Refer to caption
Figure 8: Achievable rate vs. RIS location on zz-axis.

Fig. 8 shows the achievable rate as the RIS is located at different points in the zz-direction. Note that the zz coordinates of both the BS and the user are 0. For smaller zz values, the closer the RIS is to the BS and user, the more obvious the near-field effect. Therefore, the performance gain of adopting NN channel models and hierarchical beam training is more significant with smaller zz, and the results are consistent with that in Fig. 6 when z=8z=8. Moreover, as the distance between the RIS and BS and the user gradually increases, the performance gap due to different channel models and beam training methods gradually decreases, which also verifies that the near-field channel can be approximated as the far-field channel when the distance is large enough.

Refer to caption
Figure 9: Achievable rate vs. RIS location on xx-axis.

The achievable rate obtained for different RIS locations along the xx-direction is depicted in Fig. 9. It is not difficult to see that the NN channel model with hierarchical beam training always has the highest rate, regardless of the RIS location. In addition, for the NN channel model, a peak appears on both the BS and user side, which is consistent with the conclusions for FFC. Due to the larger number of antennas at the BS compared to the user, better transmission performance is obtained by deploying the RIS on the side near the BS. For the NF channel model, the maximum achievable rate is obtained with the RIS near the BS, due to the more obvious near-field effect of the BS-RIS link. As the RIS moves away from the BS, the achievable rate decreases, although this degradation in rate slows near the user’s location. For the FN channel model, in contrast to NF, the peak appears around the user. When adopting the NN channel model and angular beam training, a peak occurs only when the RIS is deployed at an equal distance between the BS and the user, which means that angular beam training for the NN model is only useful in restricted scenarios.

Refer to caption
Figure 10: Achievable rate vs. maximum transmission power at the BS.

In Fig. 10, we show the relationship between the achievable rate and the power budget at the BS. As expected, regardless of the channel model or beam training approach, the achievable rate increases with the BS power budget. In addition, for low BS power, NN with hierarchical beam training cannot fully leverage its advantages and has a lower achievable rate than NF and FN. As the power increases, the achievable rate of NN increases the fastest, and its performance advantages become increasingly pronounced compared to the other models. The rates achieved with the NF and FN channel models are nearly the same for all power levels, since the BS-RIS and RIS-user distances remain the same, and the same beam training methods are used for both.

Refer to caption
Figure 11: Achievable rate vs. number of RIS elements.

Fig. 11 shows the achievable rate for different numbers of RIS reflecting elements MM. The achievable rate for all channel model and beam training approaches increases with MM, due to the higher passive array gains that can be obtained from larger RIS. The NN channel model achieves the fastest increase in rate as MM increases since the near-field effect is greater for larger RISs, the NN model describes the channel more accurately, and the hierarchical beam training approach realizes a more effective beam focusing. When the number of RIS elements is large enough, the achievable rate obtained using the NN channel model with angular-domain beam training will be superior to that of the FF model, even if the beam training approach is not specifically designed for the NN model.

VI Conclusions

In this article, we considered four different channel models for a RIS-assisted downlink MIMO system. According to the angular or distance information embedded in the received signals under these specific channel models, we designed different codebooks to match the beam steering vectors for the RIS. Based on the predesigned codebooks, we proposed two beam training approaches, which were further used for RIS coefficient optimization. More specifically, for the NN channel model, we designed a distance-based codebook and proposed a hierarchical beam training algorithm to realize beam alignment while reducing the training overhead; for the NF and FN channel models, we designed a combined angular-distance codebook and proposed a two-stage beam training approach to separately realize beam alignment in the angular- and distance domains. To maximize the achievable rate, we proposed an AO-based algorithm to carry out the multi-resource optimization in an iterative manner. Numerical results show that the proposed beam training approaches can obtain achievable rate performance similar to the ES method, while significantly reducing the training overhead. Our results demonstrate that the use of distance in addition to angular information can effectively improve the system performance with near-field channels.

References

  • [1] I. F. Akyildiz, C. Han, and S. Nie, “Combating the distance problem in the millimeter wave and terahertz frequency bands,” IEEE Commun. Mag., vol. 56, no. 6, pp. 102–108, 2018.
  • [2] C. Castro, R. Elschner, T. Merkle, C. Schubert, and R. Freund, “Experimental demonstrations of high-capacity THz-wireless transmission systems for beyond 5G,” IEEE Commun. Mag., vol. 58, no. 11, pp. 41–47, 2020.
  • [3] K. M. S. Huq, J. Rodriguez, and I. E. Otung, “3D network modeling for THz-enabled ultra-fast dense networks: A 6G perspective,” IEEE Commun. Stand. Mag., vol. 5, no. 2, pp. 84–90, 2021.
  • [4] C. Lin, G. Y. Li, and L. Wang, “Subarray-based coordinated beamforming training for mmWave and sub-THz communications,” IEEE J. Sel. Areas Commun., vol. 35, no. 9, pp. 2115–2126, 2017.
  • [5] C. Pradhan, A. Li, L. Song, B. Vucetic, and Y. Li, “Hybrid precoding design for reconfigurable intelligent surface aided mmWave communication systems,” IEEE Wireless Commun. Lett., vol. 9, no. 7, pp. 1041–1045, 2020.
  • [6] C. Huang, Z. Yang, G. C. Alexandropoulos, K. Xiong, L. Wei, C. Yuen, Z. Zhang, and M. Debbah, “Multi-hop RIS-empowered terahertz communications: A DRL-based hybrid beamforming design,” IEEE J. Sel. Areas Commun., vol. 39, no. 6, pp. 1663–1677, 2021.
  • [7] M. Di Renzo, A. Zappone, M. Debbah, M.-S. Alouini, C. Yuen, J. de Rosny, and S. Tretyakov, “Smart radio environments empowered by reconfigurable intelligent surfaces: How it works, state of research, and the road ahead,” IEEE J. Sel. Areas Commun., vol. 38, no. 11, pp. 2450–2525, 2020.
  • [8] H. Lu and Y. Zeng, “Communicating with extremely large-scale array/surface: Unified modeling and performance analysis,” IEEE Trans. Wireless Commun., vol. 21, no. 6, pp. 4039–4053, 2022.
  • [9] H. Zhang, N. Shlezinger, F. Guidi, D. Dardari, M. F. Imani, and Y. C. Eldar, “Beam focusing for near-field multiuser MIMO communications,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 7476–7490, 2022.
  • [10] Y. Liu, Z. Wang, J. Xu, C. Ouyang, X. Mu, and R. Schober, “Near-field communications: A tutorial review,” arXiv preprint arXiv:2305.17751.
  • [11] Y. Jiang, F. Gao, M. Jian, S. Zhang, and W. Zhang, “Reconfigurable intelligent surface for near field communications: Beamforming and sensing,” IEEE Trans. Wireless Commun., vol. 22, no. 5, pp. 3447–3459, 2023.
  • [12] P. Mei, Y. Cai, K. Zhao, Z. Ying, G. F. Pedersen, X. Q. Lin, and S. Zhang, “On the study of reconfigurable intelligent surfaces in the near-field region,” IEEE Trans. Antennas Propag., vol. 70, no. 10, pp. 8718–8728, 2022.
  • [13] X. Zhang and H. Zhang, “Hybrid reconfigurable intelligent surfaces-assisted near-field localization,” IEEE Commun. Lett., vol. 27, no. 1, pp. 135–139, 2023.
  • [14] Q. Yang, R. He, and B. Ai, “SNR analysis for RIS-aided communication system in near- and far-fields,” in 2022 14th International Conference on Wireless Communications and Signal Processing (WCSP), 2022, pp. 1001–1006.
  • [15] J. Zhang, Y. Huang, Q. Shi, J. Wang, and L. Yang, “Codebook design for beam alignment in millimeter wave communication systems,” IEEE Trans. Commun., vol. 65, no. 11, pp. 4980–4995, 2017.
  • [16] C. Qi, K. Chen, O. A. Dobre, and G. Y. Li, “Hierarchical codebook-based multiuser beam training for millimeter wave massive MIMO,” IEEE Trans. Wireless Commun., vol. 19, no. 12, pp. 8142–8152, 2020.
  • [17] Y. Zhang, X. Wu, and C. You, “Fast near-field beam training for extremely large-scale array,” IEEE Wireless Commun. Lett., vol. 11, no. 12, pp. 2625–2629, 2022.
  • [18] P. Wang, J. Fang, W. Zhang, Z. Chen, H. Li, and W. Zhang, “Beam training and alignment for RIS-assisted millimeter-wave systems: State of the art and beyond,” IEEE Wireless Commun., vol. 29, no. 6, pp. 64–71, 2022.
  • [19] J. Wang, W. Tang, S. Jin, C.-K. Wen, X. Li, and X. Hou, “Hierarchical codebook-based beam training for RIS-assisted mmWave communication systems,” IEEE Trans. Commun., early access, 2023.
  • [20] W. Liu, C. Pan, H. Ren, F. Shu, S. Jin, and J. Wang, “Low-overhead beam training scheme for extremely large-scale RIS in near field,” IEEE Trans. Commun., early access, 2023.
  • [21] X. Wei and L. Dai, “Channel estimation for extremely large-scale massive MIMO: Far-field, near-field, or hybrid-field?” IEEE Commun. Lett., vol. 26, no. 1, pp. 177–181, 2022.
  • [22] Z. Hu, C. Chen, Y. Jin, L. Zhou, and Q. Wei, “Hybrid-field channel estimation for extremely large-scale massive MIMO system,” IEEE Commun. Lett., vol. 27, no. 1, pp. 303–307, 2023.
  • [23] M. Cui and L. Dai, “Channel estimation for extremely large-scale MIMO: Far-field or near-field?” IEEE Trans. Commun., vol. 70, no. 4, pp. 2663–2677, 2022.
  • [24] Z. Yuan, J. Zhang, Y. Ji, G. F. Pedersen, and W. Fan, “Spatial non-stationary near-field channel modeling and validation for massive MIMO systems,” IEEE Trans. Antennas Propag., vol. 71, no. 1, pp. 921–933, 2023.
  • [25] S.-G. Yoon and S. J. Lee, “Improved hierarchical codebook-based channel estimation for mmwave massive MIMO systems,” IEEE Wireless Commun. Lett., vol. 11, no. 10, pp. 2095–2099, 2022.
  • [26] C. Wu, C. You, Y. Liu, L. Chen, and S. Shi, “Two-stage hierarchical beam training for near-field communications,” arXiv preprint arXiv:2302.12511.
  • [27] Y. Zhang, B. Di, H. Zhang, M. Dong, L. Yang, and L. Song, “Dual codebook design for intelligent omni-surface aided communications,” IEEE Trans. Wireless Commun., vol. 21, no. 11, pp. 9232–9245, 2022.
  • [28] C. You, B. Zheng, and R. Zhang, “Fast beam training for IRS-assisted multiuser communications,” IEEE Wireless Commun. Lett., vol. 9, no. 11, pp. 1845–1849, 2020.
  • [29] D. Shen, L. Dai, X. Su, and S. Suo, “Multi-beam design for near-field extremely large-scale RIS-aided wireless communications,” IEEE Trans. Green Commun. Netw., early access, 2023.
  • [30] X. Wei, L. Dai, Y. Zhao, G. Yu, and X. Duan, “Codebook design and beam training for extremely large-scale RIS: Far-field or near-field?” China Commun., vol. 19, no. 6, pp. 193–204, 2022.
  • [31] D. De Donno, J. Palacios, and J. Widmer, “Millimeter-wave beam training acceleration through low-complexity hybrid transceivers,” IEEE Trans. Wireless Commun., vol. 16, no. 6, pp. 3646–3660, 2017.
  • [32] O. E. 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, March 2014.
  • [33] M. R. Akdeniz, Y. Liu, M. K. Samimi, S. Sun, S. Rangan, T. S. Rappaport, and E. Erkip, “Millimeter wave channel modeling and cellular capacity evaluation,” IEEE J. Sel. Areas Commun., vol. 32, no. 6, pp. 1164–1179, June 2014.
  • [34] X. Gao, L. Dai, S. Han, C.-L. I, and R. W. Heath, “Energy-efficient hybrid analog and digital precoding for mmWave MIMO systems with large antenna arrays,” IEEE J. Sel. Areas Commun., vol. 34, no. 4, pp. 998–1009, April 2016.
  • [35] C. Ouyang, Y. Liu, X. Zhang, and L. Hanzo, “Near-field communications: A degree-of-freedom perspective,” arXiv preprint arXiv:2308.00362.
  • [36] M. Cui, L. Dai, R. Schober, and L. Hanzo, “Near-field wideband beamforming for extremely large antenna arrays,” arXiv preprint arXiv:2109.10054, 2021.
  • [37] Q. Shi, M. Razaviyayn, Z.-Q. Luo, and C. He, “An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel,” IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4331–4340, 2011.
  • [38] B. Zheng, C. You, and R. Zhang, “Double-IRS assisted multi-user MIMO: Cooperative passive beamforming design,” IEEE Trans. Wireless Commun., vol. 20, no. 7, pp. 4513–4526, July 2021.
  • [39] M. S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, “Applications of second-order cone programming,” Linear Algebra and its Applications, vol. 284, no. 1, pp. 193–228, 1998, International Linear Algebra Society (ILAS) Symposium on Fast Algorithms for Control, Signals and Image Processing. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0024379598100320