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

\UseRawInputEncoding

Near-Field Channel Estimation for Extremely Large-Scale Reconfigurable Intelligent Surface (XL-RIS)-Aided Wideband mmWave Systems

Songjie Yang, Chenfei Xie, Wanting Lyu, Boyu Ning,
Zhongpei Zhang, , and Chau Yuen
Songjie Yang, Chenfei Xie, Wanting Lyu, Boyu Ning, and Zhongpei Zhang are with the National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu 611731, China. (e-mail: yangsongjie@std.uestc.edu.cn;201911220505@std.uestc.edu.cn; lyuwanting@yeah.net;boydning@outlook.com; zhangzp@uestc.edu.cn).Chau Yuen is with the School of Electrical and Electronics Engineering, Nanyang Technological University (e-mail: chau.yuen@ntu.edu.sg).
Abstract

Near-field communications present new opportunities over near-field channels, however, the spherical wavefront propagation makes near-field signal processing challenging. In this context, this paper proposes efficient near-field channel estimation methods for wideband MIMO mmWave systems with the aid of extremely large-scale reconfigurable intelligent surfaces (XL-RIS). For the wideband signals reflected by the analog RIS, we characterize their near-field beam squint effect in both angle and distance domains. Based on the mathematical analysis of the near-field beam patterns over all frequencies, a wideband spherical-domain dictionary is constructed by minimizing the coherence of two arbitrary beams. In light of this, we formulate a two-dimensional compressive sensing problem to recover the channel parameter based on the spherical-domain sparsity of mmWave channels. To this end, we present a correlation coefficient-based atom matching method within our proposed multi-frequency parallelizable subspace recovery framework for efficient solutions. Additionally, we propose a two-dimensional oracle estimator as a benchmark and derive its lower bound across all subcarriers. Our findings emphasize the significance of system hyperparameters and the sensing matrix of each subcarrier in determining the accuracy of the estimation. Finally, numerical results show that our proposed method achieves considerable performance compared with the lower bound and has a time complexity linear to the number of RIS elements.

Index Terms:
Channel estimation, extremely large-scale reconfigurable intelligent surfaces, near-field beam squint, spherical domain, compressive sensing, correlation coefficient.

I Introduction

Wireless communication systems have evolved rapidly over the past few decades, with each new generation of technology bringing a significant increase in capacity and data rates. However, as the demand for wireless communications and data access continues to grow, it has become clear that current wireless technologies will eventually reach their limit. To overcome this challenge, researchers have turned to promising new technologies such as extremely large-scale multiple-input multiple-output (XL-MIMO) [1], holographic MIMO [2], and orbital angular momentum MIMO [3]. These technologies have the potential to improve the reliability and quality of wireless services, particularly in high-density urban areas, where traditional wireless technologies struggle to keep with demand.

The potential of XL-MIMO technology to significantly increase spectral efficiency and enhance localization has been demonstrated by the authors of [1, 4, 5, 6], making it an enticing option for next-generation wireless communication and sensing systems. However, the use of XL-arrays poses a challenge due to the invalidation of the planar wavefront assumption in the near-field region [7]. In its place, the spherical wavefront assumption should be considered for near-field channel characterization, which depends not only on the spatial angle but also on the distance between the array and the source or scatter. As a result, channel estimation and modeling in the near-field region are even more demanding than in the far-field region, requiring greater precision and accuracy.

On the other hand, reconfigurable intelligent surface (RIS), capable of reflecting, refracting and manipulating incoming electromagnetic waves [8], is particularly promising as it allows to overcome some of the propagation challenges associated with the mmWave/THz spectrum [9, 10]. There are two distinct types of RIS that are used in wireless communication systems: near-field and far-field RIS. Far-field RIS operates in the far-field region, which is defined as the region, where the radiated field is essentially plane-wave-like and the distance from the RIS is much larger than the size of the RIS. In this case, the RIS can be modeled as modifying the radiation pattern of the radiating source, and the primary goal is to steer the beam in a desired direction or shape. Over these years, various fundamental topics have been studied for far-field RIS [11, 12, 13, 14, 15, 16, 17, 18], including channel estimation, localization, and passive/active beamforming.

By leveraging the advantages of XL-MIMO technology, several studies have started exploring near-field XL-RIS techniques that entail deploying numerous small, low-cost, and passive/active elements in close proximity to either the transmitter or receiver. In this region, the RIS can be viewed as a thin surface that modifies the local electromagnetic environment. The primary goal of near-field RIS is to optimize the wireless signal quality at a specific location. However, the near electromagnetic field exhibits complex behavior that varies significantly depending on the distance between the transmitter/receiver and the RIS. Despite the challenges involved in near-field region, it is an important area of research that has the potential to improve the performance of wireless communication systems in the near future.

I-A State-of-the-Art Works

The research on near-field XL-RIS is still in the preliminary stage. The authors of [19, 20] provided complementary perspectives on the use of large intelligent surfaces and near-field beamforming for improving wireless communications in the near-field region. They both highlight the potential of these techniques to enhance the performance and efficiency of wireless communication systems, and provide insights into the design and optimization of these systems for different communication modes and scenarios. Since the focus of near-field RIS is on the spatial beamspace, several related topics have been studied, including beam training [21, 22, 23], localization [24, 25, 26, 27, 28], and channel estimation [26, 27, 29]. In the near-field region, angular beam training using the planar steering vector is no longer effective, making it necessary to redesign the codebook for beam training with the spherical steering vector. In the Cartesian coordinate system, two near-field codebooks have been designed, namely the near-field uniform codebook [21] and the near-field hierarchical codebook [21, 22]. In [21], it was shown that the near-field hierarchical codebook incurs significantly less training overhead than the near-field uniform codebook. Alternatively, the authors of [23] utilized the polar-domain codebook [30] to perform near-field beam training in the polar domain. On the other hand, near-field localization is a popular topic due to the advantageous spherical wavefront for distance sensing. In this context, various studies have investigated near-field localization with the XL-RIS system. Notably, due to the similarity between compressive channel estimation and localization, references [26] and [27] investigated near-field localization while also studying near-field channel estimation. In [29], the authors investigated near-field channel estimation for the hybrid beamforming system with the aid of the XL-RIS.

However, the above references just considered narrowband systems. In practical systems such as orthogonal frequency division multiplex (OFDM), wideband signals are commonly used, which will cause a well-known spatial effect called beam squint in phased array antennas. Beam squint occurs due to the change in the angle of incidence of the incoming wave with frequency, and it can have a significant impact on the performance of the wideband system. To mitigate the effects of beam squint, researchers have proposed effective methods for wideband channel estimation and hybrid beamforming, as demonstrated in [31, 32, 33, 34]. However, dealing with beam squint can be even more challenging in near-field XL-RIS systems. Using the polar-domain dictionary proposed in [30], researchers in [35] adopted the Kronecker compressive sensing (KCS) framework to estimate the wideband channel by exploiting common sparsity on each subcarrier. Moreover, the near-field beam squint effect was explored in [36], which unveiled two important findings in the polar domain: 1) the mathematical correlation between the beam of the central subcarrier and the beam of other subcarriers, and 2) the variation of beam trajectory with respect to frequency. To address beam squint issues in RIS systems at the hardware level, [37] proposed a delay adjustable metasurface (DAM) architecture, inspired by the true-time delay unit design of phased array antennas. The DAM architecture was subsequently used by [38] and [36] to mitigate the near-field beam squint effect. However, as the number of time delay units increases, the hardware cost and energy consumption also increase.

Previous research on near-field XL-RIS with beam squint considered uniform linear arrays (ULAs) for channel estimation or localization. However, in the near-field region, the beam squint effect of uniform planar arrays (UPAs) is reflected in the spherical domain, which presents particular challenges for signal processing such as spherical-domain dictionary design [39]. Last but not least, the XL-RIS system is sensitive to the algorithm complexity due to the numerous elements. In order to fully exploit the potential of XL-RIS technology for future communication applications, it is essential to improve channel estimation and other signal processing techniques.

I-B Contributions and Novelty

Taking the aforementioned context into account, this paper focuses on the efficient estimation of near-field wideband channels in XL-RIS systems, capitalizing on both the channel’s sparsity in the spherical domain and the common sparsity support across all subcarriers. Our approach involves a thorough analysis of the near-field beam squint effect, the development of a wideband spherical-domain dictionary, the proposal of an efficient CS framework, and the derivation of a lower bound. The details of these endeavors are listed below.

  • To begin with, we employ the Fresnel approximation [7] to approximate the spherical array response in terms of the elevation/azimuth angle and distance. By separately analyzing the linear and quadratic phase terms, we establish a mathematical relationship between the desired beam at the central frequency and the corresponding beam at other frequencies, captured by the error function erf(){\rm erf}(\cdot). Our exploration of the near-field beam squint effect in the 3D space enables us to produce a comprehensive visualization of the beam trajectory across the frequency spectrum in the spherical domain. Furthermore, drawing on the error function, we formulate a wideband spherical-domain dictionary that minimizes the coherence between any two arbitrary dictionary atoms.

  • We propose the multi-frequency parallelizable subspace recovery (MMPSR) framework for solving the wideband channel estimation problem, using the designed wideband spherical-domain dictionary. This framework converts the 2D-CS problem into multiple sparse vector recovery problems, with multi-frequency joint processing. It is particularly suitable for recovering multi-parameter and large-scale dictionary problems, outperforming commonly used recovery frameworks such as Kronecker CS. To achieve optimal evaluation of the phase relation between the measured signal and the sensing atom, we propose correlation coefficient (CC)-based atom matching, as opposed to inner product (IN)-based atom matching used in some greedy algorithms like orthogonal matching pursuit (OMP).

  • Finally, we propose a 2D-OLS estimator to serve as a reliable benchmark that any estimation method cannot surpass. Furthermore, we derive its lower bound with the evaluation index of the normalized mean squared error (NMSE). Significantly, this lower bound accounts for multi-frequency channels, highlighting the influence of both system hyperparameters (such as the number of antennas, subcarriers, and channel paths) and the sensing matrix of each subcarrier on estimation performance.

I-C Organization and Notations

The rest of this paper is organized as follows: Section II describes the wideband near-field channels and the uplink training model. Section III discusses the near-field beam squint effect and designs the wideband spherical-domain dictionary. Section IV proposes the CS framework to process the 2D recovery problem, and gives an efficient solution with CC-based atom matching. Section V derives the lower bound for the benchmark of any estimation method. Section VI conducts several experiments to demonstrate our proposed methods’ effectiveness. Finally, Section VII concludes this paper.

Notations: (){\left(\cdot\right)}^{*}, ()T{\left(\cdot\right)}^{T}, ()H{\left(\cdot\right)}^{H}, and ()1\left(\cdot\right)^{-1} denote conjugate, transpose, conjugate transpose, and inverse, respectively. 2\|\cdot\|_{2} represent 0\ell_{0} norm and 2\ell_{2} norm, respectively. 𝐀F\|\mathbf{A}\|_{F} denotes the Frobenius norm of matrix 𝐀\mathbf{A}. Tr{𝐀}{\rm Tr}\{\mathbf{A}\} denotes the trace of matrix 𝐀\mathbf{A}. |||\cdot| denotes the modulus. Furthermore, \otimes is the Kronecker product. [𝐚]i[\mathbf{a}]_{i} and [𝐀]i,j[\mathbf{A}]_{i,j} denote the ii-th element of vector 𝐚\mathbf{a}, the (i,j)(i,j)-th element of matrix 𝐀\mathbf{A}, respectively. vec()\rm{vec}(\cdot) represents the vectorization operation. 𝔼{}\mathbb{E}\{\cdot\} and 𝕍{}\mathbb{V}\{\cdot\} denote the expectation and variance operations , respectively. 𝐈M\mathbf{I}_{M} denotes the MM-by-MM identity matrix. Moreover, diag(𝐚)\rm{diag}(\mathbf{a}) is a square diagonal matrix with entries of 𝐚\mathbf{a} on its diagonal. Finally, 𝒞𝒩(𝐚,𝐀)\mathcal{CN}(\mathbf{a},\mathbf{A}) is the complex Gaussian distribution with mean 𝐚\mathbf{a} and covariance matrix 𝐀\mathbf{A}.

Refer to caption
Figure 1: The BS-RIS-user system description.

II Near- and Far-Field Wideband System Model

We consider a time division duplexing (TDD) KK-subcarrier MIMO-OFDM system with the assistance of XL-RIS. Since uplink multiuser channel estimation can be performed in parallel owing to the orthogonal pilot sequence, we just consider an arbitrary user for clarity. The BS, the RIS, and the user are equipped with a (NB=NBz×NByN_{B}=N_{B}^{z}\times N_{B}^{y})-element UPA, a (NR=NRz×NRyN_{R}=N_{R}^{z}\times N_{R}^{y})-element UPA, and a (NU=NUz×NUyN_{U}=N_{U}^{z}\times N_{U}^{y})-element UPA, respectively (shown in Fig. 1). For simpicity, we assume both the BS and the user are equipped with one radio frequency chain. Moreover, 𝐇BNU×NR\mathbf{H}_{\rm B}\in\mathbb{C}^{N_{U}\times N_{R}}, 𝐇UNR×NB\mathbf{H}_{\rm U}\in\mathbb{C}^{N_{R}\times N_{B}}, and 𝐇DNB×NU\mathbf{H}_{\rm D}\in\mathbb{C}^{N_{B}\times N_{U}} are the channels between the BS and the RIS, between the RIS and the user, and between the BS and the user111 This paper ignores the estimation of the direct channel 𝐇D\mathbf{H}_{\rm D} since it can be estimated by turning off the RIS and using conventional estimation methods. , respectively. The RIS matrix is defined as 𝐕=diag(𝐯)NR×NR\mathbf{V}={\rm diag}(\mathbf{v})\in\mathbb{C}^{N_{R}\times N_{R}}, with 𝐯[ejv1,,ejvNR]1×NR\mathbf{v}\triangleq[e^{jv_{1}},\cdots,e^{jv_{N_{R}}}]\in\mathbb{C}^{1\times N_{R}}, where {vl}l=1NR\{v_{l}\}_{l=1}^{N_{R}} are the phase shifts.

II-A Channel Model

Considering that the size of the RIS is much larger than that of the user, we utilize a one-side near-field channel model for the RIS-user channel. In the context, the RIS-user channel on the kk-th subcarrier can be expressed with the Saleh-Valenzuela model:

𝐇U[k]=NRNUPp=1Pβpej2πτpfk𝐛R(fk,rR,p)𝐚UH(fk,ϑ~U,p,φ~U,p),\displaystyle\mathbf{H}_{\rm U}[k]=\sqrt{\frac{N_{R}N_{U}}{P}}\sum_{p=1}^{P}\beta_{p}e^{-j2\pi\tau_{p}f_{k}}\mathbf{b}_{\rm R}(f_{k},r_{{R},p})\mathbf{a}_{\rm U}^{H}(f_{k},\widetilde{\vartheta}_{{U},p},\widetilde{\varphi}_{{U},p}), (1)

where we make a far-field assumption at the user end. PP is the number of channel paths, {τp}p=1P\{\tau_{p}\}_{p=1}^{P} and{βp}p=1P\{\beta_{p}\}_{p=1}^{P} are the path delays and complex path gains, respectively. rR,pr_{R,p} denotes the distance from the RIS to the pp-th object (the scatter or the user). ϑ~U,pcos(ϑU,p)\widetilde{\vartheta}_{U,p}\triangleq\cos(\vartheta_{U,p}) and φ~U,psin(ϑU,p)sin(φU,p)\widetilde{\varphi}_{U,p}\triangleq\sin(\vartheta_{U,p})\sin(\varphi_{U,p}) represent the virtual angles, where ϑU,p\vartheta_{U,p} and φU,p\varphi_{U,p} denote the pp-th path’s elevation and azimuth angles from the user to the RIS, respectively. fkfc+fsK(k1K12)f_{k}\triangleq f_{c}+\frac{f_{s}}{K}(k-1-\frac{K-1}{2}), k{1,,K}k\in\{1,\cdots,K\}, with fcf_{c} being the central frequency and fsf_{s} being the bandwidth, denotes the frequency of subcarrier kk. Moreover, 𝐛R\mathbf{b}_{\rm R} and 𝐚U\mathbf{a}_{\rm U} are the spherical array response and planar array response, respectively. The spherical array response on subcarrier kk is given by

𝐛R(fk,r)1NR[ej2πfkc(r(MRy,MRz)r),,ej2πfkc(r(MRy,MRz)r)]T,\displaystyle\mathbf{b}_{\rm R}(f_{k},r)\triangleq\frac{1}{\sqrt{N_{\rm R}}}\left[e^{-j\frac{2\pi f_{k}}{c}(r_{(-M^{y}_{R},-M^{z}_{R})}-r)},\cdots,e^{-j\frac{2\pi f_{k}}{c}(r_{(M^{y}_{R},M^{z}_{R})}-r)}\right]^{T}, (2)

where MRz/yNRz/y12M^{z/y}_{R}\triangleq\frac{N^{z/y}_{R}-1}{2}. As shown in Fig. 1, the distance between the (mRy,mRz)(m^{y}_{R},m^{z}_{R})-th element with vector coordinate (0,mRyd,mRzd)(0,m^{y}_{R}d,m^{z}_{R}d) and the object with (rsin(θR)cos(ϕR),rsin(θR)sin(ϕR),rcos(θR))(r\sin(\theta_{R})\cos(\phi_{R}),r\sin(\theta_{R})\sin(\phi_{R}),r\cos(\theta_{R})) is denoted by

r(mRy,mRz)\displaystyle r_{(m^{y}_{R},m^{z}_{R})} ((rsin(θR)cos(ϕR))2+(rsin(θR)sin(ϕR)mRyd)2+(rcos(θR)mRzd)2)12\displaystyle\triangleq\left((r\sin(\theta_{R})\cos(\phi_{R}))^{2}+(r\sin(\theta_{R})\sin(\phi_{R})-m^{y}_{R}d)^{2}+(r\cos(\theta_{R})-m^{z}_{R}d)^{2}\right)^{\frac{1}{2}} (3)
=r22rmRydsin(θR)sin(ϕR)+(mRyd)22rmRzdcos(θR)+(mRzd)2\displaystyle=\sqrt{r^{2}-2rm^{y}_{R}d\sin(\theta_{R})\sin(\phi_{R})+(m^{y}_{R}d)^{2}-2rm^{z}_{R}d\cos(\theta_{R})+(m^{z}_{R}d)^{2}}
(a)rmRydsin(θR)sin(ϕR)mRzdcos(θR)+(mRzd)22r(1cos2(θR))+(mRyd)22r(1sin2(θR)sin2(ϕR))\displaystyle\overset{(a)}{\approx}r-m^{y}_{R}d\sin(\theta_{R})\sin(\phi_{R})-m^{z}_{R}d\cos(\theta_{R})+\frac{(m^{z}_{R}d)^{2}}{2r}(1-\cos^{2}(\theta_{R}))+\frac{(m^{y}_{R}d)^{2}}{2r}(1-\sin^{2}(\theta_{R})\sin^{2}(\phi_{R}))
mRymRzd2sin(θR)sin(ϕR)cos(θR)r+,\displaystyle\ \ \ \ -\frac{m^{y}_{R}m^{z}_{R}d^{2}\sin(\theta_{R})\sin(\phi_{R})\cos(\theta_{R})}{r}+...,

where (a)(a) holds due to 1+x+y1+x+y2(x+y)28\sqrt{1+x+y}\approx 1+\frac{x+y}{2}-\frac{(x+y)^{2}}{8}.

With the far-field assumption, the user’s planar array response on subcarrier kk can be written as

𝐚U(fk,ϑ~U,φ~U)1NU[ej2πfkdc(MUzϑ~UMUyφ~U),,ej2πfkdc(MUzϑ~U+MUyφ~U)]T,\displaystyle\mathbf{a}_{\rm U}(f_{k},\widetilde{\vartheta}_{U},\widetilde{\varphi}_{U})\triangleq\frac{1}{\sqrt{N_{U}}}\left[e^{-j\frac{2\pi f_{k}d}{c}(-M_{U}^{z}\widetilde{\vartheta}_{U}-M_{U}^{y}\widetilde{\varphi}_{U})},\cdots,e^{-j\frac{2\pi f_{k}d}{c}(M_{U}^{z}\widetilde{\vartheta}_{U}+M_{U}^{y}\widetilde{\varphi}_{U})}\right]^{T}, (4)

where MUz/yNUz/y12M^{z/y}_{U}\triangleq\frac{N^{z/y}_{U}-1}{2}.

Due to the long distance between the BS and the RIS, the far-field assumption can be used for simple approximation. The BS-RIS channel on the kk-th subcarrier is modeled with a LoS path [26]:

𝐇B[k]=αej2πτ0fk𝐚B(fk,θ~B,ϕ~B)𝐚RH(fk,ϑ~R,φ~R),\displaystyle\mathbf{H}_{\rm B}[k]=\alpha e^{-j2\pi\tau_{0}f_{k}}\mathbf{a}_{\rm B}(f_{k},\widetilde{\theta}_{B},\widetilde{\phi}_{B})\mathbf{a}_{\rm R}^{H}(f_{k},\widetilde{\vartheta}_{R},\widetilde{\varphi}_{R}), (5)

where α\alpha is the complex path gain and τ0\tau_{0} is the path delay. θ~Bcos(θB)\widetilde{\theta}_{B}\triangleq\cos(\theta_{B}) and ϕ~Bsin(θB)sin(ϕB)\widetilde{\phi}_{B}\triangleq\sin(\theta_{B})\sin(\phi_{B}), in which θB\theta_{B} and ϕB\phi_{B} are the elevation and azimuth angles from the BS to the RIS, respectively. ϑ~R\widetilde{\vartheta}_{R} and φ~R\widetilde{\varphi}_{R} are defined similarly. Moreover, 𝐚B/R\mathbf{a}_{\rm B/R} is the planar array response, which has a similar form of Eqn. (4).

II-B Uplink Training

In the TDD system, uplink channel estimation is performed through continuous transmission of pilots by the user and continuous adjustment of the phase matrix by the RIS. Assuming that QQ subframes are utilized for uplink training, where each subframe corresponds to one RIS phase matrix, the RIS fixes the phase matrix in each subframe, while the user transmits NXN_{X} pilot sequences. As a result, QNXQN_{X} symbol durations are required for channel estimation of a single user. The nn-th training beam on subcarrier kk is denoted as 𝐟n[k]\mathbf{f}_{n}[k] with n=1,,NXn=1,\cdots,N_{X}, and the qq-th RIS phase matrix on all subcarriers is represented as 𝐕qdiag(𝐯q)\mathbf{V}_{q}\triangleq{\rm diag}(\mathbf{v}_{q}), where q=1,,Qq=1,\cdots,Q. The training model is described as

yq,n[k]=𝐰H[k]𝐇B[k]𝐕q𝐇U[k]𝐟n[k]+𝐰H[k]𝐧q,n[k],y_{q,n}[k]=\mathbf{w}^{H}[k]\mathbf{H}_{\rm B}[k]\mathbf{V}_{q}\mathbf{H}_{\rm U}[k]\mathbf{f}_{n}[k]+\mathbf{w}^{H}[k]\mathbf{n}_{q,n}[k], (6)

where yq,n[k]y_{q,n}[k] is the received training signal on subcarrier kk, 𝐟n[k]fBB,n[k]𝐟RF,nNT×1\mathbf{f}_{n}[k]\triangleq f_{{\rm BB},n}[k]\mathbf{f}_{{\rm RF},n}\in\mathbb{C}^{N_{T}\times 1} is the hybrid precoder vector on subcarrier kk such that 𝐟nH[k]𝐟n[k]=σp2\mathbf{f}^{H}_{n}[k]\mathbf{f}_{n}[k]=\sigma_{p}^{2} with σp2\sigma_{p}^{2} denoting the transmit power. 𝐰[k]wBB[k]𝐰RFNR×1\mathbf{w}[k]\triangleq w_{\rm BB}[k]\mathbf{w}_{\rm RF}\in\mathbb{C}^{N_{R}\times 1} is the hybrid combiner vector on subcarrier kk, and 𝐧q,n[k]NR×1\mathbf{n}_{q,n}[k]\in\mathbb{C}^{N_{R}\times 1} is the noise following 𝒞𝒩(0,σn2𝐈NR)\mathcal{CN}(0,\sigma_{n}^{2}\mathbf{I}_{N_{R}}). fBB,n[k]f_{{\rm BB},n}[k] and wBB[k]w_{\rm BB}[k] are the baseband coefficients. Note that 𝐟RF,n\mathbf{f}_{{\rm RF},n} and 𝐰RF\mathbf{w}_{\rm RF}, the analog vectors produced by the UPA, are fixed at different subcarriers due to analog hardware limitations. With an appropriate location deployment of the BS and the RIS, the BS-RIS channel can be approximated as a LoS channel. In this way, we just need to estimate the RIS-user channel. Denoting the effective channel 𝐡~B[k]𝐰H[k]𝐇B[k]\widetilde{\mathbf{h}}_{\rm B}[k]\triangleq\mathbf{w}^{H}[k]\mathbf{H}_{\rm B}[k] and the effective noise n~q,n[k]𝐰H[k]𝐧q,n[k]\widetilde{n}_{q,n}[k]\triangleq\mathbf{w}^{H}[k]\mathbf{n}_{q,n}[k], where 𝐰[k]\mathbf{w}[k] can be set towards the angle-of-arrival of the BS. Then, we have

yq,n[k]=\displaystyle y_{q,n}[k]= 𝐡~B[k]𝐕q𝐇U[k]𝐟n[k]+n~q,n[k]\displaystyle\widetilde{\mathbf{h}}_{\rm B}[k]\mathbf{V}_{q}\mathbf{H}_{\rm U}[k]\mathbf{f}_{n}[k]+\widetilde{n}_{q,n}[k] (7)
=\displaystyle= 𝐯qdiag(𝐡~B[k])𝐇U[k]𝐟n[k]+n~q,n[k].\displaystyle\mathbf{v}_{q}{\rm diag}(\widetilde{\mathbf{h}}_{\rm B}[k])\mathbf{H}_{\rm U}[k]\mathbf{f}_{n}[k]+\widetilde{n}_{q,n}[k].

By collecting the training signals in QQ subframes on subcarrier kk, yielding

𝐘[k]=𝐕~[k]𝐇U[k]𝐅[k]+𝐍~[k],\mathbf{Y}[k]=\widetilde{\mathbf{V}}[k]\mathbf{H}_{\rm U}[k]\mathbf{F}[k]+\widetilde{\mathbf{N}}[k], (8)

where 𝐘[k]Q×NX\mathbf{Y}[k]\in\mathbb{C}^{Q\times N_{X}}, 𝐕~[k][𝐯1T,,𝐯QT]Tdiag(𝐡~B[k])Q×L\widetilde{\mathbf{V}}[k]\triangleq[\mathbf{v}_{1}^{T},\cdots,\mathbf{v}_{Q}^{T}]^{T}{\rm diag}(\widetilde{\mathbf{h}}_{\rm B}[k])\in\mathbb{C}^{Q\times L}, 𝐅[k][𝐟1T[k],,𝐟NXT[k]]TNT×NX\mathbf{F}[k]\triangleq\left[\mathbf{f}^{T}_{1}[k],\cdots,\mathbf{f}^{T}_{N_{X}}[k]\right]^{T}\in\mathbb{C}^{N_{T}\times N_{X}}, and 𝐍~[k]Q×NX\widetilde{\mathbf{N}}[k]\in\mathbb{C}^{Q\times N_{X}}.

III Near-Field Dictionary Design With Beam Squint

The goal of this section is to estimate {𝐇U[k]}k=1K\{\mathbf{H}_{\rm U}[k]\}_{k=1}^{K} from Eqn. (8). One straightforward method is to use the conventional estimation method for each subcarrier. The 2D least squares (2D-LS) estimator for the kk-th subcarrier is described in the following proposition.

Proposition 1.

Assuming Q=NRQ=N_{R} and NX=NUN_{X}=N_{U}, the solution of 𝐇U[k]\mathbf{H}_{\rm U}[k] of Eqn. (8) via the 2D-LS estimator is given by

𝐇^U[k]=(𝐕~H[k]𝐕~[k])1𝐕~H[k]𝐘[k]𝐅H[k](𝐅[k]𝐅H[k])1.\widehat{\mathbf{H}}_{\rm U}[k]=\left(\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\right)^{-1}\widetilde{\mathbf{V}}^{H}[k]\mathbf{Y}[k]\mathbf{F}^{H}[k]\left(\mathbf{F}[k]\mathbf{F}^{H}[k]\right)^{-1}. (9)

Proof: According to [40, Chapter 2], in the case when

(𝐕~H[k]𝐕~[k])1𝐕~H[k]𝐕~[k]𝐘[k]𝐅[k]𝐅H[k](𝐅[k]𝐅H[k])1=𝐘[k],\left(\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\right)^{-1}\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\mathbf{Y}[k]\mathbf{F}[k]\mathbf{F}^{H}[k]\left(\mathbf{F}[k]\mathbf{F}^{H}[k]\right)^{-1}=\mathbf{Y}[k], (10)

the general solution of 𝐇U[k]\mathbf{H}_{\rm U}[k] is

𝐇^U[k]=\displaystyle\widehat{\mathbf{H}}_{\rm U}[k]= (𝐕~H[k]𝐕~[k])1𝐕~H[k]𝐘[k]𝐅H[k](𝐅[k]𝐅H[k])1+𝐃\displaystyle\left(\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\right)^{-1}\widetilde{\mathbf{V}}^{H}[k]\mathbf{Y}[k]\mathbf{F}^{H}[k]\left(\mathbf{F}[k]\mathbf{F}^{H}[k]\right)^{-1}+\mathbf{D} (11)
(𝐕~H[k]𝐕~[k])1𝐕~H[k]𝐕~[k]𝐃𝐅[k]𝐅H[k](𝐅[k]𝐅H[k])1\displaystyle\ -\left(\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\right)^{-1}\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\mathbf{D}\mathbf{F}[k]\mathbf{F}^{H}[k]\left(\mathbf{F}[k]\mathbf{F}^{H}[k]\right)^{-1}

for aribitrary 𝐃NR×NU\mathbf{D}\in\mathbb{C}^{N_{R}\times N_{U}}.

With the appropriate training sequence design, we have (𝐕~H[k]𝐕~[k])1𝐕~H[k]𝐕~[k]=𝐈NR\left(\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]\right)^{-1}\widetilde{\mathbf{V}}^{H}[k]\widetilde{\mathbf{V}}[k]=\mathbf{I}_{N_{R}} and 𝐅[k]𝐅H[k](𝐅[k]𝐅H[k])1=𝐈NU\mathbf{F}[k]\mathbf{F}^{H}[k]\left(\mathbf{F}[k]\mathbf{F}^{H}[k]\right)^{-1}=\mathbf{I}_{N_{U}}. Thus, Eqn. (9) holds.

The proof is complete. \blacksquare

Remark 1.

The channel 𝐇U[k]\mathbf{H}_{\rm U}[k] can also be solved by the 1D-LS estimator with the Kronecker product. Ignoring the noise and vectorizing 𝐘[k]\mathbf{Y}[k] to obtain vec(𝐘[k])(𝐅T[k]𝐕~[k])vec(𝐇U[k]){\rm vec}(\mathbf{Y}[k])\approx(\mathbf{F}^{T}[k]\otimes\widetilde{\mathbf{V}}[k]){\rm vec}(\mathbf{H}_{\rm U}[k]). Then, 𝐇U[k]\mathbf{H}_{\rm U}[k] can be solved by

𝐇^U[k]=devec((𝐅VH[k]𝐅V[k])1𝐅VH[k]vec(𝐘[k])),\widehat{\mathbf{H}}_{\rm U}[k]={\rm devec}\left(\left(\mathbf{F}_{\rm V}^{H}[k]\mathbf{F}_{\rm V}[k]\right)^{-1}\mathbf{F}_{\rm V}^{H}[k]{\rm vec}(\mathbf{Y}[k])\right), (12)

where devec(){\rm devec}(\cdot) is the de-vectorization operator, and 𝐅V[k]𝐅T[k]𝐕~[k]LNU×LNU\mathbf{F}_{\rm V}[k]\triangleq\mathbf{F}^{T}[k]\otimes\widetilde{\mathbf{V}}[k]\in\mathbb{C}^{LN_{U}\times LN_{U}}.

However, this way will incur much higher computational complexity compared with the 2D-LS estimator (please see details in the later complexity analysis section).

Despite its simplicity, the 2D-LS method has three limitations: 1) the pilot overhead must be equal to or greater than the number of elements, resulting in a significant pilot overhead, 2) it is susceptible to noise, and 3) it cannot perform joint channel estimation for all subcarriers for performance enhancement.

In contrast, the CS technique can effectively overcome these limitations for channel estimation. It is well established that the key to CS is sparse representation. Because of the limited number of channel paths, we can represent 𝐇U[k]\mathbf{H}_{\rm U}[k] sparsely using appropriate dictionaries. Suppose that 𝐁R[k]L×GR\mathbf{B}_{\rm R}[k]\in\mathbb{C}^{L\times G_{R}} and 𝐀U[k]NU×GU\mathbf{A}_{\rm U}[k]\in\mathbb{C}^{N_{U}\times G_{U}} are the dictionaries used to describe the spatial parameters of the RIS and user on subcarrier kk, respectively, where GRG_{R} and GUG_{U} are the dictionary sizes. Then, 𝐇U[k]\mathbf{H}_{\rm U}[k] can be approximated by

𝐇U[k]𝐁R[k]𝚵[k]𝐀UH[k],\mathbf{H}_{\rm U}[k]\approx\mathbf{B}_{\rm R}[k]\bm{\Xi}[k]\mathbf{A}_{\rm U}^{H}[k], (13)

where 𝚵[k]GR×GU\bm{\Xi}[k]\in\mathbb{C}^{G_{R}\times G_{U}} denotes a PP-sparse matrix.

Note that designing 𝐁R[k]\mathbf{B}_{\rm R}[k] is more challenging than designing 𝐀U[k]\mathbf{A}_{\rm U}[k] because of the near-field effect. To develop a wideband near-field dictionary, we first need to discuss the beam squint effect in the near-field region. Since this paper’s following derivation will not consider the recovery of the BS-RIS channel parameter, we will ignore the angle subscript for simplicity, such as θ~θ~R\widetilde{\theta}\leftarrow\widetilde{\theta}_{\rm R} and ϑ~ϑ~U\widetilde{\vartheta}\leftarrow\widetilde{\vartheta}_{\rm U}.

Refer to caption
Figure 2: The near-field beam squint effect.

III-A Near-Field Spherical-Domain Beam Squint

Let the index of the central frequency fcf_{c} be k¯K+12\bar{k}\triangleq\frac{K+1}{2} such that fk¯=fcf_{\bar{k}}=f_{c}. Given a desired beam on frequency fcf_{c}, the near-field effect indicates that the steering beams of other frequencies will have a spatial shift, as shown in Fig. 2. Next, we will derive the mathematical expression to describe the spatial shift.

Reference [7] showed that the Fresnel approximation, with neglection of terms greater than quadratic, was sufficient to characterize near-field communications. According to this, we can simplify the near-field array response. Defining the phase term δk,(mRy,mRz)fkc(mRydϕ~mRzdθ~+(mRzd)22r(1θ~2)+(mRyd)22r(1ϕ~2)mRymRzd2θ~ϕ~r)\delta_{k,(m^{y}_{R},m^{z}_{R})}\triangleq\frac{f_{k}}{c}(-m^{y}_{R}d\widetilde{\phi}-m^{z}_{R}d\widetilde{\theta}+\frac{(m^{z}_{R}d)^{2}}{2r}(1-\widetilde{\theta}^{2})+\frac{(m^{y}_{R}d)^{2}}{2r}(1-\widetilde{\phi}^{2})-\frac{m^{y}_{R}m^{z}_{R}d^{2}\widetilde{\theta}\widetilde{\phi}}{r}) by simplifying the phase term of Eqn. (2). Then, the spherical array response is defined as

𝐜R(fk,θ~,ϕ~,r)1NR[ej2πδk,(MRy,MRz),,ej2πδk,(MRy,MRz)]T,\displaystyle\mathbf{c}_{\rm R}(f_{k},\widetilde{\theta},\widetilde{\phi},r)\triangleq\frac{1}{\sqrt{N_{R}}}\left[e^{-j{2\pi}\delta_{k,(-M^{y}_{R},-M^{z}_{R})}},\cdots,e^{-j{2\pi}\delta_{k,(M^{y}_{R},M^{z}_{R})}}\right]^{T}, (14)

Suppose that the k¯\bar{k}-th subcarrier’s phase with a desired beam (θ~k¯,ϕ~k¯,rk¯)(\widetilde{\theta}_{\bar{k}},\widetilde{\phi}_{\bar{k}},{r}_{\bar{k}}) is defined by δk¯,(mRy,mRz)fk¯c(mRydϕ~k¯mRzdθ~k¯+(mRzd)22r(1θ~k¯2)+(mRyd)22r(1ϕ~k¯2)mRymRzd2θ~k¯ϕ~k¯r)\delta_{\bar{k},(m^{y}_{R},m^{z}_{R})}\triangleq\frac{f_{\bar{k}}}{c}(-m^{y}_{R}d\widetilde{\phi}_{\bar{k}}-m^{z}_{R}d\widetilde{\theta}_{\bar{k}}+\frac{(m^{z}_{R}d)^{2}}{2r}(1-\widetilde{\theta}_{\bar{k}}^{2})+\frac{(m^{y}_{R}d)^{2}}{2r}(1-\widetilde{\phi}_{\bar{k}}^{2})-\frac{m^{y}_{R}m^{z}_{R}d^{2}\widetilde{\theta}_{\bar{k}}\widetilde{\phi}_{\bar{k}}}{r}). The pattern function pointing to the beam (θ~k¯,ϕ~k¯,rk¯)(\widetilde{\theta}_{\bar{k}},\widetilde{\phi}_{\bar{k}},{r}_{\bar{k}}) on subcarrier kk, denoted by 𝓢(θ~,ϕ~,r)[k]\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k] with {θ~,ϕ~}[1,1]\{\widetilde{\theta},\widetilde{\phi}\}\in[-1,1] and r(0,+)r\in(0,+\infty), is expressed as

𝓢(θ~,ϕ~,r)[k]1NRmRy=MRyMRymRz=MRzMRzIk,(mRy,mRz)ej2π(δk,(mRy,mRz)δk¯,(mRy,mRz))×𝓔(mRy,mRz)(θ~,ϕ~,r)[k],\displaystyle\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\triangleq\frac{1}{N_{R}}\sum_{m_{R}^{y}=-M_{R}^{y}}^{M_{R}^{y}}\sum_{m_{R}^{z}=-M_{R}^{z}}^{M_{R}^{z}}I_{k,(m_{R}^{y},m_{R}^{z})}e^{-j{2\pi}\left(\delta_{k,(m^{y}_{R},m^{z}_{R})}-\delta_{\bar{k},(m^{y}_{R},m^{z}_{R})}\right)}\times\bm{\mathcal{E}}_{(m_{R}^{y},m_{R}^{z})}(\widetilde{\theta},\widetilde{\phi},r)[k], (15)

where Ik,(mRy,mRz)I_{k,(m_{R}^{y},m_{R}^{z})} and 𝓔(mRy,mRz)[k]\bm{\mathcal{E}}_{(m_{R}^{y},m_{R}^{z})}[k] are the excitation amplitude and the element pattern of the (mRy,mRz)(m_{R}^{y},m_{R}^{z})-th antenna on subcarrier kk, respectively. As the passive RIS structure is considered, we have Ik,(mRy,mRz)=1I_{k,(m_{R}^{y},m_{R}^{z})}=1. Moreover, we assume each antenna element on each subcarrier is isotropic such that 𝓔(mRy,mRz)(θ~,ϕ~,r)[k]=1\bm{\mathcal{E}}_{(m_{R}^{y},m_{R}^{z})}(\widetilde{\theta},\widetilde{\phi},r)[k]=1.

To make the pattern independent of the subcarrier index, we have ej2π(δk1,(mRy,mRz)δk¯,(mRy,mRz))=ej2π(δk2,(mRy,mRz)δk¯,(mRy,mRz))e^{-j{2\pi}\left(\delta_{k_{1},(m^{y}_{R},m^{z}_{R})}-\delta_{\bar{k},(m^{y}_{R},m^{z}_{R})}\right)}=e^{-j{2\pi}\left(\delta_{k_{2},(m^{y}_{R},m^{z}_{R})}-\delta_{\bar{k},(m^{y}_{R},m^{z}_{R})}\right)}, where k1,k2{1,,K}k_{1},k_{2}\in\{1,\cdots,K\}, k1k2k_{1}\neq k_{2}. This equation is equivalent to

δk1,(mRy,mRz)=δk2,(mRy,mRz)+Z,\delta_{k_{1},(m^{y}_{R},m^{z}_{R})}=\delta_{k_{2},(m^{y}_{R},m^{z}_{R})}+Z, (16)

where ZZ is any integer. By assuming Z=0Z=0, k1=kk_{1}=k, and k2=k¯k_{2}=\bar{k}, we can calculate δ¯kδk,(mRy,mRz)δk¯,(mRy,mRz)\bar{\delta}_{k}\triangleq\delta_{k,(m^{y}_{R},m^{z}_{R})}-\delta_{\bar{k},(m^{y}_{R},m^{z}_{R})} as

δ¯k=\displaystyle\bar{\delta}_{k}= mRydc(fkϕ~fcϕ~k¯)mRzdc(fkθ~fcθ~k¯)+(mRzd)22c(fk1θ~2rfc1θ~k¯2rk¯)\displaystyle-\frac{m_{R}^{y}d}{c}(f_{k}\widetilde{\phi}-f_{c}\widetilde{\phi}_{\bar{k}})-\frac{m_{R}^{z}d}{c}(f_{k}\widetilde{\theta}-f_{c}\widetilde{\theta}_{\bar{k}})+\frac{(m^{z}_{R}d)^{2}}{2c}\left(f_{k}\frac{1-\widetilde{\theta}^{2}}{r}-f_{c}\frac{1-\widetilde{\theta}_{\bar{k}}^{2}}{r_{\bar{k}}}\right) (17)
+(mRyd)22c(fk1ϕ~2rfc1ϕ~k¯2rk¯)mRymRzd2c(fkθ~ϕ~rfcθk¯~ϕ~k¯rk¯).\displaystyle+\frac{(m^{y}_{R}d)^{2}}{2c}\left(f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}\right)-\frac{m_{R}^{y}m_{R}^{z}d^{2}}{c}\left(\frac{f_{k}\widetilde{\theta}\widetilde{\phi}}{r}-\frac{f_{c}\widetilde{\theta_{\bar{k}}}\widetilde{\phi}_{\bar{k}}}{r_{\bar{k}}}\right).

Now, the problem is equivalent to maximizing |𝓢(θ~,ϕ~,r)[k]|\left|\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\right| when assigning zero to δ¯k\bar{\delta}_{k}. In this way, the method in [36] used for ULAs is extended to calculate the kk-the subcarrier’s (θ~,ϕ~,r)(\widetilde{\theta},\widetilde{\phi},r) that is independent on the antenna index. By assigning zero to δ¯k\bar{\delta}_{k}, the following system of equations is derived:

{fkϕ~fcϕ~k¯=0,fkθ~fcθ~k¯=0,fk1θ~2rfc1θ~k¯2rk¯=0,fk1ϕ~2rfc1ϕ~k¯2rk¯=0,fkθ~ϕ~rfcθ~k¯ϕ~k¯rk¯=0.\displaystyle\begin{cases}f_{k}\widetilde{\phi}-f_{c}\widetilde{\phi}_{\bar{k}}=0,\ f_{k}\widetilde{\theta}-f_{c}\widetilde{\theta}_{\bar{k}}=0,\\ f_{k}\frac{1-\widetilde{\theta}^{2}}{r}-f_{c}\frac{1-\widetilde{\theta}_{\bar{k}}^{2}}{r_{\bar{k}}}=0,\ f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}=0,\\ \frac{f_{k}\widetilde{\theta}\widetilde{\phi}}{r}-\frac{f_{c}\widetilde{\theta}_{\bar{k}}\widetilde{\phi}_{\bar{k}}}{r_{\bar{k}}}=0.\end{cases} (18)

Nevertheless, the system of equations under consideration fails to yield a unique solution due to the interdependent nature of the elevation and azimuth angles on a shared distance parameter, leading to a spatial mismatch. To resolve this issue, we conduct a sequential analysis of each component of the near-field phase.

III-A1 Linear Term

Since the linear terms dominate the phase in both the near- and far-field region, we first ignore the nonlinear terms to obtain the optimal angles on subcarrier kk when maximizing |𝓢(θ~,ϕ~,r)[k]|\left|\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\right|. In this way, we can get ϕ~=fcfkϕ~k¯\widetilde{\phi}=\frac{f_{c}}{f_{k}}\widetilde{\phi}_{\bar{k}} and θ~=fcfkθ~k¯\widetilde{\theta}=\frac{f_{c}}{f_{k}}\widetilde{\theta}_{\bar{k}}.

III-A2 Quadratic Term

The quadratic term poses a significant challenge in achieving near-field wideband beam focusing, particularly due to the dependence on the distance parameter, which is further aggravated by the use of UPAs. To address this issue, the authors in [39, Lemma 3] have shown that the quadratic cross term (mRzd)22r(1θ~2)+(mRyd)22r(1ϕ~2)mRymRzd2θ~ϕ~r\frac{(m^{z}_{R}d)^{2}}{2r}(1-\widetilde{\theta}^{2})+\frac{(m^{y}_{R}d)^{2}}{2r}(1-\widetilde{\phi}^{2})-\frac{m^{y}_{R}m^{z}_{R}d^{2}\widetilde{\theta}\widetilde{\phi}}{r} could be neglected to simplify the quadratic form, thus facilitating the design of UPA codebooks. In line with this assumption, we investigate the near-field spherical-domain beam squint effect. We proceed by focusing on the beam pattern without the linear term and quadratic cross term, i.e.,

|𝓢(θ~,ϕ~,r)[k]|=\displaystyle\left|\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\right|= 1NR|mRy=MRyMRymRz=MRzMRzej2π((mRzd)22c(fk1θ~2rfc1θ~k¯2rk¯)+(mRyd)22c(fk1ϕ~2rfc1ϕ~k¯2rk¯))|\displaystyle\frac{1}{N_{R}}\left|\sum_{m_{R}^{y}=-M_{R}^{y}}^{M_{R}^{y}}\sum_{m_{R}^{z}=-M_{R}^{z}}^{M_{R}^{z}}e^{-j2\pi\left(\frac{(m^{z}_{R}d)^{2}}{2c}\left(f_{k}\frac{1-\widetilde{\theta}^{2}}{r}-f_{c}\frac{1-\widetilde{\theta}_{\bar{k}}^{2}}{r_{\bar{k}}}\right)+\frac{(m^{y}_{R}d)^{2}}{2c}\left(f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}\right)\right)}\right| (19)
=\displaystyle= 1NRy|mRy=MRyMRyej2π(mRyd)22c(fk1ϕ~2rfc1ϕ~k¯2rk¯)|×1NRz|mRz=MRzMRzej2π(mRzd)22c(fk1θ~2rfc1θ~k¯2rk¯)|\displaystyle\frac{1}{N_{R}^{y}}\left|\sum_{m_{R}^{y}=-M_{R}^{y}}^{M_{R}^{y}}e^{j2\pi\frac{(m^{y}_{R}d)^{2}}{2c}\left(f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}\right)}\right|\times\frac{1}{N_{R}^{z}}\left|\sum_{m_{R}^{z}=-M_{R}^{z}}^{M_{R}^{z}}e^{j2\pi\frac{(m^{z}_{R}d)^{2}}{2c}\left(f_{k}\frac{1-\widetilde{\theta}^{2}}{r}-f_{c}\frac{1-\widetilde{\theta}_{\bar{k}}^{2}}{r_{\bar{k}}}\right)}\right|
=\displaystyle= gy(ϕ~,r,k)gz(θ~,r,k).\displaystyle g_{y}(\widetilde{\phi},r,k)g_{z}(\widetilde{\theta},r,k).

Since the above product of summation is hard to handle, the following proposition gives the approximation.

Proposition 2.

Given the error function erf(x)2π0xet2dt{\rm erf}(x)\triangleq\frac{2}{\sqrt{\pi}}\int_{0}^{x}e^{-t^{2}}{\rm d}t, the pattern |𝓢(θ~,ϕ~,r)[k]|\left|\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\right| without the linear term and the quadratic cross term can be approximated by

|𝓢(θ~,ϕ~,r)[k]|g~y(ζϕ,k)g~z(ζθ,k)g~(ζϕ,k,ζθ,k)\displaystyle\left|\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\right|\approx\widetilde{g}_{y}(\zeta_{\phi,k})\widetilde{g}_{z}(\zeta_{\theta,k})\triangleq\widetilde{g}(\zeta_{\phi,k},\zeta_{\theta,k}) (20)

where g~y(ζϕ,k)=|1ζϕ,kNRyerf(1j22πζϕ,kNRy)|\widetilde{g}_{y}(\zeta_{\phi,k})=\left|\frac{1}{\sqrt{\zeta_{\phi,k}}N_{R}^{y}}{\rm erf}\left(\frac{1-j}{2\sqrt{2}}\sqrt{\pi\zeta_{\phi,k}}N_{R}^{y}\right)\right| and g~z(ζθ,k)=|1ζθ,kNRzerf(1j22πζθ,kNRz)|\widetilde{g}_{z}(\zeta_{\theta,k})=\left|\frac{1}{\sqrt{\zeta_{\theta,k}}N_{R}^{z}}{\rm erf}\left(\frac{1-j}{2\sqrt{2}}\sqrt{\pi\zeta_{\theta,k}}N_{R}^{z}\right)\right| with ζϕ,kd2c(fk1ϕ~2rfc1ϕ~k¯2rk¯)\zeta_{\phi,k}\triangleq\frac{d^{2}}{c}\left(f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}\right) and ζθ,kd2c(fk1θ~2rfc1θ~k¯2rk¯)\zeta_{\theta,k}\triangleq\frac{d^{2}}{c}\left(f_{k}\frac{1-\widetilde{\theta}^{2}}{r}-f_{c}\frac{1-\widetilde{\theta}_{\bar{k}}^{2}}{r_{\bar{k}}}\right).

Proof: Please see Appendix A. \blacksquare

Based on the analysis of the linear terms, we can determine ϕ~fcfkϕ~k¯\widetilde{\phi}\triangleq\frac{f_{c}}{f_{k}}\widetilde{\phi}_{\bar{k}} and θ~fcfkθ~k¯\widetilde{\theta}\triangleq\frac{f_{c}}{f_{k}}\widetilde{\theta}_{\bar{k}} to find the optimal value of rr that maximizes |𝓢(θ~,ϕ~,r)[k]|\left|\bm{\mathcal{S}}(\widetilde{\theta},\widetilde{\phi},r)[k]\right|. However, solving for rr analytically becomes challenging due to the multiplication of two error functions. Therefore, we resort to a numerical method to solve for rr by defining an inverse function g~1(fk,θ~k¯,ϕ~k¯,rk¯)\widetilde{g}^{-1}(f_{k},\widetilde{\theta}_{\bar{k}},\widetilde{\phi}_{\bar{k}},r_{\bar{k}}) that returns the solution of argmax𝑟g~(ζϕ,k,ζθ,k)\underset{r}{\rm arg\ max}\ \widetilde{g}(\zeta_{\phi,k},\zeta_{\theta,k}).

Refer to caption
Figure 3: A trajectory map in the spherical domain regarding {θ,ϕ,r,fk}\{\theta,\phi,r,f_{k}\}

Let us consider a wideband system with NRy=256N_{R}^{y}=256, NRz=4N_{R}^{z}=4, K=32K=32, and central frequency f=28f=28 GHz with a corresponding bandwidth of fs=4f_{s}=4 GHz. Assuming that the desired beam parameters for the central frequency are θ=ϕ=45\theta=\phi=45^{\circ} and r=20r=20 meters, a spherical-domain trajectory map with KK beams is depicted in Fig. 3. Analysis of the figure indicates that the beam point observed at the start and end points, i.e., (40.56,55.69,17.65)(40.56,55.69,17.65) and (48.6,38.57,22.28)(48.6,38.57,22.28), respectively, reflects the shift of beams at other frequencies when compared to the central frequency at (45,45,20)(45,45,20).

III-B Wideband Spherical-Domain Dictionary Design

For channel estimation using the CS technique, the virtual channel representation with dictionaries is a critical component. One commonly used method for designing an effective dictionary 𝐀N×G\mathbf{A}\in\mathbb{C}^{N\times G} is to minimize the total coherence μ=g1Gg2,g2g1G|[𝐀]:,g1H[𝐀]:,g2|\mu=\sum_{g_{1}}^{G}\sum_{g_{2},g_{2}\neq g_{1}}^{G}\left|[\mathbf{A}]_{:,g_{1}}^{H}[\mathbf{A}]_{:,g_{2}}\right|, which is equivalent to minimizing |[𝐀]:,g1H[𝐀]:,g2|\left|[\mathbf{A}]_{:,g_{1}}^{H}[\mathbf{A}]_{:,g_{2}}\right| for g1,g2\forall g_{1},g_{2}. To design the dictionaries 𝐀U[k]\mathbf{A}_{\rm U}[k] and 𝐁R[k]\mathbf{B}_{\rm R}[k], we first derive them with a narrowband system at frequency fcf_{c} and then obtain their wideband form.

It is well established that the 2D discrete Fourier transform (2D-DFT) matrix can be adopted to design the 2D angle sampling for dictionary 𝐀U[k¯]\mathbf{A}_{\rm U}[\bar{k}], which is given by

𝐀U[k¯]=\displaystyle\mathbf{A}_{\rm U}[{\bar{k}}]= {𝐚U(fc,ϑ~,ϕ~)|ϑ~=1,GUy+2GUy,,GUy2GUy,ϕ~=1,GUz+2GUz,,GUz2GUz},\displaystyle\left\{\mathbf{a}_{\rm U}(f_{c},\widetilde{\vartheta},\widetilde{\phi})|\widetilde{\vartheta}=-1,\frac{-G_{U}^{y}+2}{G_{U}^{y}},\cdots,\frac{G_{U}^{y}-2}{G_{U}^{y}},\widetilde{\phi}=-1,\frac{-G_{U}^{z}+2}{G_{U}^{z}},\cdots,\frac{G_{U}^{z}-2}{G_{U}^{z}}\right\}, (21)

where GUyGUz=GUG_{U}^{y}G_{U}^{z}=G_{U} is the total number of atoms.

We aim to orthogonalize two arbitrary atoms (with indices g1g_{1} and g2g_{2}, where g1g2g_{1}\neq g_{2}) in 𝐁R[k¯]\mathbf{B}_{\rm R}[\bar{k}] by minimizing the coherence, μg1,g2\mu_{g_{1},g_{2}}, approximating it to 0, where

μg1,g2=|𝐜RH(fc,θ~g1,ϕ~g1,rg1)𝐜R(fc,θ~g2,ϕ~g2,rg2)|.\mu_{g_{1},g_{2}}=\left|\mathbf{c}^{H}_{\rm R}(f_{c},\widetilde{\theta}_{g_{1}},\widetilde{\phi}_{g_{1}},r_{g_{1}})\mathbf{c}_{\rm R}(f_{c},\widetilde{\theta}_{g_{2}},\widetilde{\phi}_{g_{2}},r_{g_{2}})\right|. (22)

This method is similar to the one described in Eqn. (15), with the difference being that Section III-A focuses on exploring the maximal pattern gain on different subcarriers, while Section III-B discusses the minimal coherence of arbitrary atoms in a dictionary independent of the subcarrier index.

As the angle and distance parameters are coupled in μg1,g2\mu_{g_{1},g_{2}}, we separate the sampling of angle and distance, as done in [30]. By considering only the linear term of μg1,g2\mu_{g_{1},g_{2}} and assigning d=c2fcd=\frac{c}{2f_{c}}, it can be expressed as

μg1,g2=1NR|mRy=MRyMRymRz=MRzMRzejπ(mRy(ϕ~g2ϕ~g1)+mRz(θ~g2θ~g1))|.\displaystyle\mu_{g_{1},g_{2}}=\frac{1}{N_{R}}\left|\sum_{m_{R}^{y}=-M_{R}^{y}}^{M_{R}^{y}}\sum_{m_{R}^{z}=-M_{R}^{z}}^{M_{R}^{z}}e^{j\pi\left(m^{y}_{R}(\widetilde{\phi}_{g_{2}}-\widetilde{\phi}_{g_{1}})+m^{z}_{R}(\widetilde{\theta}_{g_{2}}-\widetilde{\theta}_{g_{1}})\right)}\right|. (23)

In this case, the method for sampling angles is the same as that described in Eqn. (21), which is designed using the 2D-DFT matrix.

After sampling the angle space, we focus on sampling the distance of each angle point. Since the angle is fixed (θ~g1=θ~g2=θ~\widetilde{\theta}_{g_{1}}=\widetilde{\theta}_{g_{2}}=\widetilde{\theta} and ϕ~g1=ϕ~g2=ϕ~\widetilde{\phi}_{g_{1}}=\widetilde{\phi}_{g_{2}}=\widetilde{\phi}), the distance sampling becomes solvable. The coherence, μg1,g2\mu_{g_{1},g_{2}}, can now be re-written as

μg1,g2=1NR|mRy=MRyMRymRz=MRzMRzejcπ4fc((mRz)2(1θ~2)+(mRy)2(1ϕ~2))(1rg21rg1)|.\displaystyle\mu_{g_{1},g_{2}}=\frac{1}{N_{R}}\left|\sum_{m_{R}^{y}=-M_{R}^{y}}^{M_{R}^{y}}\sum_{m_{R}^{z}=-M_{R}^{z}}^{M_{R}^{z}}e^{-j\frac{c\pi}{4f_{c}}\left({(m^{z}_{R})^{2}(1-\widetilde{\theta}^{2})}+{(m^{y}_{R})^{2}(1-\widetilde{\phi}^{2})}\right)\left(\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}\right)}\right|. (24)

It is important to note that the above equation is a special case of Eqn. (19), where fk=fcf_{k}=f_{c}, θ~=θ~k¯\widetilde{\theta}=\widetilde{\theta}_{\bar{k}} and ϕ~=ϕ~k¯\widetilde{\phi}=\widetilde{\phi}_{\bar{k}}. This can be directly solved by Prop. 2. Then, we have222This can also be derived with the Fresnel integral in reference [39].

μg1,g2g~(ζ¯ϕ,ζ¯θ),\mu_{g_{1},g_{2}}\approx\widetilde{g}(\overline{\zeta}_{\phi},\overline{\zeta}_{\theta}), (25)

where ζ¯ϕc4fc(1ϕ~2)(1rg21rg1)\overline{\zeta}_{\phi}\triangleq\frac{c}{4f_{c}}\left({1-\widetilde{\phi}^{2}}\right)\left(\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}\right), ζ¯θc4fc(1θ~2)(1rg21rg1)\overline{\zeta}_{\theta}\triangleq\frac{c}{4f_{c}}\left({1-\widetilde{\theta}^{2}}\right)\left(\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}\right), and g~(,)\widetilde{g}(\cdot,\cdot) is defined in Prop. 2.

Then, we aim at minimizing μg1,g2\mu_{g_{1},g_{2}} with respect to 1rg21rg1\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}. However, obtaining a closed solution for distance sampling is challenging due to the product of two error functions. Fortunately, it is possible to sample 1rg1\frac{1}{r_{g_{1}}} and 1rg2\frac{1}{r_{g_{2}}} with a linear approach based on the numerical solution. Let us define a function e(1rg21rg1)|g~(ζ¯ϕ,ζ¯θ)|e(\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}})\triangleq|\widetilde{g}(\overline{\zeta}_{\phi},\overline{\zeta}_{\theta})| with respect to distance sampling. Assuming that rg2<rg1r_{g_{2}}<r_{g_{1}}, it can be established that e(1rg21rg1)e(\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}) decreases as 1rg21rg1\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}} increases from the general trend since the function e()e(\cdot) has a form of erf(ax)erf(bx)cx\frac{{\rm erf}(a\sqrt{x}){\rm erf}(b\sqrt{x})}{cx}.

Defining an inverse function e1(μm,θ~,ϕ~){e}^{-1}(\mu_{m},\widetilde{\theta},\widetilde{\phi}) that returns the solution of

argmax1rg21rg1e(1rg21rg1)=μm,\underset{\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}}{\rm arg\ max}\ {e}\left(\frac{1}{r_{g_{2}}}-\frac{1}{r_{g_{1}}}\right)=\mu_{m}, (26)

with the input variables θ~\widetilde{\theta}, ϕ~\widetilde{\phi}, and the minimal acceptable coherence μm\mu_{m}. This indicates that reciprocal distance can be linearly sampled.

To construct the narrowband dictionary 𝐁R[k¯]\mathbf{B}_{\rm R}[\bar{k}], the following procedure is designed. First, determining the angle set {θ~k¯,iz,ϕ~k¯,iy}iz=1,iy=1GRz,GRy\{\widetilde{\theta}_{\bar{k},i_{z}},\widetilde{\phi}_{\bar{k},i_{y}}\}_{i_{z}=1,i_{y}=1}^{G_{R}^{z},G_{R}^{y}} with θ~k¯,iz=1+2GRz\widetilde{\theta}_{\bar{k},i_{z}}=-1+\frac{2}{G_{\rm R}^{z}} and ϕ~k¯,iy=1+2GRy\widetilde{\phi}_{\bar{k},i_{y}}=-1+\frac{2}{G_{\rm R}^{y}}. Then, for each angle direction {θ~k¯,iz,ϕ~k¯,iy}\{\widetilde{\theta}_{\bar{k},i_{z}},\widetilde{\phi}_{\bar{k},i_{y}}\}, the distance parameter {rk¯,iy,iz,ir}ir=1GRr\{r_{\bar{k},i_{y},i_{z},i_{r}}\}_{i_{r}=1}^{G_{R}^{r}} can be obtained by 1rk¯,iy,iz,ir=1rminire1(μm,θ~k¯,iz,ϕ~k¯,iy)\frac{1}{r_{\bar{k},i_{y},i_{z},i_{r}}}=\frac{1}{r_{\rm min}}-i_{r}{e}^{-1}(\mu_{m},\widetilde{\theta}_{\bar{k},i_{z}},\widetilde{\phi}_{\bar{k},i_{y}}), where rminr_{\rm min} is the allowed minimal communication distance, and 1rk¯,iy,iz,ir>0\frac{1}{r_{\bar{k},i_{y},i_{z},i_{r}}}>0. Finally, 𝐁R[k¯]NR×GR\mathbf{B}_{\rm R}[\bar{k}]\in\mathbb{C}^{N_{R}\times G_{R}} can be obtained with the response vector of Eqn. (14) , where GRG_{R} represents the number of all atoms.

Input: The size of array apertures {NRz,NRy}\{N_{R}^{z},N_{R}^{y}\}, the size of sampling points {GRz,GRy}\{G_{R}^{z},G_{R}^{y}\}, and the number of subcarriers KK.
Output: Wideband spherical-domain dictionary {𝐁R[k]}k=1K\{\mathbf{B}_{\rm R}[k]\}_{k=1}^{K}.
1 begin
2       for k=1,2,,Kk=1,2,\cdots,K do
3             for iz=1,2,,GRzi_{z}=1,2,\cdots,G_{\rm R}^{z} do
4                   θ~k¯,iz=1+2izGRz\widetilde{\theta}_{\bar{k},i_{z}}=-1+\frac{2i_{z}}{G_{\rm R}^{z}}.
5                   for iy=1,2,,GRzi_{y}=1,2,\cdots,G_{\rm R}^{z} do
6                         ϕ~k¯,iy=1+2iyGRy\widetilde{\phi}_{\bar{k},i_{y}}=-1+\frac{2i_{y}}{G_{\rm R}^{y}};
7                         rk¯,iy,iz,ir=1re1(μm,θ~k¯,iz,ϕ~k¯,iy)r_{\bar{k},i_{y},i_{z},i_{r}}=\frac{1}{r}-{e}^{-1}(\mu_{m},\widetilde{\theta}_{\bar{k},i_{z}},{\widetilde{\phi}_{\bar{k},i_{y}}}).
8                         if 1rk¯,iy,iz,ir>0\frac{1}{r_{\bar{k},i_{y},i_{z},i_{r}}}>0 then
9                               𝐁R[k]𝐁R[k]𝐜R(fk,θ~k¯,iz,ϕ~k¯,iy,rk¯,iy,iz,ir)\mathbf{B}_{\rm R}[k]\leftarrow\mathbf{B}_{\rm R}[k]\cup\mathbf{c}_{\rm R}(f_{k},\widetilde{\theta}_{\bar{k},i_{z}},\widetilde{\phi}_{\bar{k},i_{y}},r_{\bar{k},i_{y},i_{z},i_{r}}).
10                        else
11                              break.
12                        
13                  
14            
15      
16
return {𝐁R[k]}k=1K\{\mathbf{B}_{\rm R}[k]\}_{k=1}^{K}
Algorithm 1 Wideband Spherical-Domain Dictionary Design

In this context, the development of the wideband dictionary can be achieved by utilizing the response vector with various frequencies. Basically, the wideband spherical-domain dictionary is developed according to Algorithm 1. Although the inverse function necessitates numerical computation, the dictionary can be generated offline and subsequently utilized for online channel estimation.

IV Near- and Far-Field Channel Parameter Recovery

Leveraging on the designed dictionary, the channel parameters can be recovered using the CS theory. Substituting the sparse channel representation (13) into the signal model (8) results in

𝐘[k]=\displaystyle\mathbf{Y}[k]= 𝐕~[k]𝐇U[k]𝐅[k]+𝐍~[k]\displaystyle\widetilde{\mathbf{V}}[k]\mathbf{H}_{\rm U}[k]\mathbf{F}[k]+\widetilde{\mathbf{N}}[k] (27)
\displaystyle\approx 𝐕~[k]𝐁R[k]𝚵[k]𝐀UH[k]𝐅[k]+𝐍~[k].\displaystyle\widetilde{\mathbf{V}}[k]\mathbf{B}_{\rm R}[k]\bm{\Xi}[k]\mathbf{A}_{\rm U}^{H}[k]\mathbf{F}[k]+\widetilde{\mathbf{N}}[k].

One straightforward approach to recovering the parameter set {ϕ,θ,r,φ,ϑ}\{\phi,\theta,r,\varphi,\vartheta\} is the KCS framework, which converts the multi-dimensional recovery problem into a 1D recovery problem. Vectoring 𝐘[k]\mathbf{Y}[k] and ignoring the noise yield

vec(𝐘[k])((𝐀UH[k]𝐅[k])T𝐕~[k]𝐁R[k])vec(𝚵[k]).\displaystyle{\rm vec}(\mathbf{Y}[k])\approx\left((\mathbf{A}_{\rm U}^{H}[k]\mathbf{F}[k])^{T}\otimes\widetilde{\mathbf{V}}[k]\mathbf{B}_{\rm R}[k]\right){\rm vec}(\bm{\Xi}[k]). (28)

By denoting 𝐲̊[k]vec(𝐘[k])QNX×1\mathbf{\mathring{y}}[k]\triangleq{\rm vec}(\mathbf{Y}[k])\in\mathbb{C}^{QN_{X}\times 1}, 𝝃̊[k]vec(𝚵[k])GUGR×1\bm{\mathring{\xi}}[k]\triangleq{\rm vec}(\bm{\Xi}[k])\in\mathbb{C}^{G_{U}G_{R}\times 1}, and 𝚽̊[k](𝐀UH[k]𝐅[k])T(𝐕~[k]𝐁R[k])QNX×GUGR\bm{\mathring{\Phi}}[k]\triangleq(\mathbf{A}_{\rm U}^{H}[k]\mathbf{F}[k])^{T}\otimes\left(\widetilde{\mathbf{V}}[k]\mathbf{B}_{\rm R}[k]\right)\in\mathbb{C}^{QN_{X}\times G_{U}G_{R}}, the following CS recovery problem is formulated for k\forall k:

(𝐏𝟏)\displaystyle\mathbf{(P1)} argmin𝝃̊[k]𝝃̊[k]0\displaystyle\ \ \ \underset{\bm{\mathring{\xi}}[k]}{\rm arg\ min}\left\|\bm{\mathring{\xi}}[k]\right\|_{0} (29)
s.t.𝐲̊[k]𝚽̊[k]𝝃̊[k]22ϵ,\displaystyle{\rm s.t.}\ \left\|\mathbf{\mathring{y}}[k]-\bm{\mathring{\Phi}}[k]\bm{\mathring{\xi}}[k]\right\|_{2}^{2}\leq\epsilon,

where ϵ\epsilon is the precise factor.

Although the channel parameter can be recovered in this way, it is computationally intensive since the Kronecker product generates a lengthy vector and large-scale dictionary. In XL systems, this method is too computationally expensive to use. Moreover, it is challenging to get high-resolution data with this framework due to the coupling of several parameters.

In order to avoid globally processing the lengthy signal and the Kronecker dictionary, we develop the MMPSR method, for fast and effective recovery of {𝚵[k]}k=1K\{\bm{\Xi}[k]\}_{k=1}^{K}. Denoting 𝚽R[k]𝐕~[k]𝐁R[k]\bm{\Phi}_{\rm R}[k]\triangleq\widetilde{\mathbf{V}}[k]\mathbf{B}_{\rm R}[k] and 𝚽U[k]𝐅H[k]𝐀U[k]\bm{\Phi}_{\rm U}[k]\triangleq\mathbf{F}^{H}[k]\mathbf{A}_{\rm U}[k], Eqn. (8) is re-written as

𝐘[k]𝚽R[k]𝚵[k]𝚽UH[k]+𝐍~[k].\mathbf{Y}[k]\approx\bm{\Phi}_{\rm R}[k]\bm{\Xi}[k]\bm{\Phi}^{H}_{\rm U}[k]+\widetilde{\mathbf{N}}[k]. (30)

Note that each atom within the wideband spherical dictionary across all subcarriers is generated using a common channel parameter, hence referred to as the common support, i.e.,

supp(𝚵[k1])=supp(𝚵[k2]),k1,k2=1,,K,k1k2,{\rm supp}(\bm{\Xi}[k_{1}])={\rm supp}(\bm{\Xi}[k_{2}]),\ \forall k_{1},k_{2}=1,\cdots,K,\ k_{1}\neq k_{2}, (31)

where supp()\rm supp(\cdot) denotes the sparsity support which contains the non-zero index of a sparse vector/matrix.

To jointly recover the channel parameter with the common sparsity support on all subcarriers, the multi-frequency recovery problem is formulated as

(𝐏𝟐)argmin𝚵[k]k=1K𝚵[k]0\displaystyle\mathbf{(P2)}\ \ \ \ \underset{\bm{{\Xi}}[k]}{\rm arg\ min}\sum_{k=1}^{K}\left\|\bm{{\Xi}}[k]\right\|_{0} (32)
s.t.supp(𝚵[1])==supp(𝚵[K]),\displaystyle\ \ \ \ \ {\rm s.t.}\ {\rm supp}(\bm{{\Xi}}[1])=\cdots={\rm supp}(\bm{{\Xi}}[K]),
k=1K𝐘[k]𝚽R[k]𝚵[k]𝚽UH[k]22ϵ.\displaystyle\ \ \ \ \ \ \sum_{k=1}^{K}\left\|\mathbf{{Y}}[k]-\bm{\Phi}_{\rm R}[k]\bm{\Xi}[k]\bm{\Phi}^{H}_{\rm U}[k]\right\|_{2}^{2}\leq\epsilon.

This problem bears resemblance to the multiple measurement vector problem [41], which capitalizes on the sparsity of various snapshots to retrieve the signal through a common sensing matrix. However, the distinguishing factor is that the sensing matrix 𝚽̊[k]\bm{\mathring{\Phi}}[k] is reliant on the subcarrier index.

To resolve problem (P2), one can identify the atom support and subsequently obtain an estimated channel using the 2D-LS estimator. The following proposition is formulated to reconstruct the channel through the utilization of the atom support.

Proposition 3.

Given the estimated channel supports 𝐁^R[k]\widehat{\mathbf{B}}_{\rm R}[k] and 𝐀^U[k]\widehat{\mathbf{A}}_{\rm U}[k], the RIS-user channel can be reconstructed by

𝐇^U[k]=𝐁^R[k](𝚽^RH[k]𝚽^R[k])1𝚽^RH[k]𝐘[k]𝚽^U[k](𝚽^UH[k]𝚽^U[k])1𝐀^UH[k],\widehat{\mathbf{H}}_{\rm U}[k]=\widehat{\mathbf{B}}_{{\rm R}}[k]\left(\widehat{\bm{\Phi}}_{{\rm R}}^{H}[k]\widehat{\bm{\Phi}}_{{\rm R}}[k]\right)^{-1}\widehat{\bm{\Phi}}_{{\rm R}}^{H}[k]\mathbf{Y}[k]\widehat{\bm{\Phi}}_{{\rm U}}[k]\left(\widehat{\bm{\Phi}}_{{\rm U}}^{H}[k]\widehat{\bm{\Phi}}_{{\rm U}}[k]\right)^{-1}\widehat{\mathbf{A}}_{{\rm U}}^{H}[k], (33)

where 𝚽^R[k]𝐕~[k]𝐁^R[k]\widehat{\bm{\Phi}}_{\rm R}[k]\triangleq\widetilde{\mathbf{V}}[k]\widehat{\mathbf{B}}_{\rm R}[k] and 𝚽^U[k]𝐅H[k]𝐀^U[k]\widehat{\bm{\Phi}}_{\rm U}[k]\triangleq\mathbf{F}^{H}[k]\widehat{\mathbf{A}}_{\rm U}[k].

Proof: With the estimator channel support, Eqn. (30) can be expressed as

𝐘[k]𝚽^R[k]𝚵^[k]𝚽^UH[k]+𝐍~[k],\mathbf{Y}[k]\approx\widehat{\bm{\Phi}}_{\rm R}[k]\widehat{\bm{\Xi}}[k]\widehat{{\bm{\Phi}}}^{H}_{\rm U}[k]+\widetilde{\mathbf{N}}[k], (34)

Via the 2D-LS estimator in Prop. 1, 𝚵^[k]\widehat{\bm{\Xi}}[k] is then got by

𝚵^[k]=(𝚽^RH[k]𝚽^R[k])1𝚽^RH[k]𝐘[k]𝚽^U[k](𝚽^UH[k]𝚽^U[k])1.\widehat{\bm{\Xi}}[k]=\left(\widehat{\bm{\Phi}}_{{\rm R}}^{H}[k]\widehat{\bm{\Phi}}_{{\rm R}}[k]\right)^{-1}\widehat{\bm{\Phi}}_{{\rm R}}^{H}[k]\mathbf{Y}[k]\widehat{\bm{\Phi}}_{{\rm U}}[k]\left(\widehat{\bm{\Phi}}_{{\rm U}}^{H}[k]\widehat{\bm{\Phi}}_{{\rm U}}[k]\right)^{-1}. (35)

Thus, the estimated channel can be written as

𝐇^U[k]=𝐁^R[k]𝚵^[k]𝐀^UH[k].\widehat{\mathbf{H}}_{\rm U}[k]=\widehat{\mathbf{B}}_{{\rm R}}[k]\widehat{\bm{\Xi}}[k]\widehat{\mathbf{A}}_{{\rm U}}^{H}[k]. (36)

The proof is complete. \blacksquare

By relying on the insight provided by Prop. 3, the task of determining the channel support, which corresponds to recovering the channel parameters, can be accomplished without resorting to the Kronecker product. This is achievable by taking into account the 2D structure of 𝚵[k]\bm{\Xi}[k]. Additionally, it is beneficial to leverage the common sparsity support exhibited in problem (P2) to improve channel estimation. In light of this, we draw inspiration from the parallelizable CS framework [42] and put forth Prop. 4 to address the task of solving for the common channel support.

Proposition 4.

Consider singular value decomposition (SVD) for 𝐘[k]=𝐓R[k]𝚺[k]𝐓UH[k]𝐓¯R[k]𝚺¯[k]𝐓¯U[k]\mathbf{Y}[k]=\mathbf{T}_{\rm R}[k]\bm{\Sigma}[k]\mathbf{T}_{\rm U}^{H}[k]\approx\overline{\mathbf{T}}_{\rm R}[k]\overline{\bm{\Sigma}}[k]\overline{\mathbf{T}}_{\rm U}[k], where 𝐓¯R[k]Q×P\overline{\mathbf{T}}_{\rm R}[k]\in\mathbb{C}^{Q\times P}, 𝚺¯[k]P×P\overline{\bm{\Sigma}}[k]\in\mathbb{C}^{P\times P}, and 𝐓¯U[k]P×NX\overline{\mathbf{T}}_{\rm U}[k]\in\mathbb{C}^{P\times N_{X}} are the decomposed matrices corresponding to the largest PP singular values. Then, the atom supports ΛR\Lambda_{\rm R} and ΛU\Lambda_{\rm U} are {supp(𝛏R,p[k])}p=1P\{{\rm supp}(\bm{\xi}_{{\rm R},p}[k])\}_{p=1}^{P} and {supp(𝛏U,p[k])}p=1P\{{\rm supp}(\bm{\xi}_{{\rm U},p}[k])\}_{p=1}^{P}, respectively, where 𝛏R,p[k]GR×1\bm{\xi}_{{\rm R},p}[k]\in\mathbb{C}^{G_{R}\times 1} and 𝛏U,p[k]GU×1\bm{\xi}_{{\rm U},p}[k]\in\mathbb{C}^{G_{U}\times 1}, for p\forall p, are the 1-sparse vectors, which can be obtained by solving the following problem.

(𝐏𝟑)argmin𝝃i,p[k]k=1K𝝃i,p[k]0\displaystyle\mathbf{(P3)}\ \ \ \ \underset{\bm{{\xi}}_{i,p}[k]}{\rm arg\ min}\sum_{k=1}^{K}\left\|\bm{{\xi}}_{i,p}[k]\right\|_{0} (37)
s.t.supp(𝝃i,p[1])==supp(𝝃i,p[K]),\displaystyle\ \ \ {\rm s.t.}\ {\rm supp}(\bm{{\xi}}_{i,p}[1])=\cdots={\rm supp}(\bm{{\xi}}_{i,p}[K]),
k=1K𝐭~i,p[k]𝚽i[k]𝝃i,p[k]22ϵ,\displaystyle\ \ \ \ \ \ \sum_{k=1}^{K}\left\|\widetilde{\mathbf{{t}}}_{i,p}[k]-\bm{{\Phi}}_{i}[k]\bm{{\xi}}_{i,p}[k]\right\|_{2}^{2}\leq\epsilon,

where the subscript i{R,U}i\in\{\rm R,U\}, 𝐭~R,p[k]\widetilde{\mathbf{t}}_{{\rm R},p}[k] and 𝐭~U,p[k]\widetilde{\mathbf{t}}_{{\rm U},p}[k] represent the pp-th column of 𝐓¯R[k](𝚺¯[k])12\overline{\mathbf{T}}_{\rm R}[k](\overline{\bm{\Sigma}}[k])^{\frac{1}{2}} and 𝐓¯U[k](𝚺¯H[k])12\overline{\mathbf{T}}_{\rm U}[k](\overline{\bm{\Sigma}}^{H}[k])^{\frac{1}{2}}, respectively.

Proof: Please see Appendix B. \blacksquare

Input: The received signal 𝐘[k]\mathbf{Y}[k], measurement matrices 𝐕~[k]\widetilde{\mathbf{V}}[k] and 𝐅[k]\mathbf{F}[k], dictionaries 𝐁R[k]\mathbf{B}_{\rm R}[k] and 𝐀U[k]\mathbf{A}_{\rm U}[k] , k=1,,K\forall k=1,\cdots,K.
Output: Estimated channels {𝐇U[k]}k=1K\{\mathbf{H}_{\rm U}[k]\}_{k=1}^{K}.
1 begin
2       Construct 𝚽R[k]𝐕~[k]𝐁R[k]\bm{\Phi}_{\rm R}[k]\triangleq\widetilde{\mathbf{V}}[k]\mathbf{B}_{\rm R}[k] and 𝚽U[k]𝐅H[k]𝐀U[k]\bm{\Phi}_{\rm U}[k]\triangleq\mathbf{F}^{H}[k]\mathbf{A}_{\rm U}[k].
3       Obtain 𝐘[k]𝐓¯R[k]𝚺¯[k]𝐓¯U[k]\mathbf{Y}[k]\approx\overline{\mathbf{T}}_{\rm R}[k]\overline{\bm{\Sigma}}[k]\overline{\mathbf{T}}_{\rm U}[k] via SVD.
4       for p=1,2,,Pp=1,2,\cdots,P do
5            
6            for  k=1,2,,Kk=1,2,\cdots,K  do
7                  Calculate the CC vectors 𝝆̊R,p[k]\mathring{\bm{\rho}}_{{\rm R},p}[k] and 𝝆̊U,p[k]\mathring{\bm{\rho}}_{{\rm U},p}[k] based on Eqn. (38).
8            g̊r,p=argmaxgrk=1K|[𝝆̊R,p[k]]gr|\mathring{g}_{r,p}=\underset{{g}_{r}}{\rm arg\ max}\ \sum_{k=1}^{K}\left|\left[\mathring{\bm{\rho}}_{{\rm R},p}[k]\right]_{g_{r}}\right|, g̊u,p=argmaxguk=1K|[𝝆̊U,p[k]]gu|\mathring{g}_{u,p}=\underset{{g}_{u}}{\rm arg\ max}\ \sum_{k=1}^{K}\left|\left[\mathring{\bm{\rho}}_{{\rm U},p}[k]\right]_{g_{u}}\right|.
9             Obtain the estimated parameters {θ̊p,ϕ̊p,r̊p,ϑ̊p,φ̊p}\{\mathring{\theta}_{p},\mathring{\phi}_{p},\mathring{r}_{p},\mathring{\vartheta}_{p},\mathring{\varphi}_{p}\} according to g̊r,p\mathring{g}_{r,p} and g̊u,p\mathring{g}_{u,p}.
10             for  k=1,2,,Kk=1,2,\cdots,K  do
11                  Calculate the refined CC vectors 𝝆˘R,p[k]\breve{\bm{\rho}}_{{\rm R},p}[k] and 𝝆˘U,p[k]\breve{\bm{\rho}}_{{\rm U},p}[k] based on Eqn. (38).
12            g˘r,p=argmaxgrk=1K|[𝝆˘R,p[k]]gr|\breve{g}_{r,p}=\underset{{g}_{r}}{\rm arg\ max}\ \sum_{k=1}^{K}|\left[\breve{\bm{\rho}}_{{\rm R},p}[k]\right]_{g_{r}}|, g˘u,p=argmaxguk=1K|[𝝆˘U,p[k]]gu|\breve{g}_{u,p}=\underset{{g}_{u}}{\rm arg\ max}\ \sum_{k=1}^{K}|\left[\breve{\bm{\rho}}_{{\rm U},p}[k]\right]_{g_{u}}|.
13             Obtain the refined parameters {θ˘p,ϕ˘p,r˘p,ϑ˘p,φ˘p}\{\breve{\theta}_{p},\breve{\phi}_{p},\breve{r}_{p},\breve{\vartheta}_{p},\breve{\varphi}_{p}\} according to g˘r,p\breve{g}_{r,p} and g˘u,p\breve{g}_{u,p}.
14      for k=1,2,,Kk=1,2,\cdots,K do
15             Reconstruct the channel 𝐇U[k]\mathbf{H}_{\rm U}[k] according to the refined parameters and Prop. 3.
16      
17
return {𝐇U[k]}k=1K\{\mathbf{H}_{\rm U}[k]\}_{k=1}^{K}
Algorithm 2 Multi-Measurement Parallelizable Subspace Recovery
Remark 2.

This framework enables the decoupling of the high-dimensional recovery problem into a series of simple subproblems that can be solved in parallel. Additionally, the size of the dictionary for each subproblem is small, which reduces complexity and facilitates super-resolution or refined procedures.

Based on Prop. 4 and Prop. 3, problem (P2) is simplified into problem (P3), which can be solved by the following steps.

IV-1 CC-Based Atom Matching

Atom matching is an effective solution for problem (P3) due to the 11-sparsity of 𝝃i,p[k]\bm{{\xi}}_{i,p}[k]. In the greedy recovery algorithms (such as OMP and subspace pursuit), atom matching is performed by taking the inner product of the measured vector and the atom. Since the inner product depends not only on the phase but also on the modulus, the matching result can be influenced by the modulus of the atom, which varies for each atom in the sensing matrix. However, we are only concerned with the accuracy of the matched phase. To address this, we use CC which relies only on the phase difference between two vectors to perform atom matching.

Consider the two arbitrary vectors 𝐱N×1\mathbf{x}\in\mathbb{C}^{N\times 1} and 𝐲N×1\mathbf{y}\in\mathbb{C}^{N\times 1}, the CC is given by

ρ=n=1N(𝐱n𝐱¯n)(𝐲n𝐲¯n)n=1N(𝐱n𝐱¯n)2n=1N(𝐲n𝐲¯n)2,\rho=\frac{\sum_{n=1}^{N}(\mathbf{x}_{n}-{\bar{\mathbf{x}}_{n}})(\mathbf{y}_{n}-{\bar{\mathbf{y}}_{n}})}{\sqrt{\sum_{n=1}^{N}(\mathbf{x}_{n}-{\bar{\mathbf{x}}_{n}})^{2}}\sqrt{\sum_{n=1}^{N}(\mathbf{y}_{n}-{\bar{\mathbf{y}}_{n}})^{2}}}, (38)

where 𝐱n[𝐱]n\mathbf{x}_{n}\triangleq[\mathbf{x}]_{n}, 𝐲n[𝐲]n\mathbf{y}_{n}\triangleq[\mathbf{y}]_{n}, 𝐱¯n1Nn=1N[𝐱]n\bar{\mathbf{x}}_{n}\triangleq\frac{1}{N}\sum_{n=1}^{N}[\mathbf{x}]_{n}, and 𝐲¯n1Nn=1N[𝐲]n\bar{\mathbf{y}}_{n}\triangleq\frac{1}{N}\sum_{n=1}^{N}[\mathbf{y}]_{n}.

According to Eqn. (38), we define the CC vector 𝝆̊i,p[k]Gi×1\mathring{\bm{\rho}}_{i,p}[k]\in\mathbb{C}^{G_{i}\times 1} (i{R,U},p{1,,P}i\in\{{\rm R,U}\},p\in\{1,\cdots,P\}), which consists of the CCs between 𝐭~i,p[k]\widetilde{\mathbf{t}}_{i,p}[k] and the columns of 𝚽i[k]\bm{\Phi}_{i}[k].

IV-2 Joint Multi-Frequency Processing

The vector 𝝆̊i,p[k]\mathring{\bm{\rho}}_{i,p}[k] specifies the atom to be used to represent 𝐭~i,p[k]\widetilde{\mathbf{t}}_{i,p}[k]. According to Eqn. (31), the best atom for {i,p}\forall\{i,p\} can be selected across all subcarriers. Defining g̊r,p\mathring{g}_{r,p} and g̊u,p\mathring{g}_{u,p} as the indices of the best atoms 𝝃R,p[k]\bm{\xi}_{{\rm R},p}[k] and 𝝃U,p[k]\bm{\xi}_{{\rm U},p}[k], k\forall k, respectively, and we have g̊r,p=argmaxgrk=1K|[𝝆̊R,p[k]]gr|\mathring{g}_{r,p}=\underset{{g}_{r}}{\rm arg\ max}\ \sum_{k=1}^{K}|\left[\mathring{\bm{\rho}}_{{\rm R},p}[k]\right]_{g_{r}}|, g̊u,p=argmaxguk=1K|[𝝆̊U,p[k]]gu|\mathring{g}_{u,p}=\underset{{g}_{u}}{\rm arg\ max}\ \sum_{k=1}^{K}|\left[\mathring{\bm{\rho}}_{{\rm U},p}[k]\right]_{g_{u}}|.

IV-3 Parameter Refinement

It should be noted that the estimation error depends on the resolution of the dictionary. However, in order to avoid high computing costs and reduce storage burden, the dictionary is always low-resolution, which may lead to a high channel estimation error, particularly in multi-parameter recovery problems. Therefore, designing a refinement procedure for the atom support is essential for improving estimation performance.

Let us consider angle refinement first. The angles that correspond to the estimated support are defined by {θ̊p,ϕ̊p,ϑ̊p,φ̊p}\{\mathring{\theta}_{p},\mathring{\phi}_{p},\mathring{\vartheta}_{p},\mathring{\varphi}_{p}\} for p\forall p. Note that the estimated angles are distributed between the two sampling points of their respective dictionaries. Refined angles {θ˘p,ϕ˘p,ϑ˘p,φ˘p}\{\breve{\theta}_{p},\breve{\phi}_{p},\breve{\vartheta}_{p},\breve{\varphi}_{p}\} can be obtained by sampling uniformly with angle stepsizes {Δθ,Δϕ,Δϑ,Δφ}\{\Delta_{\theta},\Delta_{\phi},\Delta_{\vartheta},\Delta_{\varphi}\}, such as θ˘{θ~|θ~=θ̊1GRz:Δθ:θ̊+1GRz}\breve{\theta}\in\left\{\widetilde{\theta}\Big{|}\widetilde{\theta}=\mathring{\theta}-\frac{1}{G_{R}^{z}}:\Delta_{\theta}:\mathring{\theta}+\frac{1}{G_{R}^{z}}\right\} and ϑ˘{ϑ~|ϑ~=ϑ̊1GUy:Δϑ:ϑ̊+1GUy}\breve{\vartheta}\in\left\{\widetilde{\vartheta}\Big{|}\widetilde{\vartheta}=\mathring{\vartheta}-\frac{1}{G_{U}^{y}}:\Delta_{\vartheta}:\mathring{\vartheta}+\frac{1}{G_{U}^{y}}\right\}. Likewise, the refined distance r˘\breve{r} can be derived from a new sample point set with the distance stepsize Δr\Delta_{r}: 1r˘{1r|1r=1r̊e1(μm,θ̊,ϕ̊)2:Δr:1r̊+e1(μm,θ̊,ϕ̊)2}\frac{1}{\breve{r}}\in\left\{\frac{1}{r}\Big{|}\frac{1}{r}=\frac{1}{\mathring{r}}-\frac{{e}^{-1}(\mu_{m},\mathring{{\theta}},{\mathring{\phi}})}{2}:\Delta_{r}:\frac{1}{\mathring{r}}+\frac{{e}^{-1}(\mu_{m},\mathring{{\theta}},{\mathring{\phi}})}{2}\right\}. With the new sampling points, parameters can be refined by atom matching and joint multi-frequency processing as described above. Specifically, the CC vector between the refined spherical-domain support generated by the above parameters and 𝐭~R,p[k]\widetilde{\mathbf{t}}_{{\rm R},p}[k] is denoted by 𝝆˘R,p[k]4e1(μm,θ̊,ϕ̊)GRzGRyΔR×1\breve{\bm{\rho}}_{{\rm R},p}[k]\in\mathbb{C}^{\frac{4{e}^{-1}(\mu_{m},\mathring{{\theta}},{\mathring{\phi}})}{G_{\rm R}^{z}G_{\rm R}^{y}\Delta_{\rm R}}\times 1} for k\forall k, where ΔRΔθΔϕΔr\Delta_{\rm R}\triangleq\Delta_{\theta}\Delta_{\phi}\Delta_{r}. Similarly, the CC vector regarding the refined angular-domain support is denoted by 𝝆˘U,p4GUΔU×1\breve{\bm{\rho}}_{{\rm U},p}\in\mathbb{C}^{\frac{4}{G_{\rm U}\Delta_{\rm U}}\times 1} for k\forall k, where ΔU=ΔϑΔφ\Delta_{\rm U}=\Delta_{\vartheta}\Delta_{\varphi}. Then, the best indices {g˘r,p,g˘u,p}\{\breve{g}_{r,p},\breve{g}_{u,p}\} can be found by g˘r,p=argmaxgrk=1K|[𝝆˘R,p[k]]gr|\breve{g}_{r,p}=\underset{{g}_{r}}{\rm arg\ max}\ \sum_{k=1}^{K}|\left[\breve{\bm{\rho}}_{{\rm R},p}[k]\right]_{g_{r}}|, g˘u,p=argmaxguk=1K|[𝝆˘U,p[k]]gu|\breve{g}_{u,p}=\underset{{g}_{u}}{\rm arg\ max}\ \sum_{k=1}^{K}|\left[\breve{\bm{\rho}}_{{\rm U},p}[k]\right]_{g_{u}}|.

V Lower Bound Derivation

Based on the oracle least squares (OLS) estimator [43, 44] that serves as the lower bound with the perfectly known channel support, this paper proposes a 2D-OLS estimator for 2D-CS and derives its theoretical NMSE bound.

Recalling Eqn. (1), the channel is re-written by a compact form: 𝐇U[k]𝐁¯R[k]𝚵¯[k]𝐀¯UH[k]\mathbf{H}_{\rm U}[k]\triangleq\overline{\mathbf{B}}_{\rm R}[k]\overline{\bm{\Xi}}[k]\overline{\mathbf{A}}_{\rm U}^{H}[k], where 𝐁¯R[k][𝐛R(fk,rR,1),,𝐛R(fk,rR,P)]\overline{\mathbf{B}}_{\rm R}[k]\triangleq[\mathbf{b}_{\rm R}(f_{k},r_{R,1}),\cdots,\mathbf{b}_{\rm R}(f_{k},r_{R,P})], 𝚵¯[k]NUNRPdiag([β1ej2πτ1fk,,βPej2πτPfk])\overline{\bm{\Xi}}[k]\triangleq\sqrt{\frac{N_{U}N_{R}}{P}}{\rm diag}([\beta_{1}e^{-j2\pi\tau_{1}f_{k}},\cdots,\beta_{P}e^{-j2\pi\tau_{P}f_{k}}]), and 𝐀¯U[k][𝐚U(fk,ϑ~U,1,φ~U,1),,𝐚U(fk,ϑ~U,P,φ~U,P)]\overline{\mathbf{A}}_{\rm U}[k]\triangleq[\mathbf{a}_{\rm U}(f_{k},\widetilde{\vartheta}_{U,1},\widetilde{\varphi}_{U,1}),\cdots,\mathbf{a}_{\rm U}(f_{k},\widetilde{\vartheta}_{U,P},\widetilde{\varphi}_{U,P})].

The 2D-OLS solution, with the known response vectors 𝐁¯R[k]\overline{\mathbf{B}}_{\rm R}[k] and 𝐀¯U[k]\overline{\mathbf{A}}_{\rm U}[k], is given by

𝚵¯^[k]=(𝚽¯RH[k]𝚽¯R[k])1𝚽¯RH[k]𝐘[k]𝚽¯U[k](𝚽¯UH[k]𝚽¯U[k])1,\widehat{\overline{\bm{\Xi}}}[k]=(\overline{\bm{\Phi}}_{\rm R}^{H}[k]\overline{\bm{\Phi}}_{\rm R}[k])^{-1}\overline{\bm{\Phi}}_{\rm R}^{H}[k]{\mathbf{Y}}[k]\overline{\bm{\Phi}}_{\rm U}[k](\overline{\bm{\Phi}}_{\rm U}^{H}[k]\overline{\bm{\Phi}}_{\rm U}[k])^{-1}, (39)

where 𝚽¯R[k]𝐕~[k]𝐁¯R[k]\overline{\bm{\Phi}}_{\rm R}[k]\triangleq\widetilde{\mathbf{V}}[k]\overline{\mathbf{B}}_{\rm R}[k] and 𝚽¯U[k]𝐅H[k]𝐀¯U[k]\overline{\bm{\Phi}}_{\rm U}[k]\triangleq\mathbf{F}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]. Hence, the reconstructed channel can be written as 𝐇¯^U[k]𝐁¯R[k]𝚵¯^[k]𝐀¯UH[k]\widehat{\overline{\mathbf{H}}}_{\rm U}[k]\triangleq\overline{\mathbf{B}}_{\rm R}[k]\widehat{\overline{\bm{\Xi}}}[k]\overline{\mathbf{A}}_{\rm U}^{H}[k]. The mean NMSE of 2D-OLS is given by

NMSE2D-OLS𝔼{1Kk=1K𝐇U[k]𝐇¯^U[k]F2𝐇U[k]F2}.\text{NMSE}_{\text{2D-OLS}}\triangleq\mathbb{E}\left\{\frac{1}{K}\sum_{k=1}^{K}\frac{\left\|\mathbf{H}_{\rm U}[k]-\widehat{\overline{\mathbf{H}}}_{\rm U}[k]\right\|_{F}^{2}}{\left\|\mathbf{H}_{\rm U}[k]\right\|_{F}^{2}}\right\}. (40)

The following proposition discusses its lower bound.

Proposition 5.

With the 2D-OLS solution, the mean NMSE is lower-bounded as

NMSE2D-OLSKσn2P5κNRNUk=1Kγk,\text{NMSE}_{\text{2D-OLS}}\geq\frac{K\sigma_{n}^{2}P^{5}}{\kappa N_{R}N_{U}\sum_{k=1}^{K}\gamma_{k}}, (41)

where γkλ¯max(𝐁¯RH[k]𝐁¯R[k])λ¯max(𝐀¯UH[k]𝐀¯U[k])𝚽¯U[k]F2𝚽¯R[k]F2λ¯min(𝐁¯RH[k]𝐁¯R[k])λ¯min(𝐀¯UH[k]𝐀¯U[k])\gamma_{k}\triangleq\frac{\bar{\lambda}_{\rm max}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm max}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)\left\|\overline{\bm{\Phi}}_{\rm U}[k]\right\|_{F}^{2}\left\|\overline{\bm{\Phi}}_{\rm R}[k]\right\|_{F}^{2}}{\bar{\lambda}_{\rm min}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm min}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)}, and κp=1P|βp|2\kappa\triangleq\sum_{p=1}^{P}|\beta_{p}|^{2} is the total path gain of the RIS-user channel.

Proof: The mean MSE of the 2D-OLS estimator is expressed as

𝔼{𝐇U[k]𝐇^U[k]F2}=\displaystyle\mathbb{E}\left\{\left\|\mathbf{H}_{\rm U}[k]-\widehat{\mathbf{H}}_{\rm U}[k]\right\|_{F}^{2}\right\}= 𝔼{𝐁¯R[k](𝚵¯[k]𝚵¯^[k])𝐀¯UH[k]F2}\displaystyle\mathbb{E}\left\{\left\|\overline{\mathbf{B}}_{\rm R}[k]\left({\overline{\bm{\Xi}}}[k]-\widehat{\overline{\bm{\Xi}}}[k]\right)\overline{\mathbf{A}}_{\rm U}^{H}[k]\right\|_{F}^{2}\right\} (42)
\displaystyle\geq λ¯min(𝐁¯RH[k]𝐁¯R[k])λ¯min(𝐀¯UH[k]𝐀¯U[k])𝔼{𝚵¯[k]𝚵¯^[k]F2},\displaystyle\bar{\lambda}_{\rm min}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm min}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)\mathbb{E}\left\{\left\|{\overline{\bm{\Xi}}}[k]-\widehat{\overline{\bm{\Xi}}}[k]\right\|_{F}^{2}\right\},

where λ¯min(𝐗)\bar{\lambda}_{\rm min}(\mathbf{X}) is the minimum eigenvalue of matrix 𝐗\mathbf{X}. Furthermore, we have

𝔼{𝚵¯[k]𝚵¯^[k]F2}=\displaystyle\mathbb{E}\left\{\left\|{\overline{\bm{\Xi}}}[k]-\widehat{\overline{\bm{\Xi}}}[k]\right\|_{F}^{2}\right\}= 𝔼{(𝚽¯RH[k]𝚽¯R[k])1𝚽¯RH[k]𝐍~[k]𝚽¯U[k](𝚽¯UH[k]𝚽¯U[k])1F2}\displaystyle\mathbb{E}\left\{\left\|(\overline{\bm{\Phi}}_{\rm R}^{H}[k]\overline{\bm{\Phi}}_{\rm R}[k])^{-1}\overline{\bm{\Phi}}_{\rm R}^{H}[k]\widetilde{\mathbf{N}}[k]\overline{\bm{\Phi}}_{\rm U}[k](\overline{\bm{\Phi}}_{\rm U}^{H}[k]\overline{\bm{\Phi}}_{\rm U}[k])^{-1}\right\|_{F}^{2}\right\} (43)
=(b)\displaystyle\overset{(b)}{=} 𝔼{Tr{𝐉RH[k]𝐍~[k]𝐉U[k](𝐉RH[k]𝐍~[k]𝐉U[k])H}}\displaystyle\mathbb{E}\left\{{\rm Tr}\left\{\mathbf{J}^{H}_{\rm R}[k]\widetilde{\mathbf{N}}[k]\mathbf{J}_{\rm U}[k]\left(\mathbf{J}^{H}_{\rm R}[k]\widetilde{\mathbf{N}}[k]\mathbf{J}_{\rm U}[k]\right)^{H}\right\}\right\}
=\displaystyle= Tr{𝐉RH[k]𝔼{𝐍~[k]𝐉U[k]𝐉UH[k]𝐍~H[k]}𝐉R[k]}\displaystyle{\rm Tr}\left\{\mathbf{J}_{\rm R}^{H}[k]\mathbb{E}\left\{\widetilde{\mathbf{N}}[k]\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\widetilde{\mathbf{N}}^{H}[k]\right\}\mathbf{J}_{\rm R}[k]\right\}
=(c)\displaystyle\overset{(c)}{=} σn2Tr{𝐉UH[k]𝐉U[k]}Tr{𝐉RH[k]𝐉R[k]}\displaystyle\sigma_{n}^{2}{\rm Tr}\left\{\mathbf{J}^{H}_{\rm U}[k]\mathbf{J}_{\rm U}[k]\right\}{\rm Tr}\left\{\mathbf{J}^{H}_{\rm R}[k]\mathbf{J}_{\rm R}[k]\right\}

where (b)(b) holds by defining 𝐉R[k]𝚽¯R(𝚽¯RH[k]𝚽¯R[k])1\mathbf{J}_{\rm R}[k]\triangleq\overline{\bm{\Phi}}_{\rm R}(\overline{\bm{\Phi}}_{\rm R}^{H}[k]\overline{\bm{\Phi}}_{\rm R}[k])^{-1} and 𝐉U[k]𝚽¯U[k](𝚽¯UH[k]𝚽¯U[k])1\mathbf{J}_{\rm U}[k]\triangleq\overline{\bm{\Phi}}_{\rm U}[k](\overline{\bm{\Phi}}_{\rm U}^{H}[k]\overline{\bm{\Phi}}_{\rm U}[k])^{-1}, and (c)(c) is established by the following derivation.

𝔼{𝐍~[k]𝐉U[k]𝐉UH[k]𝐍~H[k]}=\displaystyle\mathbb{E}\left\{\widetilde{\mathbf{N}}[k]\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\widetilde{\mathbf{N}}^{H}[k]\right\}= 𝔼{[𝐧~1𝐧~2𝐧~Q]𝐉U[k]𝐉UH[k][𝐧~1H𝐧~2H𝐧~QH]}\displaystyle\mathbb{E}\left\{\begin{bmatrix}\widetilde{\mathbf{n}}_{1}\\ \widetilde{\mathbf{n}}_{2}\\ \vdots\\ \widetilde{\mathbf{n}}_{Q}\end{bmatrix}\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\begin{bmatrix}\widetilde{\mathbf{n}}_{1}^{H}&\widetilde{\mathbf{n}}_{2}^{H}&\cdots&\widetilde{\mathbf{n}}_{Q}^{H}\end{bmatrix}\right\} (44)
=\displaystyle= [𝔼{𝐧~1[k]𝐉U[k]𝐉UH[k]𝐧~1H[k]}𝔼{𝐧~1[k]𝐉U[k]𝐉UH[k]𝐧~QH[k]}𝔼{𝐧~Q[k]𝐉U[k]𝐉UH[k]𝐧~1H[k]}𝔼{𝐧~Q[k]𝐉U[k]𝐉UH[k]𝐧~QH[k]}]\displaystyle\begin{bmatrix}\mathbb{E}\left\{\widetilde{\mathbf{n}}_{1}[k]\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\widetilde{\mathbf{n}}_{1}^{H}[k]\right\}&\cdots&\mathbb{E}\left\{\widetilde{\mathbf{n}}_{1}[k]\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\widetilde{\mathbf{n}}_{Q}^{H}[k]\right\}\\ \vdots&\ddots&\vdots\\ \mathbb{E}\left\{\widetilde{\mathbf{n}}_{Q}[k]\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\widetilde{\mathbf{n}}_{1}^{H}[k]\right\}&\cdots&\mathbb{E}\left\{\widetilde{\mathbf{n}}_{Q}[k]\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\widetilde{\mathbf{n}}_{Q}^{H}[k]\right\}\end{bmatrix}
=(d)\displaystyle\overset{(d)}{=} [σn2Tr{𝐉U[k]𝐉UH[k]}00σn2Tr{𝐉U[k]𝐉UH[k]}],\displaystyle\begin{bmatrix}\sigma_{n}^{2}{\rm Tr}\left\{\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\right\}&\cdots&0\\ \vdots&\ddots&\vdots\\ 0&\cdots&\sigma_{n}^{2}{\rm Tr}\left\{\mathbf{J}_{\rm U}[k]\mathbf{J}^{H}_{\rm U}[k]\right\}\end{bmatrix},

where the derivation of (d)(d) can be found in Appendix C.

Using the HM-GM-AM-QM inequalities, i.e., n=1NxnNNn=1N1xn\frac{\sum_{n=1}^{N}x_{n}}{N}\geq\frac{N}{\sum_{n=1}^{N}\frac{1}{x_{n}}}, Eqn. (43) is simplified as

σn2Tr{𝐉UH[k]𝐉U[k]}Tr{𝐉RH[k]𝐉R[k]}=\displaystyle\sigma_{n}^{2}{\rm Tr}\left\{\mathbf{J}^{H}_{\rm U}[k]\mathbf{J}_{\rm U}[k]\right\}{\rm Tr}\left\{\mathbf{J}^{H}_{\rm R}[k]\mathbf{J}_{\rm R}[k]\right\}= σn2p=1Pλ¯p((𝚽¯UH[k]𝚽¯U[k])1)p=1Pλ¯p((𝚽¯RH[k]𝚽¯R[k])1)\displaystyle\sigma_{n}^{2}\sum_{p=1}^{P}\bar{\lambda}_{p}\left(\left(\overline{\bm{\Phi}}_{\rm U}^{H}[k]\overline{\bm{\Phi}}_{\rm U}[k]\right)^{-1}\right)\sum_{p=1}^{P}\bar{\lambda}_{p}\left(\left(\overline{\bm{\Phi}}_{\rm R}^{H}[k]\overline{\bm{\Phi}}_{\rm R}[k]\right)^{-1}\right) (45)
\displaystyle\geq σn2P2p=1P1λ¯p((𝚽¯UH[k]𝚽¯U[k])1)P2p=1P1λ¯p((𝚽¯RH[k]𝚽¯R[k])1)\displaystyle\sigma_{n}^{2}\frac{P^{2}}{\sum_{p=1}^{P}\frac{1}{\bar{\lambda}_{p}\left(\left(\overline{\bm{\Phi}}_{\rm U}^{H}[k]\overline{\bm{\Phi}}_{\rm U}[k]\right)^{-1}\right)}}\frac{P^{2}}{\sum_{p=1}^{P}\frac{1}{\bar{\lambda}_{p}\left(\left(\overline{\bm{\Phi}}_{\rm R}^{H}[k]\overline{\bm{\Phi}}_{\rm R}[k]\right)^{-1}\right)}}
=\displaystyle= σn2P2p=1Pλ¯p(𝚽¯UH[k]𝚽¯U[k])P2p=1Pλ¯p(𝚽¯RH[k]𝚽¯R[k])\displaystyle\sigma_{n}^{2}\frac{P^{2}}{\sum_{p=1}^{P}{\bar{\lambda}_{p}\left(\overline{\bm{\Phi}}_{\rm U}^{H}[k]\overline{\bm{\Phi}}_{\rm U}[k]\right)}}\frac{P^{2}}{\sum_{p=1}^{P}{\bar{\lambda}_{p}\left(\overline{\bm{\Phi}}_{\rm R}^{H}[k]\overline{\bm{\Phi}}_{\rm R}[k]\right)}}
=\displaystyle= σn2P4𝚽¯U[k]F2𝚽¯R[k]F2,\displaystyle\frac{\sigma_{n}^{2}P^{4}}{\left\|\overline{\bm{\Phi}}_{\rm U}[k]\right\|_{F}^{2}\left\|\overline{\bm{\Phi}}_{\rm R}[k]\right\|_{F}^{2}},

where λ¯p(𝐗)\bar{\lambda}_{p}(\mathbf{X}) denotes the pp-th eigenvalue of matrix 𝐗\mathbf{X}.

On the other hand, 𝐇U[k]\mathbf{H}_{\rm U}[k] is written by

𝐇U[k]F2\displaystyle\left\|\mathbf{H}_{\rm U}[k]\right\|_{F}^{2} λ¯max(𝐁¯RH[k]𝐁¯R[k])λ¯max(𝐀¯UH[k]𝐀¯U[k])𝔼{𝚵¯[k]F2}\displaystyle\leq\bar{\lambda}_{\rm max}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm max}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)\mathbb{E}\left\{\left\|{\overline{\bm{\Xi}}}[k]\right\|_{F}^{2}\right\} (46)
=λ¯max(𝐁¯RH[k]𝐁¯R[k])λ¯max(𝐀¯UH[k]𝐀¯U[k])NRNUp=1P|βp|2P,\displaystyle=\bar{\lambda}_{\rm max}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm max}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)\frac{N_{R}N_{U}\sum_{p=1}^{P}|\beta_{p}|^{2}}{P},

where λ¯max(𝐗)\bar{\lambda}_{\rm max}(\mathbf{X}) is the maximum eigenvalue of matrix 𝐗\mathbf{X}.

Thus, combining Eqns. (40), (43), (45), and (46), we have

NMSE2D-OLS\displaystyle\text{NMSE}_{\text{2D-OLS}} 1Kk=1Kλ¯min(𝐁¯RH[k]𝐁¯R[k])λ¯min(𝐀¯UH[k]𝐀¯U[k])λ¯max(𝐁¯RH[k]𝐁¯R[k])λ¯max(𝐀¯UH[k]𝐀¯U[k])σn2P5NRNUκ𝚽¯U[k]F2𝚽¯R[k]F2\displaystyle\geq\frac{1}{K}\sum_{k=1}^{K}\frac{\bar{\lambda}_{\rm min}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm min}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)}{\bar{\lambda}_{\rm max}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm max}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)}\frac{\sigma_{n}^{2}P^{5}}{N_{R}N_{U}\kappa\left\|\overline{\bm{\Phi}}_{\rm U}[k]\right\|_{F}^{2}\left\|\overline{\bm{\Phi}}_{\rm R}[k]\right\|_{F}^{2}} (47)
=1Kk=1Kσn2P5NRNUκγk\displaystyle=\frac{1}{K}\sum_{k=1}^{K}\frac{\sigma_{n}^{2}P^{5}}{N_{R}N_{U}\kappa\gamma_{k}}
Kσn2P5κNRNUk=1Kγk.\displaystyle\geq\frac{K\sigma_{n}^{2}P^{5}}{\kappa N_{R}N_{U}\sum_{k=1}^{K}\gamma_{k}}.

where γkλ¯max(𝐁¯RH[k]𝐁¯R[k])λ¯max(𝐀¯UH[k]𝐀¯U[k])𝚽¯U[k]F2𝚽¯R[k]F2λ¯min(𝐁¯RH[k]𝐁¯R[k])λ¯min(𝐀¯UH[k]𝐀¯U[k])\gamma_{k}\triangleq\frac{\bar{\lambda}_{\rm max}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm max}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)\left\|\overline{\bm{\Phi}}_{\rm U}[k]\right\|_{F}^{2}\left\|\overline{\bm{\Phi}}_{\rm R}[k]\right\|_{F}^{2}}{\bar{\lambda}_{\rm min}\left(\overline{\mathbf{B}}_{\rm R}^{H}[k]\overline{\mathbf{B}}_{\rm R}[k]\right)\bar{\lambda}_{\rm min}\left(\overline{\mathbf{A}}_{\rm U}^{H}[k]\overline{\mathbf{A}}_{\rm U}[k]\right)}, and κp=1P|βp|2\kappa\triangleq\sum_{p=1}^{P}|\beta_{p}|^{2}.

The proof of Prop. 5 is complete. \blacksquare

Remark 3.

The lower bound of 2D-OLS is comprised of two parts, one is the system hyperparameter Kσn2P5κNRNU\frac{K\sigma_{n}^{2}P^{5}}{\kappa N_{R}N_{U}}, and the other is k=1Kγk\sum_{k=1}^{K}\gamma_{k} related to the sensing matrix. Importantly, the lower bound can be further reduced by assuming the sensing matrix is semi-orthogonal such that γk\gamma_{k} maximizes, indicating that the estimation performance can be improved by optimizing the sensing matrix. This assumption needs to be supported by measurement matrix optimization333Given the designed dictionary, sensing matrix optimization is equivalent to measurement matrix optimization., which is left in the future work.

VI Simulation Results

This section conducts several simulations to assess the efficacy of our proposed methods. The system setup considered for our simulations consists of NRy=128N_{R}^{y}=128, NRz=4N_{R}^{z}=4, NUy=8N_{U}^{y}=8, NUz=4N_{U}^{z}=4, NBy=NBz=16N_{B}^{y}=N_{B}^{z}=16 and system frequency f=28f=28 GHz with bandwidth fs=2f_{s}=2 GHz. The noise power is set to σn2=90\sigma_{n}^{2}=-90 dBm. For channel parameters, we employ the 2828 GHz mmWave channel setting in [45]. Following Table. I in [45], we assume that that path gains follow 𝒞𝒩(0,100.1PL)\mathcal{CN}(0,\aleph 10^{-0.1{\rm PL}}), where =K11.8100.1K2\aleph=K_{1}^{1.8}10^{0.1K_{2}} with K1𝒰(0,1)K_{1}\sim\mathcal{U}(0,1) and K2𝒞𝒩(0,16)K_{2}\sim\mathcal{CN}(0,16). Besides, PL=a1+10a2log10(d)+𝒩(0,σ)[dB]{\rm PL}=a_{1}+10a_{2}{\rm log}_{10}(d^{\prime})+\mathcal{N}(0,\sigma)[\rm{dB}] with dd^{\prime} denoting the distance in meters, where a1=72a_{1}=72, a2=2.92a_{2}=2.92 and σ=8.7\sigma=8.7 for NLoS paths, and a1=61.4a_{1}=61.4, a2=2a_{2}=2 and σ=5.8\sigma=5.8 for LoS paths. The distance between the BS and the RIS is set to 4545 meters. The users are uniformly distributed around RIS 2 at a distance of 55 to 2020 meters. Moreover, we assume the number of paths P=3P=3 (one is the LoS path) and the channel paths are uniformly distributed in elevation and azimuth coverage. The users’ uplink power σp2\sigma_{p}^{2} is identical. All the measurement matrices, i.e., the RIS phase shifts and the user’s training matrix, are generated by making each element of them follow the complex Gaussian distribution 𝒞𝒩(0,1)\mathcal{CN}(0,1) with modulus 1. Lastly, the size of dictionaries is set as GRy=NRyG_{R}^{y}=N_{R}^{y}, GRz=8NRzG_{R}^{z}=8N_{R}^{z}, GUy=8NUyG_{U}^{y}=8N_{U}^{y}, and GUz=8NUzG_{U}^{z}=8N_{U}^{z}. All the stepsizes {Δθ,Δϕ,Δϑ,Δφ,Δr}\{\Delta_{\theta},\Delta_{\phi},\Delta_{\vartheta},\Delta_{\varphi},\Delta_{r}\} of the refined procedure are set as 0.0050.005. The methods used for simulations are list as follows:

  • 2D-LS: The wideband channel is estimated by Prop. 1.

  • K-OMP: The wideband channel is estimated by solving problem (P1) with OMP.

  • CC-MMPSR: The wideband channel is estimated by our proposed MMPSR framework with CC-based atom matching.

  • IN-MMPSR: The wideband channel is estimated by our proposed MMPSR framework with IN-based atom matching.

  • 2D-OLS: The wideband channel is estimated by the 2D-OLS estimator with the perfect channel support.

  • LB: The lower bound of the 2D-OLS estimator, which is derived in Section. V.

VI-A Evaluation of Different Methods

Refer to caption
(a) NMSE performance at σp2\sigma_{p}^{2} = 15 dBm
Refer to caption
(b) NMSE performance at σp2\sigma_{p}^{2} = 30 dBm
Figure 4: NMSE versus the number of measurements QQ of different methods.

As analyzed in Section. IV, our framework shows that CC-based atom matching outperforms IN-based atom matching. To support our findings, we conducted simulations with NXN_{X} set to 3232, QQ ranging from 88 to 7272, KK set to 3232, and the uplink power σp2\sigma_{p}^{2} set to either 1515 or 3030 dBm. Fig. 4 displays the NMSE performance plotted against the number of measurements QQ. Our analysis reveals that the 2D-LS method performs poorly despite its high pilot overhead (Q=NRQ=N_{R} for 2D-LS). Instead, CC-MMPSR and IN-MMPSR are more effective, outperforming 2D-LS. Notably, CC-MMPSR performs better than IN-MMPSR in both low and high power scenarios, due to the fact that the 2-norm of each atom is typically unequal, which can interfere with the phase matching when using the IN with the target vector. It should be noted that the performance improvement observed in the simulation results begins to plateau beyond a certain number of measurements. This is due to the fact that beyond a certain threshold, the additional measurements do not provide significant additional benefit to the accuracy of the channel estimation, while also adding complexity to the system.

VI-B Impact of the Number of Subcarriers KK

To evaluate the effectiveness of the proposed method that exploits the common sparsity support, Fig. 5 and Fig. 6 exhibit the MSE of the estimated angles444The estimated distance r^1\widehat{r}\gg 1 is not exhibited here since it is not suitable for measuring with MSE. and the NMSE of the estimated channels, respectively. The parameter setting includes that σp2=30\sigma_{p}^{2}=30 dBm, NX=32N_{X}=32, QQ ranges from 88 to 7272, and K{1,32,128}K\in\{1,32,128\}. The results indicate that CC-MMPSR outperforms IN-MMPSR in terms of MSE/NMSE for different numbers of subcarriers, as shown in Fig. 5 and Fig. 6. Moreover, the joint parameter estimation provided by IN-/CC-MMPSR can further enhance the performance, as indicated by the decreasing MSE/NMSE trend as KK increases.

Refer to caption
(a) K=1K=1
Refer to caption
(b) K=32K=32
Refer to caption
(c) K=128K=128
Figure 5: MSE of the angles estimated by our proposed IN-MMPSR and CC-MMPSR.
Refer to caption
Figure 6: NMSE of the channel estimated by our proposed IN-MMPSR and CC-MMPSR.

VI-C Impact of the Near-Field Effect

To demonstrate the significance of addressing the near-field effect, we generate a gain-distance curve for varying RIS sizes. The gain is defined by |det(𝐁~RH𝐁¯R)|\left|{\rm det}(\widetilde{\mathbf{B}}^{H}_{\rm R}\overline{\mathbf{B}}_{\rm R})\right|, where 𝐁~RNR×P\widetilde{\mathbf{B}}_{\rm R}\in\mathbb{C}^{N_{R}\times P} is the planar channel support which has accurate angles but ignores the distance (the distance is assumed to be large enough). Our simulation reveals two critical observations, as shown in Fig. 7. Firstly, as the size of the RIS increases while keeping the distance constant, the gain decreases, primarily due to the near-field effect being exacerbated by the larger aperture. Secondly, when the size of the RIS is fixed and the distance between the RIS and the user increases, the gain also increases because the planar wavefront assumption holds in the far-field region. In essence, we demonstrate that the distance and array aperture play a significant role in reflecting the near-field effect.

Refer to caption
Figure 7: The defined gain varies with the communication distance and the RIS size.

VI-D Lower Bound Analysis

To demonstrate the efficacy of the proposed lower bound, we compare 2D-OLS and LB under various simulation parameters. In Fig. 8, we analyze the lower bound presented in Section V using the following parameter settings: K=32K=32, σp2\sigma_{p}^{2} in the range of 1515 to 3030 dB, QQ ranging from 88 to 7272 for Fig. 8(a), and K=32K=32, QQ ranging from 4040 to 7272 at uplink power of 55 to 3030 dB for Fig. 8(b). The figure illustrates that the proposed LB achieves lower NMSE compared to 2D-OLS for various uplink power and number of measurements.

Refer to caption
(a) NMSE versus QQ
Refer to caption
(b) NMSE versus σp2\sigma_{p}^{2}
Figure 8: The NMSE performance varies with the number of measurements and the uplink power.

VI-E Time Complexity Analysis

First, the complexity of 1D-LS and 2D-LS is analyzed. According to Eqn. (12), the complexity is 𝒪(L3NU3)\mathcal{O}(L^{3}N_{U}^{3}). 2D-LS of Eqn. (9), however, just incurs a complexity of 𝒪(L3)\mathcal{O}(L^{3}), where L>NUL>N_{U} is considered. The complexity of K-OMP with Eqn. (29), dominated by atom matching, is 𝒪(PKQNXGUGR)\mathcal{O}(PKQN_{X}G_{U}G_{R}). For our proposed CC-MMPSR and IN-MMPSR, they have a comparable complexity due to the same linear complexity of IN and CC. MMPSR consists of three steps: 1) SVD for the low-dimensional measurement matrix, 2) atom matching, and 3) parameter refinement. For step 1), the complexity is 𝒪(KQNXmin(Q,NX))\mathcal{O}\left(KQN_{X}{\rm min}(Q,N_{X})\right), which could be reduced by some SVD methods used for sparse decomposition. The atom matching process, whether IN or CC, will incur a linear complexity of 𝒪(KGRQ+KGUNX)\mathcal{O}(KG_{R}Q+KG_{U}N_{X}). For simplicity, the complexity of the refinement procedure can be designed to be smaller or comparable to that of the atom matching process. In XL-RIS systems, GR>NXmin(Q,NX)G_{R}>N_{X}{\rm min}(Q,N_{X}) can be assumed such that the total complexity is determined by 𝒪(KGRQ)\mathcal{O}(KG_{R}Q).

VII Conclusions

To summarize, this study has provided valuable insights into XL-RIS channel estimation in the wideband spherical domain. By analyzing the near-field beam squint effect and a 2D training signal structure, we have proposed a MMPSR recovery framework that is more efficient than the KCS framework for reconstructing the wideband channel. We have also introduced the CC as a substitute for the IN to measure the most relevant atom to the signal subspace and demonstrated through simulation that CC-MMPSR outperforms IN-MMPSR in terms of NMSE and time complexity. Additionally, we have proposed the 2D-OLS estimator as a benchmark that cannot be surpassed by any 2D channel reconstruction method and derived its lower bound by considering all subcarriers, highlighting the significance of optimizing training matrices to reduce pilot overhead. However, this is challenging with near-field beam squint, and practical XL-RIS systems are greatly sensitive to the time complexity. Therefore, future work will focus on proposing specific recovery frameworks for XL CS problems and exploring the use of deep learning to improve solutions.

Appendix A

According to Eqn. (19), gy(ϕ~,r,k)g_{y}(\widetilde{\phi},r,k) is defined by

gy(ϕ~,r,k)1NRy|NRy2NRy2ejπd2c(fk1ϕ~2rfc1ϕ~k¯2rk¯)(mRz)2dmRz|.g_{y}(\widetilde{\phi},r,k)\triangleq\frac{1}{N_{R}^{y}}\left|\int_{-\frac{N_{R}^{y}}{2}}^{\frac{N_{R}^{y}}{2}}e^{j\frac{\pi d^{2}}{c}\left(f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}\right)(m_{R}^{z})^{2}}{\rm d}m_{R}^{z}\right|. (48)

Denoting ζϕ,kd2c(fk1ϕ~2rfc1ϕ~k¯2rk¯)\zeta_{\phi,k}\triangleq\frac{d^{2}}{c}\left(f_{k}\frac{1-\widetilde{\phi}^{2}}{r}-f_{c}\frac{1-\widetilde{\phi}_{\bar{k}}^{2}}{r_{\bar{k}}}\right) for clarity, and then we define the equivalent function

g~y(ζϕ,k)1NRy|NRy2NRy2ejπζϕ,k(mRz)2dmRz|.\widetilde{g}_{y}(\zeta_{{\phi},k})\triangleq\frac{1}{N_{R}^{y}}\left|\int_{-\frac{N_{R}^{y}}{2}}^{\frac{N_{R}^{y}}{2}}e^{j{\pi}\zeta_{\phi,k}(m_{R}^{z})^{2}}{\rm d}m_{R}^{z}\right|. (49)

By substituting jπζϕ,k(mRz)2t2j\pi\zeta_{\phi,k}(m_{R}^{z})^{2}\triangleq-t^{2} into Eqn. (49), we obtain

g~y(ζϕ,k)=\displaystyle\widetilde{g}_{y}(\zeta_{{\phi},k})= |2(1+j)2πζϕ,kNRy01j22πζϕ,kNRyet2dt|\displaystyle\left|\frac{2(1+j)}{\sqrt{2\pi\zeta_{\phi,k}}N_{R}^{y}}\int_{0}^{\frac{1-j}{2\sqrt{2}}\sqrt{\pi\zeta_{\phi,k}}N_{R}^{y}}e^{-t^{2}}{\rm d}t\right| (50)
=\displaystyle= |1ζϕ,kNRyerf(1j22πζϕ,kNRy)|,\displaystyle\left|\frac{1}{\sqrt{\zeta_{\phi,k}}N_{R}^{y}}{\rm erf}\left(\frac{1-j}{2\sqrt{2}}\sqrt{\pi\zeta_{\phi,k}}N_{R}^{y}\right)\right|,

where the error function erf(x)2π0xet2dt{\rm erf}(x)\triangleq\frac{2}{\sqrt{\pi}}\int_{0}^{x}e^{-t^{2}}{\rm d}t. Similarly, gz(θ~,r,k)g_{z}(\widetilde{\theta},r,k) can be derived as

g~z(ζθ,k)=|1ζθ,kNRzerf(1j22πζθ,kNRz)|.\widetilde{g}_{z}(\zeta_{{\theta},k})=\left|\frac{1}{\sqrt{\zeta_{\theta,k}}N_{R}^{z}}{\rm erf}\left(\frac{1-j}{2\sqrt{2}}\sqrt{\pi\zeta_{\theta,k}}N_{R}^{z}\right)\right|. (51)

The proof is complete.

Appendix B

Recalling Eqn. (30), we know that 𝒞(𝐘[k])𝒞(𝚽R[k]𝚵[k])𝚽R[k]𝒞(𝚵[k])\mathcal{C}(\mathbf{Y}[k])\subset\mathcal{C}(\bm{\Phi}_{\rm R}[k]{\bm{\Xi}}[k])\subset\bm{\Phi}_{\rm R}[k]\mathcal{C}({\bm{\Xi}}[k]), as well as 𝒞(𝐘H[k])𝒞(𝚽U[k]𝚵H[k])𝚽U[k]𝒞(𝚵H[k])\mathcal{C}(\mathbf{Y}^{H}[k])\subset\mathcal{C}(\bm{\Phi}_{\rm U}[k]\bm{\Xi}^{H}[k])\subset\bm{\Phi}_{\rm U}[k]\mathcal{C}({\bm{\Xi}}^{H}[k]). 𝝃R,p[k]\bm{\xi}_{{\rm R},p}[k] and 𝝃U,p[k]\bm{\xi}_{{\rm U},p}[k] are the column vectors of the SVD of 𝐘[k]\mathbf{Y}[k], such that 𝝃R,p𝒞(𝐘[k])𝚽R[k]𝒞(𝚵[k])\bm{\xi}_{{\rm R},p}\in\mathcal{C}(\mathbf{Y}[k])\subset\bm{\Phi}_{\rm R}[k]\mathcal{C}({\bm{\Xi}}[k]) and 𝝃U,p[k]𝒞(𝐘H)𝚽U[k]𝒞(𝚵H[k])\bm{\xi}_{{\rm U},p}[k]\in\mathcal{C}(\mathbf{Y}^{H})\subset\bm{\Phi}_{\rm U}[k]\mathcal{C}({\bm{\Xi}}^{H}[k]). Therefore, the solution of min𝝃i,p[k]{𝜹i,k0+𝐭~i,p[k]𝚽i[k]𝝃i,p[k]22}\underset{\bm{\xi}_{i,p}[k]}{{\rm min}}\{\|\bm{\delta}_{i,k}\|_{0}+\|\widetilde{\mathbf{t}}_{i,p}[k]-\bm{\Phi}_{i}[k]\bm{\xi}_{i,p}[k]\|_{2}^{2}\} is PP-sparse due to 𝚽R[k]𝝃^R,p[k]𝐭~R,p[k]𝚽R[k]𝒞(𝚵[k])\bm{\Phi}_{\rm R}[k]\widehat{\bm{\xi}}_{{\rm R},p}[k]\approx\widetilde{\mathbf{t}}_{{\rm R},p}[k]\in\bm{\Phi}_{\rm R}[k]\mathcal{C}({\bm{\Xi}}[k]) and 𝚽U[k]𝝃^U,p[k]𝐭~U,p[k]𝚽U[k]𝒞(𝚵H[k])\bm{\Phi}_{\rm U}[k]\widehat{\bm{\xi}}_{{\rm U},p}[k]\approx\widetilde{\mathbf{t}}_{{\rm U},p}[k]\in\bm{\Phi}_{\rm U}[k]\mathcal{C}({\bm{\Xi}}^{H}[k]). In particular, since our focus is on the most crucial component in each subspace, we are able to recover a single parameter in each subspace. In this context, each subspace corresponds to one channel support. Furthermore, the subspace signal can be jointly recovered via the common sparsity support of Eqn. (31).

The proof of Prop. 4 is completed.

Appendix C

Here, the proof of (d)(d) in Eqn. (44) is given.

Consider a simplified form of 𝐧~q1𝐗𝐧~q2H\widetilde{\mathbf{n}}_{q_{1}}\mathbf{X}\widetilde{\mathbf{n}}_{q_{2}}^{H}, where q1,q2{1,,Q}\forall q_{1},q_{2}\in\{1,\cdots,Q\}.

𝐧~q1𝐗𝐧~q2H=n1=1NXn2=1NXn~q1,n1n~q2,n2[𝐗]n1,n2,\widetilde{\mathbf{n}}_{q_{1}}\mathbf{X}\widetilde{\mathbf{n}}_{q_{2}}^{H}=\sum_{n_{1}=1}^{N_{X}}\sum_{n_{2}=1}^{N_{X}}\widetilde{n}_{q_{1},n_{1}}\widetilde{n}_{q_{2},n_{2}}^{*}[\mathbf{X}]_{n_{1},n_{2}}, (52)

where n~q1,n1[𝐧~q1]n1\widetilde{n}_{q_{1},n_{1}}\triangleq[\widetilde{\mathbf{n}}_{q_{1}}]_{n_{1}} and n~q2,n2[𝐧~q2]n2\widetilde{n}_{q_{2},n_{2}}\triangleq[\widetilde{\mathbf{n}}_{q_{2}}]_{n_{2}}. For q1,q2,n1,n2\forall q_{1},q_{2},n_{1},n_{2}, 𝔼{n~q1,n1n~q2,n2}=σn2\mathbb{E}\{\widetilde{n}_{q_{1},n_{1}}\widetilde{n}_{q_{2},n_{2}}^{*}\}=\sigma_{n}^{2} if and only if q1=q2,n1=n2q_{1}=q_{2},n_{1}=n_{2}; otherwise, 𝔼{n~q1,n1n~q2,n2}=0\mathbb{E}\{\widetilde{n}_{q_{1},n_{1}}\widetilde{n}_{q_{2},n_{2}}^{*}\}=0. This indicates that 𝔼{𝐧~q1𝐗𝐧~q2H}\mathbb{E}\{\widetilde{\mathbf{n}}_{q_{1}}\mathbf{X}\widetilde{\mathbf{n}}_{q_{2}}^{H}\} equals to σn2Tr{𝐗}\sigma_{n}^{2}{\rm Tr}\{\mathbf{X}\} at q1=q2q_{1}=q_{2}. Therefore, the equation (d)(d) can be proved.

References

  • [1] M. Cui, Z. Wu, Y. Lu, X. Wei, and L. Dai, “Near-field MIMO communications for 6G: Fundamentals, challenges, potentials, and future directions,” IEEE Commun. Mag., vol. 61, no. 1, pp. 40–46, 2023.
  • [2] C. Huang, S. Hu, G. C. Alexandropoulos, A. Zappone, C. Yuen, R. Zhang, M. D. Renzo, and M. Debbah, “Holographic MIMO surfaces for 6g wireless networks: Opportunities, challenges, and trends,” IEEE Wireless Commun., vol. 27, no. 5, pp. 118–125, 2020.
  • [3] R. Chen, M. Chen, X. Xiao, W. Zhang, and J. Li, “Multi-user orbital angular momentum based Terahertz communications,” IEEE Trans. Wireless Commun., pp. 1–1, 2023.
  • [4] 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.
  • [5] J. Tian, Y. Han, S. Jin, and M. Matthaiou., “Low-overhead localization and vr identification for subarray-based ELAA systems,” IEEE Wireless Commun. Lett., pp. 1–1, 2023.
  • [6] Z. Lu, Y. Han, S. Jin, M. Matthaiou, and T. Q. S. Quek, “Near-field channel reconstruction and user localization for ELAA systems,” in 2022 International Symposium on Wireless Communication Systems (ISWCS), 2022, pp. 1–6.
  • [7] K. T. Selvan and R. Janaswamy, “Fraunhofer and fresnel distances : Unified derivation for aperture antennas.” IEEE Antennas Propag. Mag., vol. 59, no. 4, pp. 12–15, 2017.
  • [8] 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.
  • [9] W. Tang, M. Z. Chen, X. Chen, J. Y. Dai, Y. Han, M. Di Renzo, Y. Zeng, S. Jin, Q. Cheng, and T. J. Cui, “Wireless communications with reconfigurable intelligent surface: Path loss modeling and experimental measurement,” IEEE Trans. Wireless Commun., vol. 20, no. 1, pp. 421–439, 2021.
  • [10] R. Li, B. Guo, M. Tao, Y.-F. Liu, and W. Yu, “Joint design of hybrid beamforming and reflection coefficients in RIS-aided mmwave MIMO systems,” IEEE Trans. Commun., vol. 70, no. 4, pp. 2404–2416, 2022.
  • [11] L. Wei, C. Huang, Q. Guo, Z. Yang, Z. Zhang, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Joint channel estimation and signal recovery for RIS-empowered multiuser communications,” IEEE Trans. Commun., vol. 70, no. 7, pp. 4640–4655, 2022.
  • [12] S. Yang, W. Lyu, D. Wang, and Z. Zhang, “Separate channel estimation with hybrid RIS-aided multi-user communications,” IEEE Trans. Veh. Technol., pp. 1–6, 2022.
  • [13] L. Wei, C. Huang, G. C. Alexandropoulos, C. Yuen, Z. Zhang, and M. Debbah, “Channel estimation for RIS-empowered multi-user MISO wireless communications,” IEEE Trans. Commun., vol. 69, no. 6, pp. 4144–4157, 2021.
  • [14] 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.
  • [15] A. Fascista, M. F. Keskin, A. Coluccia, H. Wymeersch, and G. Seco-Granados, “Ris-aided joint localization and synchronization with a single-antenna receiver: Beamforming design and low-complexity estimation,” IEEE J. Sel. Top. Signal Process., vol. 16, no. 5, pp. 1141–1156, 2022.
  • [16] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Trans. Wireless Commun., vol. 18, no. 8, pp. 4157–4170, 2019.
  • [17] B. Ning, Z. Chen, W. Chen, Y. Du, and J. Fang, “Terahertz multi-user massive MIMO with intelligent reflecting surface: Beam training and hybrid beamforming,” IEEE Trans. Veh. Technol., vol. 70, no. 2, pp. 1376–1393, 2021.
  • [18] B. Ning, Z. Chen, W. Chen, and J. Fang, “Beamforming optimization for intelligent reflecting surface assisted MIMO: A sum-path-gain maximization approach,” IEEE Wireless Commun. Lett., vol. 9, no. 7, pp. 1105–1109, 2020.
  • [19] E. Björnson, . T. Demir, and L. Sanguinetti, “A primer on near-field beamforming for arrays and reconfigurable intelligent surfaces,” in 2021 55th Asilomar Conference on Signals, Systems, and Computers, 2021, pp. 105–112.
  • [20] N. Decarli and D. Dardari, “Communication modes with large intelligent surfaces in the near field,” IEEE Access, vol. 9, pp. 165 648–165 666, 2021.
  • [21] 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?” 2021. [Online]. Available: https://arxiv.org/abs/2109.10143
  • [22] G. C. Alexandropoulos, V. Jamali, R. Schober, and H. V. Poor, “Near-field hierarchical beam management for ris-enabled millimeter wave multi-antenna systems,” in 2022 IEEE 12th Sensor Array and Multichannel Signal Processing Workshop (SAM), 2022, pp. 460–464.
  • [23] 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.
  • [24] O. Rinchi, A. Elzanaty, and M.-S. Alouini, “Compressive near-field localization for multipath RIS-aided environments,” IEEE Commun. Lett., vol. 26, no. 6, pp. 1268–1272, 2022.
  • [25] D. Dardari, N. Decarli, A. Guerra, and F. Guidi, “Los/nlos near-field localization with a large reconfigurable intelligent surface,” IEEE Trans. Wireless Commun., vol. 21, no. 6, pp. 4282–4294, 2022.
  • [26] Y. Han, S. Jin, C.-K. Wen, and T. Q. Quek, “Localization and channel reconstruction for extra large RIS-assisted massive MIMO systems,” IEEE J. Sel. Top. Signal Process., pp. 1–1, 2022.
  • [27] Y. Pan, C. Pan, S. Jin, and J. Wang, “Ris-aided near-field localization and channel estimation for the sub-terahertz system,” 2022. [Online]. Available: https://arxiv.org/abs/2208.11343
  • [28] R. Ghazalian, K. Keykhosravi, H. Chen, H. Wymeersch, and R. Jäntti, “Bi-static sensing for near-field RIS localization,” in GLOBECOM 2022 - 2022 IEEE Global Communications Conference, 2022, pp. 6457–6462.
  • [29] S. Yang, W. Lyu, Z. Hu, Z. Zhang, and C. Yuen, “Channel estimation for near-field XL-RIS-aided mmwave hybrid beamforming architectures,” IEEE Trans. Veh. Technol., pp. 1–6, 2023.
  • [30] 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.
  • [31] A. M. Elbir, K. V. Mishra, and S. Chatzinotas, “NBA-OMP: Near-field beam-split-aware orthogonal matching pursuit for wideband THz channel estimation,” 2023.
  • [32] X. Gao, L. Dai, S. Zhou, A. M. Sayeed, and L. Hanzo, “Wideband beamspace channel estimation for millimeter-wave MIMO systems relying on lens antenna arrays,” IEEE Trans. Signal Process., vol. 67, no. 18, pp. 4809–4824, 2019.
  • [33] Y. Chen, Y. Xiong, D. Chen, T. Jiang, S. X. Ng, and L. Hanzo, “Hybrid precoding for wideband millimeter wave MIMO systems in the face of beam squint,” IEEE Trans. Wireless Commun., vol. 20, no. 3, pp. 1847–1860, 2021.
  • [34] S. Ma, W. Shen, J. An, and L. Hanzo, “Wideband channel estimation for IRS-aided systems in the face of beam squint,” IEEE Trans. Wireless Commun., vol. 20, no. 10, pp. 6240–6253, 2021.
  • [35] A. Lee, H. Ju, S. Kim, and B. Shim, “Intelligent near-field channel estimation for Terahertz ultra-massive MIMO systems,” in GLOBECOM 2022 - 2022 IEEE Global Communications Conference, 2022, pp. 5390–5395.
  • [36] H. Luo and F. Gao, “Beam squint assisted user localization in near-field communications systems,” 2022. [Online]. Available: https://arxiv.org/abs/2205.11392
  • [37] J. An, C. Xu, D. W. K. Ng, C. Yuen, L. Gan, and L. Hanzo, “Reconfigurable intelligent surface-enhanced OFDM communications via delay adjustable metasurface,” 2021. [Online]. Available: https://arxiv.org/abs/2110.09291
  • [38] W. Hao, X. You, F. Zhou, Z. Chu, G. Sun, and P. Xiao, “The far-/near-field beam squint and solutions for thz intelligent reflecting surface communications,” 2022. [Online]. Available: https://arxiv.org/abs/2208.12385
  • [39] Z. Wu and L. Dai, “Multiple access for near-field communications: SDMA or LDMA?” 2022. [Online]. Available: https://arxiv.org/abs/2208.06349
  • [40] Linear Systems and Characterization of Generalized Inverses.   New York, NY: Springer New York, 2003, pp. 52–103. [Online]. Available: https://doi.org/10.1007/0-387-21634-0_4
  • [41] J. Chen and X. Huo, “Theoretical results on sparse representations of multiple-measurement vectors,” IEEE Trans. Signal Process., vol. 54, no. 12, pp. 4634–4643, 2006.
  • [42] S. Friedland, Q. Li, and D. Schonfeld, “Compressive sensing of sparse tensors,” IEEE Trans. Image Process., vol. 23, no. 10, pp. 4438–4447, 2014.
  • [43] Z. Gao, L. Dai, W. Dai, B. Shim, and Z. Wang, “Structured compressive sensing-based spatio-temporal joint channel estimation for FDD massive MIMO,” IEEE Trans. on Commun., vol. 64, no. 2, pp. 601–617, 2016.
  • [44] J. Lee, G.-T. Gil, and Y. H. Lee, “Channel estimation via orthogonal matching pursuit for hybrid MIMO systems in millimeter wave communications,” IEEE Trans. Commun., vol. 64, no. 6, pp. 2370–2386, 2016.
  • [45] G. R. MacCartney, M. K. Samimi, and T. S. Rappaport, “Omnidirectional path loss models in new york city at 28 GHz and 73 GHz,” in 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), 2014, pp. 227–231.