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

\UseRawInputEncoding

Electromagnetic Property Sensing: A New Paradigm of Integrated Sensing and Communication

Yuhua Jiang, Feifei Gao, and Shi Jin Y. Jiang and F. Gao are with Institute for Artificial Intelligence, Tsinghua University (THUAI), State Key Lab of Intelligent Technologies and Systems, Tsinghua University, Beijing National Research Center for Information Science and Technology (BNRist), Beijing, P.R. China (email: [email protected], [email protected]). S. Jin is with the National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China (e-mail: [email protected]).
Abstract

Integrated sensing and communication (ISAC) has opened up numerous game-changing opportunities for future wireless systems. In this paper, we develop a novel scheme that utilizes orthogonal frequency division multiplexing (OFDM) pilot signals in ISAC systems to sense the electromagnetic (EM) property of the target and thus also identify the material of the target. Specifically, we first establish an end-to-end EM propagation model by means of Maxwell equations, where the EM property of the target is captured by a closed-form expression of the ISAC channel, incorporating the Lippmann-Schwinger equation and the method of moments (MOM) for discretization. We then model the relative permittivity and conductivity distribution (RPCD) within a specified detection region. Based on the sensing model, we introduce a multi-frequency-based EM property sensing method by which the RPCD can be reconstructed from compressive sensing techniques that exploits the joint sparsity structure of the EM property vector. To improve the sensing accuracy, we design a beamforming strategy from the communications transmitter based on the Born approximation that can minimize the mutual coherence of the sensing matrix. The optimization problem is cast in terms of the Gram matrix and is solved iteratively to obtain the optimal beamforming matrix. Simulation results demonstrate the efficacy of the proposed method in achieving high-quality RPCD reconstruction and accurate material classification. Furthermore, improvements in RPCD reconstruction quality and material classification accuracy are observed with increased signal-to-noise ratio (SNR) or reduced target-transmitter distance.

Index Terms:
Electromagnetic property sensing, material identification, integrated sensing and communication (ISAC), compressive sensing, orthogonal frequency division multiplexing (OFDM)

I Introduction

The electromagnetic (EM) property serves as a crucial indicator to identify the material of targets, playing a pivotal role in various industries and enabling automation processes to operate efficiently and accurately [1]. In conventional material identification techniques, the infrared emissivity as a material specific property is investigated to increase the material classification reliability [1]. However, the conventional infrared material identification techniques typically demand specialized devices that are costly and challenging to manufacture and maintain [2]. Besides, infrared light faces challenges in penetrating the target, particularly when the target surface is coated with camouflage material, rendering conventional infrared sensing methods ineffective. In contrast, the capability of EM waves to penetrate objects makes EM property sensing a viable and promising solution for accurate material identification. Besides, EM property sensing technology can be used in inspection and imaging of a human body, which meets the increasing demands from social security, environmental monitoring, and medical applications.

Recently, integrated sensing and communication (ISAC) has opened up numerous game-changing opportunities for future wireless sensing systems. ISAC allows communications systems and sensing systems to share the scarce radio spectrum, which saves a large amount of resource cost [3, 4, 5, 6]. In contrast to the dedicated sensing or communication functionality, the ISAC design methodology exhibits two types of gains. Firstly, the shared use of limited resources, namely, spectrum, energy, and hardware platforms, offers improved efficiency for both sensing and communications (S&C), and thus provides integration gain. Secondly, mutual assistance between S&C may offer coordination gain and further boost the dual performance. Hence, ISAC is expected to benefit both communication and sensing functionality in the near future [7, 8, 9, 10]. Due to its numerous advantages, ISAC is envisioned to be a key enabler for many future applications including intelligent connected vehicles, Internet of Things (IoT), and smart homes and cities [11, 12, 13, 14].

While ISAC has achieved notable success in localization [3], tracking [10], imaging [15], and various other applications [7, 9, 16, 11], the realm of EM property sensing within ISAC remains unexplored to the best knowledge of the authors. Since the EM property of the target material is implicitly encoded into the channel state information (CSI) from the transmitter to the receiver, there are promising prospects to incorporate EM property sensing capabilities into the ISAC paradigm. In the realm of ISAC, the primary function of sensing is to create an accurate representation that bridges the real physical world with its digital twin counterpart [17], [18]. In this context, the sensing of EM properties becomes essential. Unlike digital twins in image-based applications that may primarily rely on shape and location, digital twins in communications would need to reconstruct the communications channel, necessitating detailed material information. Thus, accurate EM property data is crucial to construct digital twin scenarios precisely, as it provides the material characteristics essential for channel reconstruction. This ensures that the digital representation not only mirrors the physical world’s form but also its interactive characteristics.

In this paper, we develop a novel scheme that utilizes OFDM pilot signals in ISAC systems to sense the EM property and identify the material of the target. The main contributions are summarized as follows:

  • \bullet

    ISAC EM property sensing formulation: We establish an end-to-end EM propagation model from the perspective of Maxwell equations. A closed-form expression for a vector related to material EM property is derived, incorporating the Lippmann-Schwinger equation and the method of moments for discretization. The objective is to reconstruct the relative permittivity and conductivity distribution (RPCD) within a specified detection region that contains the target.

  • \bullet

    Compressive sensing-based RPCD reconstruction: We propose a multi-frequency-based EM property sensing and material identification method using compressive sensing techniques, where the joint sparsity of the EM property vector is exploited to reconstruct RPCD.

  • \bullet

    Beamforming design for enhanced sensing: To further improve the sensing accuracy, we optimize the sensing matrix by designing the transmitter beamforming matrix based on the Born approximation. The design involves minimizing the difference between the Gram matrix of the designed beamforming matrix and a target matrix. The optimization problem is cast in terms of the Gram matrix and is solved iteratively to obtain the optimal beamforming matrix.

Simulation results demonstrate that the proposed method can achieve both high-quality RPCD reconstruction and accurate material classification. Moreover, the RPCD reconstruction quality and material classification accuracy can be improved by increasing the signal-to-noise ratio (SNR) at the receiver, or by decreasing the distance between the target and the transmitter.

The rest of this paper is organized as follows. Section II presents the system model and formulates the EM property sensing problem. Section III derives the end-to-end electromagnetic propagation formula. Section IV elaborates the strategy of sensing target material with multiple measurements. Section V describes the transmitter beamforming design criterion. Section VI provides the extensive numerical simulation results, and Section VII draws the conclusion.

Notations: Boldface denotes vector or matrix; jj corresponds to the imaginary unit; ()H(\cdot)^{H}, ()T(\cdot)^{T}, and ()(\cdot)^{*} represent the Hermitian, transpose, and conjugate, respectively; \circ denotes the Khatri-Rao product; \odot denotes the Hadamard product; \otimes denotes the Kronecker product; vec()\mathrm{vec}(\cdot) denotes the vectorization operation; 𝐀[:,i]\mathbf{A}[:,i] denotes the submatrix composed of all elements in column ii of matrix 𝐀\mathbf{A}; 𝐈\mathbf{I}, 𝟏\mathbf{1}, and 𝟎\mathbf{0} denote the identity matrix, the all-ones vector, and the all-zeros vector with compatible dimensions; 𝐚2\left\|\mathbf{a}\right\|_{2} denotes 2\ell 2-norm of the vector 𝐚\mathbf{a}; |a|\left|a\right| denotes the absolute value of the complex number aa; ()\Re(\cdot) and ()\Im(\cdot) denote the real and imaginary part of complex vectors or matrices, respectively; 𝐀F\left\|\mathbf{A}\right\|_{F} denotes Frobenius-norm of the matrix 𝐀\mathbf{A}; 𝐀0\mathbf{A}\succeq\textbf{0} indicates that the matrix 𝐀\mathbf{A} is positive semi-definite. The distribution of a circularly symmetric complex Gaussian (CSCG) random vector with zero mean and covariance matrix 𝐀\mathbf{A} is denoted as 𝒞𝒩(𝟎,𝐀)\mathcal{CN}(\mathbf{0},\mathbf{A}).

II System Model and Problem Formulation

Refer to caption

Figure 1: The system model is composed of a multi-antenna transmitter, a target to be sensed, and a multi-antenna receiver.

Consider a downlink communications scenario, in which an NtN_{t}-antenna base station (BS) communicates with an NrN_{r}-antenna mobile user with orthogonal frequency division multiplexing (OFDM) signaling. The transmitter adopts fully digital precoding structure where the number of RF chains NRFN_{RF} is equal to the number of antennas NtN_{t}. To enable EM property sensing, we resort to the pilot transmission, in which a total of KK subcarriers are used to transmit pilots. The central frequency and the subcarrier interval of OFDM signals are fcf_{c} and Δf\Delta f, respectively. Then the transmission bandwidth is W=(K1)ΔfW=(K-1)\Delta f, and the frequency of the kk-th subcarrier is fk=fc+(2kK1)Δf/2f_{k}=f_{c}+(2k-K-1)\Delta f/2, where k=1,2,,Kk=1,2,\cdots,K. The corresponding wavelength of the kk-th subcarrier is λk=cfc+(2kK1)Δf/2\lambda_{k}=\frac{c}{f_{c}+(2k-K-1)\Delta f/2}. Furthermore, we consider that a total of II pilot symbols are transmitted in each subcarrier.

The comprehensive sensing of a target in ISAC is accomplished through the following steps. Firstly, the existence of the target is ascertained through target detection. This initial phase is focused on discovering the presence of the target, which is a fundamental prerequisite for any further analysis. Secondly, once the target is detected, the task of ISAC is pinpointing the precise location and velocity of the target. These parameters are crucial as they provide the spatial context needed to accurately engage with the target. The methods to acquire these parameters have been comprehensively discussed in conventional ISAC literature [7, 9, 10, 11, 16, 12, 13, 5]. Thirdly, we proceed to sense the EM property of the target, acquiring the material-specific information. Therefore, when sensing the EM property of the target, we may assume that other properties like the position of the target have already been obtained and are thus known values.

Suppose the target scatters the pilot signals from the transmitter to the receiver as shown in Fig. 1. Since only the signals scattered by the target carry the information of its EM property, we may send the pilot signals towards the target by beamforming properly at the transmitter. The overall ISAC channel from the transmitter to the receiver of the kk-th subcarrier hence only consists of the scattering path channel 𝐇kNr×Nt\mathbf{H}_{k}\in\mathbb{C}^{N_{r}\times N_{t}}. Thus, the received signals can be formulated as:

𝐲~k=𝐇k𝐰~kxk+𝐧~k,\displaystyle\tilde{\mathbf{y}}_{k}=\mathbf{H}_{k}\tilde{\mathbf{w}}_{k}x_{k}+\tilde{\mathbf{n}}_{k}, (1)

where 𝐰~kNt×1\tilde{\mathbf{w}}_{k}\in\mathbb{C}^{N_{t}\times 1} is the digital beamforming weights on all transmitting antennas; xkx_{k} is the normalized pilot symbol; 𝐧~k𝒞𝒩(𝟎,σk2𝐈Nr)\tilde{\mathbf{n}}_{k}\sim\mathcal{CN}\left(\mathbf{0},\sigma_{k}^{2}\mathbf{I}_{N_{r}}\right) is the complex Gaussian noise at the receiver of the kk-th subcarrier. For notational brevity, we denote 𝐰k=𝐰~kxk\mathbf{w}_{k}=\tilde{\mathbf{w}}_{k}x_{k} that is perfectly known by the receiver during the pilot transmission process.

Assume prior knowledge has determined that the target is contained within a certain sensing domain DD, which can be discretized into a total of MM sampling points. Let the vectors 𝐄ki,DM×1\mathbf{E}_{k}^{i,D}\in\mathbb{C}^{M\times 1} and 𝐉kDM×1\mathbf{J}_{k}^{D}\in\mathbb{C}^{M\times 1} collect the incident electric field and the equivalent contrast source at all MM sampling points in DD, respectively [19, 20, 21]. Define 𝐇1,kM×Nt\mathbf{H}_{1,k}\in\mathbb{C}^{M\times N_{t}} as the channel matrix of the transmitter-to-target path that maps 𝐰k\mathbf{w}_{k} to 𝐄ki,D\mathbf{E}_{k}^{i,D}, and define 𝐇2,kNr×M\mathbf{H}_{2,k}\in\mathbb{C}^{N_{r}\times M} as the channel matrix of the target-to-receiver path that maps 𝐉kD\mathbf{J}_{k}^{D} to 𝐲~k\tilde{\mathbf{y}}_{k}. The ISAC channel from the transmitter through the domain DD to the receiver can then be described as:

𝐇k=𝐇2,k𝐗k𝐇1,k,\displaystyle\mathbf{H}_{k}=\mathbf{H}_{2,k}\mathbf{X}_{k}\mathbf{H}_{1,k}, (2)

where 𝐗kM×M\mathbf{X}_{k}\in\mathbb{C}^{M\times M} maps 𝐄ki,D\mathbf{E}_{k}^{i,D} to 𝐉kD\mathbf{J}_{k}^{D} and represents the influence on the signal transmission caused by the existence of target. The material-related EM property of the target is implicitly incorporated in the formulation of 𝐗k\mathbf{X}_{k}, which can be leveraged to estimate the material of the target. The matrices 𝐇1,k\mathbf{H}_{1,k} and 𝐇2,k\mathbf{H}_{2,k} are also known as the radiation operator matrices and are solely related to the physical laws of EM propagation [22]. Since we assume that the positions of the receiver, the sensing domain DD, and the transmitter are known, 𝐇1,k\mathbf{H}_{1,k} and 𝐇2,k\mathbf{H}_{2,k} can be calculated by the computational EM methods such as method of moments (MOM) [23], [24], finite element method (FEM) [25], and finite-difference time-domain (FDTD) [26]. In this paper, the objective is to retrieve the EM property of the target using the received signals y~k\tilde{y}_{k} and to further identify the material of the target from 𝐗k\mathbf{X}_{k}.

III Modeling the End-to-End EM Propagation

In this section, a closed-form expression of 𝐗k\mathbf{X}_{k} is derived to unfold the influence on the received signals caused by the target scattering process. Sensing the target EM property is equivalent to reconstructing the difference between the complex relative permittivity of the target and the complex relative permittivity of air at each point 𝐫\mathbf{r}^{\prime} in domain DD, denoted as χk(𝐫)\chi_{k}(\mathbf{r}^{\prime}). Since the complex relative permittivity of air is approximately equal to 11, we can formulate the contrast function as:

χk(𝐫)=ϵr(𝐫)+jσ(𝐫)/(ϵ0ωk)1,\displaystyle\chi_{k}(\mathbf{r}^{\prime})=\epsilon_{r}(\mathbf{r}^{\prime})+j\sigma(\mathbf{r}^{\prime})/(\epsilon_{0}\omega_{k})-1, (3)

where ϵr(𝐫)\epsilon_{r}(\mathbf{r}^{\prime}) is the real relative permittivity at point 𝐫\mathbf{r}^{\prime}, σ(𝐫)\sigma(\mathbf{r}^{\prime}) is the conductivity at point 𝐫\mathbf{r}^{\prime}, ϵ0\epsilon_{0} is the vacuum permittivity, and ωk=2πfk\omega_{k}=2\pi f_{k} is the angular frequency of electromagnetic waves of the kk-th subcarrier. The distributions of ϵr(𝐫)\epsilon_{r}(\mathbf{r}^{\prime}) and σ(𝐫)\sigma(\mathbf{r}^{\prime}) are the targets that need to be recovered in the EM property sensing task. The total electric field corresponding to the kk-th subcarrier inside the domain DD can be expressed using the Lippmann-Schwinger (LS) equation as [19], [27]

Ekt(𝐫)=Eki(𝐫)+kk2DGk(𝐫,𝐫)χk(𝐫)Ekt(𝐫)𝑑𝐫,𝐫D,\displaystyle E_{k}^{t}({\mathbf{r}})=E_{k}^{i}({\mathbf{r}})+k_{k}^{2}\int\limits_{D}{G_{k}({\mathbf{r},\mathbf{r}}^{\prime})}\chi_{k}({\mathbf{r}}^{\prime})E_{k}^{t}({\mathbf{r}}^{\prime})d{\mathbf{r}}^{\prime},\mathbf{r}\in D, (4)

where kk=2πλkk_{k}=\frac{2\pi}{\lambda_{k}} is the wavenumber of the kk-th subcarrier, while Ekt(𝐫)E_{k}^{t}({\mathbf{r}}), Eki(𝐫)E_{k}^{i}({\mathbf{r}}), and Gk(𝐫,𝐫){G_{k}({\mathbf{r},\mathbf{r}}^{\prime})} denote the total electric field, the incident electric field, and the Green’s function, respectively. Consider a 2D transverse magnetic (TM) scenario, and Gk(𝐫,𝐫){G_{k}({\mathbf{r},\mathbf{r}}^{\prime})} can then be formulated as [19], [27]

Gk(𝐫,𝐫)=j4H0(2)(kk𝐫𝐫2),{G_{k}({\mathbf{r},\mathbf{r}}^{\prime})}=\frac{j}{4}H_{0}^{(2)}\left(k_{k}\left\|\mathbf{r}-\mathbf{r}^{\prime}\right\|_{2}\right), (5)

where H0(2)H_{0}^{(2)} is the zero-order Hankel function of the second kind.

Let the vectors 𝐄ks,DM×1\mathbf{E}_{k}^{s,D}\in\mathbb{C}^{M\times 1}, 𝐄kt,DM×1\mathbf{E}_{k}^{t,D}\in\mathbb{C}^{M\times 1}, and 𝝌kM×1\boldsymbol{\chi}_{k}\in\mathbb{C}^{M\times 1} collect the scattering electric field, the total electric field, and χk(𝐫)\chi_{k}(\mathbf{r}) at all MM sampling points in DD, respectively. Denote 𝐆kM×M\mathbf{G}_{k}\in\mathbb{C}^{M\times M} as the discretized matrix of the integral kernel kk2Gk(𝐫𝐫)k_{k}^{2}G_{k}\left(\mathbf{r}-\mathbf{r}^{\prime}\right) in (4) using MOM, where both 𝐫\mathbf{r} and 𝐫\mathbf{r}^{\prime} are on the discretized sampling points within the domain DD. The total electric field in DD can be obtained by adding the incident field and the scattering field, which means 𝐄kt,D\mathbf{E}_{k}^{t,D} can be written in the discretized form of (4) as:

𝐄kt,D=𝐄ki,D+𝐄ks,D=𝐄ki,D+𝐆kdiag(𝝌k)𝐄kt,D.\mathbf{E}_{k}^{t,D}=\mathbf{E}_{k}^{i,D}+\mathbf{E}_{k}^{s,D}=\mathbf{E}_{k}^{i,D}+\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\mathbf{E}_{k}^{t,D}. (6)

In order to yield a closed-form expression of 𝐄kt,D\mathbf{E}_{k}^{t,D}, we reformulate equation (6) in the non-linear form with respect to diag(𝝌k)\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right) as:

𝐄kt,D=(𝐈𝐆kdiag(𝝌k))1𝐄ki,D.\mathbf{E}_{k}^{t,D}=(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right))^{-1}\mathbf{E}_{k}^{i,D}. (7)

After obtaining 𝐄kt,D\mathbf{E}_{k}^{t,D}, the equivalent contrast source in DD is defined as [19], [27]

𝐉kD=𝝌k𝐄kt,D=diag(𝝌k)𝐄kt,D,\displaystyle\mathbf{J}_{k}^{D}={\boldsymbol{\chi}_{k}}\odot\mathbf{E}_{k}^{t,D}=\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\mathbf{E}_{k}^{t,D}, (8)

which can be regarded as the source of scattering EM waves. Considering the radiation from the equivalent contrast source diag(𝝌k)𝐄kt,D\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\mathbf{E}_{k}^{t,D} transmitted through the channel 𝐇2,k\mathbf{H}_{2,k}, we can formulate 𝐲~k\tilde{\mathbf{y}}_{k} as [20], [21]

𝐲~k\displaystyle\tilde{\mathbf{y}}_{k} =𝐇2,kdiag(𝝌k)𝐄kt,D+𝐧~k\displaystyle=\mathbf{H}_{2,k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\mathbf{E}_{k}^{t,D}+\!\tilde{\mathbf{n}}_{k}
=𝐇2,kdiag(𝝌k)(𝐈𝐆kdiag(𝝌k))1𝐄ki,D+𝐧~k.\displaystyle=\mathbf{H}_{2,k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right))^{-1}\mathbf{E}_{k}^{i,D}+\!\tilde{\mathbf{n}}_{k}. (9)

Taking into account 𝐄ki,D=𝐇1,k𝐰k\mathbf{E}_{k}^{i,D}=\mathbf{H}_{1,k}\mathbf{w}_{k}, the received signal transmitted through the target scattering path can be written as:

𝐲~k=𝐇2,kdiag(𝝌k)(𝐈𝐆kdiag(𝝌k))1𝐇1,k𝐰k+𝐧~k.\displaystyle\tilde{\mathbf{y}}_{k}\!=\mathbf{H}_{2,k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\left(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\right)^{-1}\mathbf{H}_{1,k}\mathbf{w}_{k}\!+\!\tilde{\mathbf{n}}_{k}. (10)

Therefore, the closed-form expression of 𝐗k\mathbf{X}_{k} in (2) can be written as:

𝐗k=diag(𝝌k)(𝐈𝐆kdiag(𝝌k))1.\displaystyle\mathbf{X}_{k}=\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right))^{-1}. (11)

For those sampling points occupied by the air within DD, the corresponding rows of 𝐗k\mathbf{X}_{k} are all zeros, and those points are not regarded as EM sources of scattering waves. Note that (11) is a general formulation regardless of the positions of the transmitter and the receiver. Although we consider a bistatic sensing scenario in this paper, (11) can also be used in a monostatic sensing scenario where the transmitter is in close proximity to the receiver.

Denote 𝐖~k=[𝐰k,1,𝐰k,2,,𝐰k,I]Nt×I\tilde{\mathbf{W}}_{k}=\left[\mathbf{w}_{k,1},\mathbf{w}_{k,2},\cdots,\mathbf{w}_{k,I}\right]\in\mathbb{C}^{N_{t}\times I} as the digital transmitter beamformer stacked by time of the kk-th subcarrier. Then the overall received pilot signals 𝐘kNr×I\mathbf{Y}_{k}\in\mathbb{C}^{N_{r}\times I} can be formulated in a compact form as:

𝐘k\displaystyle\mathbf{Y}_{k} =[𝐲~k,1,𝐲~k,2,,𝐲~k,I]\displaystyle=[\tilde{\mathbf{y}}_{k,1},\tilde{\mathbf{y}}_{k,2},\cdots,\tilde{\mathbf{y}}_{k,I}]
=𝐇2,kdiag(𝝌k)(𝐈𝐆kdiag(𝝌k))1𝐇1,k\displaystyle=\mathbf{H}_{2,k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right))^{-1}\mathbf{H}_{1,k}
×[𝐰k,1,𝐰k,2,,𝐰k,I]+[𝐧~k,1,𝐧~k,2,,𝐧~k,I]\displaystyle\times\left[\mathbf{w}_{k,1},\mathbf{w}_{k,2},\cdots,\mathbf{w}_{k,I}\right]+\left[\tilde{\mathbf{n}}_{k,1},\tilde{\mathbf{n}}_{k,2},\cdots,\tilde{\mathbf{n}}_{k,I}\right]
=𝐇2,kdiag(𝝌k)(𝐈𝐆kdiag(𝝌k))1𝐇1,k𝐖~k\displaystyle=\mathbf{H}_{2,k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left(\boldsymbol{\chi}_{k}\right))^{-1}\mathbf{H}_{1,k}\tilde{\mathbf{W}}_{k}
+[𝐧~k,1,𝐧~k,2,,𝐧~k,I].\displaystyle+\left[\tilde{\mathbf{n}}_{k,1},\tilde{\mathbf{n}}_{k,2},\cdots,\tilde{\mathbf{n}}_{k,I}\right]. (12)

Denote the vectorized noise as 𝐧k=[𝐧~k,1,𝐧~k,2,,𝐧~k,I]\mathbf{n}_{k}=\left[\tilde{\mathbf{n}}_{k,1}^{\top},\tilde{\mathbf{n}}_{k,2}^{\top},\cdots,\tilde{\mathbf{n}}_{k,I}^{\top}\right]^{\top}. Then we can vectorize 𝐘k\mathbf{Y}_{k} to 𝐲kINr×1\mathbf{y}_{k}\in\mathbb{C}^{IN_{r}\times 1} as:

𝐲k\displaystyle\mathbf{y}_{k} =vec(𝐘k)\displaystyle=\mathrm{vec}(\mathbf{Y}_{k})
=(a)[(𝐖~k𝐇1,k(𝐈𝐆kdiag(𝝌k)))𝐇2,k]𝝌k+𝐧k,\displaystyle\overset{(a)}{=}\left[\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\left(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\right)^{-\top}\right)\circ\mathbf{H}_{2,k}\right]\boldsymbol{\chi}_{k}+\mathbf{n}_{k}, (13)

where =(a)\overset{(a)}{=} in (13) comes from the equality: vec(𝐀diag(𝐛)𝐂)=(𝐂T𝐀)𝐛\mathrm{vec}\left(\mathbf{A}\textrm{diag}(\mathbf{b})\mathbf{C}\right)=\left(\mathbf{C}^{T}\circ\mathbf{A}\right)\mathbf{b}. In order to derive a quasi-linear sensing model, we further define the sensing matrix 𝐃kINr×M\mathbf{D}_{k}\in\mathbb{C}^{IN_{r}\times M} as:

𝐃k\displaystyle\mathbf{D}_{k} =Δ(𝐖~k𝐇1,k(𝐈𝐆kdiag(𝝌k)))𝐇2,k.\displaystyle\overset{\Delta}{=}\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\left(\mathbf{I}-\mathbf{G}_{k}\textrm{diag}\left({\boldsymbol{\chi}_{k}}\right)\right)^{-\top}\right)\circ\mathbf{H}_{2,k}. (14)

Then the sensing equation with respect to 𝝌k\boldsymbol{\chi}_{k} can be formulated as:

𝐲k\displaystyle\mathbf{y}_{k} =𝐃k𝝌k+𝐧k.\displaystyle=\mathbf{D}_{k}\boldsymbol{\chi}_{k}+\mathbf{n}_{k}. (15)

Note that although we call (15) a quasi-linear sensing model, 𝐲k\mathbf{y}_{k} is actually nonlinear with respect to 𝝌k\boldsymbol{\chi}_{k} because 𝐃k\mathbf{D}_{k} also depends on 𝝌k\boldsymbol{\chi}_{k} and is therefore unknown.

IV EM Property Sensing and Material Identification

IV-A Compressive Sensing Based Method

In this section, we will introduce the EM property sensing and material identification method by fusing received pilot signals of all KK subcarriers. The sensing equation (15) of the kk-th subcarrier can be written as:

𝐲k=𝐃k𝝌k+𝐧k=𝐃k(𝜺𝟏+jωk𝜺0𝝈)+𝐧k.\displaystyle\mathbf{y}_{k}=\mathbf{D}_{k}\boldsymbol{\chi}_{k}+\mathbf{n}_{k}=\mathbf{D}_{k}\left(\boldsymbol{\varepsilon}-\mathbf{1}+\frac{j}{\omega_{k}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma}\right)+\mathbf{n}_{k}. (16)

Denote the central angular frequency as ωc\omega_{c} and the corresponding contrast vector as 𝝌c=𝜺𝟏+jωc𝜺0𝝈\boldsymbol{\chi}_{c}=\boldsymbol{\varepsilon}-\mathbf{1}+\frac{j}{\omega_{c}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma}. Seperating the real and imaginary part of the equation (16) and extracting frequency-related components in 𝝌k\boldsymbol{\chi}_{k}, we can derive the non-dimensional equation as:

[(𝐲k)(𝐲k)]\displaystyle\left[\!\begin{array}[]{l}\Re\left(\mathbf{y}_{k}\right)\\ \Im\left(\mathbf{y}_{k}\right)\end{array}\!\right]\! =[(𝐃k)(𝐃k)(𝐃k)(𝐃k)][𝐈𝟎𝟎ωcωk𝐈][𝜺𝟏1ωc𝜺0𝝈]\displaystyle=\!\left[\!\begin{array}[]{cc}\Re\left(\mathbf{D}_{k}\right)&-\Im\left(\mathbf{D}_{k}\right)\\ \Im\left(\mathbf{D}_{k}\right)&\Re\left(\mathbf{D}_{k}\right)\end{array}\!\right]\!\left[\!\begin{array}[]{cc}\mathbf{I}&\mathbf{0}\\ \mathbf{0}&\frac{\omega_{c}}{\omega_{k}}\mathbf{I}\end{array}\!\right]\!\left[\!\begin{array}[]{c}\boldsymbol{\varepsilon}-\mathbf{1}\\ \frac{1}{\omega_{c}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma}\end{array}\!\right]\! (25)
+[(𝐧k)(𝐧k)]\displaystyle+\left[\begin{array}[]{l}\Re\left(\mathbf{n}_{k}\right)\\ \Im\left(\mathbf{n}_{k}\right)\end{array}\right] (28)
=[(𝐃k)ωcωk(𝐃k)(𝐃k)ωcωk(𝐃k)][𝜺𝟏1ωc𝜺0𝝈]+[(𝐧k)(𝐧k)].\displaystyle=\left[\!\!\begin{array}[]{cc}\Re\left(\mathbf{D}_{k}\right)&-\frac{\omega_{c}}{\omega_{k}}\Im\left(\mathbf{D}_{k}\right)\\ \Im\left(\mathbf{D}_{k}\right)&\frac{\omega_{c}}{\omega_{k}}\Re\left(\mathbf{D}_{k}\right)\end{array}\!\!\right]\!\left[\!\begin{array}[]{c}\boldsymbol{\varepsilon}-\mathbf{1}\\ \frac{1}{\omega_{c}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma}\end{array}\!\!\right]+\left[\!\!\begin{array}[]{l}\Re\left(\mathbf{n}_{k}\right)\\ \Im\left(\mathbf{n}_{k}\right)\end{array}\!\!\!\right]. (35)

For notational brevity, we can reformulate (35) as:

𝐳k=𝐄k𝐬+[(𝐧k)(𝐧k)],\displaystyle\mathbf{z}_{k}=\mathbf{E}_{k}\mathbf{s}+\left[\begin{array}[]{l}\Re\left(\mathbf{n}_{k}\right)\\ \Im\left(\mathbf{n}_{k}\right)\end{array}\right], (38)

where 𝐳k=[(𝐲k),(𝐲k)]\mathbf{z}_{k}=\left[\Re\left(\mathbf{y}_{k}\right)^{\top},\Im\left(\mathbf{y}_{k}\right)^{\top}\right]^{\top}, 𝐬=[(𝜺𝟏),(1ωc𝜺0𝝈)]\mathbf{s}=[(\boldsymbol{\varepsilon}-\mathbf{1})^{\top},(\frac{1}{\omega_{c}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma})^{\top}]^{\top}, and 𝐄k\mathbf{E}_{k} denotes the coefficient matrix in front of 𝐬\mathbf{s}. We define 𝐬\mathbf{s} as the EM property vector that needs to be restored. Since 𝐬\mathbf{s} is irrelevant to the subcarrier frequencies, we can stack (38) for different subcarriers by column as:

[𝐳1𝐳K]=[𝐄1𝐄K]𝐬+[(𝐧1)(𝐧1)(𝐧K)(𝐧K)].\displaystyle\left[\begin{array}[]{c}\mathbf{z}_{1}\\ \vdots\\ \mathbf{z}_{K}\end{array}\right]=\left[\begin{array}[]{c}\mathbf{E}_{1}\\ \vdots\\ \mathbf{E}_{K}\end{array}\right]\mathbf{s}+\left[\begin{array}[]{c}\Re\left(\mathbf{n}_{1}\right)\\ \Im\left(\mathbf{n}_{1}\right)\\ \vdots\\ \Re\left(\mathbf{n}_{K}\right)\\ \Im\left(\mathbf{n}_{K}\right)\\ \end{array}\right]. (50)

Define the general vector of measurement and the general sensing matrix as:

𝐳~\displaystyle\tilde{\mathbf{z}} =[𝐳1,,𝐳K],\displaystyle=\left[\mathbf{z}_{1}^{\top},\cdots,\mathbf{z}_{K}^{\top}\right]^{\top}, (51)
𝐄~\displaystyle\tilde{\mathbf{E}} =[𝐄1,,𝐄K].\displaystyle=\left[\mathbf{E}_{1}^{\top},\cdots,\mathbf{E}_{K}^{\top}\right]^{\top}. (52)

Since the target typically occupies only a small fraction of space in the detection domain DD, most of the elements of 𝐬\mathbf{s} are 0 corresponding to the EM property of the air. Moreover, (𝜺𝟏)(\boldsymbol{\varepsilon}-\mathbf{1}) and 1ωc𝜺0𝝈\frac{1}{\omega_{c}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma} share the same support set. Thus, if K~\tilde{K} sampling points of DD are occupied by the target, then (𝜺𝟏)(\boldsymbol{\varepsilon}-\mathbf{1}) and 1ωc𝜺0𝝈\frac{1}{\omega_{c}\boldsymbol{\varepsilon}_{0}}\boldsymbol{\sigma} will be K~\tilde{K}-sparse, and 𝐬\mathbf{s} will be jointly K~\tilde{K}-sparse. According to the compressive sensing techniques, 𝐬\mathbf{s} can be reconstructed as the solution to the following mixed (1\ell 1,2\ell 2)-norm minimization problem

min\displaystyle\min\ 𝐬1,2\displaystyle\|\mathbf{s}\|_{1,2} (53a)
s.t. 𝐳~𝐄~𝐬2ε,𝐬𝟎,\displaystyle\|\tilde{\mathbf{z}}-\tilde{\mathbf{E}}\mathbf{s}\|_{2}\leqslant\varepsilon^{\prime},\quad\mathbf{s}\geq\mathbf{0}, (53b)

where ε\varepsilon^{\prime} represents the predefined noise level that should be chosen appropriately. The constraint 𝐬𝟎\mathbf{s}\geq\mathbf{0} means all elements of 𝐬\mathbf{s} are nonnegative and holds based on the fact that the relative permittivity is not less than 11 and the conductivity is nonnegative. Moreover, 𝐬1,2\|\mathbf{s}\|_{1,2} is the mixed (1\ell 1,2\ell 2)-norm defined as:

𝐬1,2=Δm=1Msm2+sm+M2.\|\mathbf{s}\|_{1,2}\overset{\Delta}{=}{\sum_{m=1}^{M}\sqrt{s_{m}^{2}+s_{m+M}^{2}}}. (54)

The mixed (1\ell 1,2\ell 2)-norm tends to guarantee the joint sparsity of 𝐬\mathbf{s}, because ϵ𝟏\boldsymbol{\epsilon}-\mathbf{1} and 𝝈\boldsymbol{\sigma} have the same support set. Based on the generalized multiple measurement vector (GMMV) model, the key point in (53) is to utilize the joint sparsity structure to improve the sensing ability. Moreover, (53) is a basis pursuit denoising (BPDN) problem that can be effectively solved by CVX using spectral projected gradient (SPG) method due to its convexity. The order of computational complexity is 𝒪(K~3M3)\mathcal{O}(\tilde{K}^{3}M^{3}) according to [28].

IV-B Iterative EM Property Sensing Formulation

Since 𝐄~\tilde{\mathbf{E}} intrinsically depends on 𝐬\mathbf{s}, we need to update 𝐄~\tilde{\mathbf{E}} after solving (53) and update 𝐬\mathbf{s} iteratively. Let the superscript denote the number of iterations. For the initial iteration step, the Born approximation (BA) 𝐄Dt𝐄Di\mathbf{E}_{D}^{t}\approx\mathbf{E}_{D}^{i} can be applied [29, 30, 19]. BA has been proven to be accurate if the scattering field is relatively small compared to the incident field on the scatterer and thus can be used to calculate the initial guess [29]. Using BA, (11) reduces to Xkdiag(𝝌k)\textbf{X}_{k}\approx\mathrm{diag}(\boldsymbol{\chi}_{k}). Following the same derivation in (12) and (13), we can compute the initial sensing matrix defined in (14) under BA as:

𝐃k0=(𝐖~k𝐇1,k)𝐇2,k.\displaystyle\mathbf{D}_{k}^{0}=\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)\circ\mathbf{H}_{2,k}. (55)

Then, 𝐃k0\mathbf{D}_{k}^{0} is used to compute 𝐄k0\mathbf{E}_{k}^{0} in (38), and 𝐄k0\mathbf{E}_{k}^{0} of all subcarriers are assembled into 𝐄~0\tilde{\mathbf{E}}^{0} in (52). By solving (53) with 𝐄~0\tilde{\mathbf{E}}^{0}, we can further calculate 𝐬0\mathbf{s}^{0}. With the initial guess 𝐬0\mathbf{s}^{0}, the proposed iteration procedure of the inversion algorithm is as follows:

Step 1: Calculate 𝝌kn\boldsymbol{\chi}_{k}^{n} for all subcarriers using 𝐬n\mathbf{s}^{n} according to (3)(\ref{def0}).

Step 2: Calculate 𝐃kn\mathbf{D}_{k}^{n} using 𝝌kn\boldsymbol{\chi}_{k}^{n} for all subcarriers according to (14)(\ref{sense1}).

Step 3: Calculate 𝐄kn\mathbf{E}_{k}^{n} using 𝐃kn\mathbf{D}_{k}^{n} for all subcarriers according to (35)(\ref{Ek}) and (38)(\ref{Ek2}) and then assemble 𝐄kn\mathbf{E}_{k}^{n} for all kk into 𝐄~n\tilde{\mathbf{E}}^{n} according to (52)(\ref{assemble}).

Step 4: Calculate 𝐬n+1\mathbf{s}^{n+1} using 𝐄~n\tilde{\mathbf{E}}^{n} according to (53).

Step 5: If the predetermined convergence criterion is satisfied, then STOP. Otherwise, go to Step 1.

It is important to note that except for Step 4, the remaining steps do not involve inverse operations and only include linear operations. Thus, the algorithm is based on recursive linear approximation to cope with the non-linearity of the EM property sensing problem in (14) and (15).

Next, we analyze the computational complexity. In each iteration, the computational complexity of Step 1 is 𝒪(KM)\mathcal{O}(KM); the computational complexity of Step 2 is 𝒪([M3+INtM+IM2+INrM]K)\mathcal{O}([M^{3}+IN_{t}M+IM^{2}+IN_{r}M]K); the computational complexity of Step 3 is 𝒪(NrMK)\mathcal{O}(N_{r}MK); the computational complexity of Step 4 is 𝒪(K~3M3)\mathcal{O}(\tilde{K}^{3}M^{3}). By combining them, we finally have the overall computational complexity as 𝒪([(M2+INt+IM+INr)MK+K~3M3]Niter)\mathcal{O}([(M^{2}+IN_{t}+IM+IN_{r})MK+\tilde{K}^{3}M^{3}]N_{iter}), where NiterN_{iter} represents the number of iterations for convergence.

IV-C Material Identification Methodology

Suppose that the object is known to be constituted by one of several possible materials, whose permittivity and conductivity are measured precisely in advance. Note that only materials with obvious differences in permittivity or conductivity can be distinguished. The material identification methodology consists of two steps: first clustering and then classification.

In order to determine the material of the target, we first need to distinguish between the part of domain DD occupied by the air and the part occupied by the target. To accomplish this, we utilize the K-means clustering algorithm to divide the sampling points in DD into two categories [31]. K-means is an unsupervised algorithm with strong generalization of clusters for different shapes and sizes, and is guaranteed to converge regardless of the target. Since the relative permittivity and conductivity have different dimensions, we adopt the dimensionless and scale-invariant Mahalanobis distance in the K-means clustering algorithm [32]. The number of clusters is predetermines to be 22, representing the air and the target respectively. The cluster centroid of the air, representing the average permittivity and conductivity values of the air, is expected to be close to the (1,0)(1,0) point. On the other hand, the cluster centroid of the target, representing its average permittivity and conductivity, is expected to be notably far away from the (1,0)(1,0) point.

After clustering is performed, the next step is to determine the material category of the target. This is done by calculating the Mahalanobis distance between the cluster centroid of the target material and the ground-truth values of the permittivity and conductivity for each possible material. The target is then classified into the material category with the shortest Mahalanobis distance which indicates the closest match between the measured EM properties of the target and the known properties of the materials.

The computational complexity of the material identification is dominated by the K-means clustering algorithm, whose complexity is 𝒪(MIiter)\mathcal{O}(MI_{iter}) [33], where IiterI_{iter} represents the number of iterations for convergence.

V Beamforming Matrix Design Methodology

In this section, the beamforming matrix is designed to optimize the initial sensing matrix 𝐄~0\tilde{\mathbf{E}}^{0} based on BA. The beamforming matrix design is carried out before the sensing iteration, and is unrelated to the target RPCD distribution. For notational brevity, we will omit the superscript 0 in the remainder of this section.

V-A Mutual Coherence Based Design Criterion

The restricted isometry property (RIP) [34] and the mutual coherence [35] of the sensing matrix 𝐄~\tilde{\mathbf{E}} are the two most common criteria to evaluate the accuracy of recovery in (53). The RIP provides the tighter bound, while it is NP-hard to evaluate [36]. The mutual coherence μ\mu of 𝐄~\tilde{\mathbf{E}} is easier to calculate and is defined as the maximum of μij(𝐄~)\mu_{ij}(\tilde{\mathbf{E}}) for iji\neq j defined as:

μij(𝐄~)=|𝐄~[:,i]𝐄~[:,j]|𝐄~[:,i]2𝐄~[:,j]2=|Gij||Gii||Gjj|,\mu_{ij}(\tilde{\mathbf{E}})=\frac{\left|\tilde{\mathbf{E}}[:,i]^{\top}\tilde{\mathbf{E}}[:,j]\right|}{\left\|\tilde{\mathbf{E}}[:,i]\right\|_{2}\left\|\tilde{\mathbf{E}}[:,j]\right\|_{2}}=\frac{\left|G_{ij}\right|}{\sqrt{\left|G_{ii}\right|\left|G_{jj}\right|}}, (56)

where GijG_{ij} denotes the (i,j)(i,j)th element of the Gram matrix 𝐄~𝐄~\tilde{\mathbf{E}}^{\top}\tilde{\mathbf{E}}.

The Gram matrix of the general sensing matrix can be decomposed into the weighted sum of the Gram matrix of the sensing matrix for all KK subcarriers according to (52):

𝐄~𝐄~\displaystyle\tilde{\mathbf{E}}^{\top}\tilde{\mathbf{E}} =k=1K𝐄k𝐄k\displaystyle=\sum_{k=1}^{K}\mathbf{E}_{k}^{\top}\mathbf{E}_{k}
=k=1K[(𝐃k)ωcωk(𝐃k)(𝐃k)ωcωk(𝐃k)][(𝐃k)ωcωk(𝐃k)(𝐃k)ωcωk(𝐃k)]\displaystyle=\sum_{k=1}^{K}\left[\!\!\!\begin{array}[]{ll}\Re\left(\mathbf{D}_{k}\right)&\!-\frac{\omega_{c}}{\omega_{k}}\Im\left(\mathbf{D}_{k}\right)\\ \Im\left(\mathbf{D}_{k}\right)&\!\frac{\omega_{c}}{\omega_{k}}\Re\left(\mathbf{D}_{k}\right)\end{array}\!\!\!\!\right]^{\top}\!\!\!\left[\!\!\!\begin{array}[]{ll}\Re\left(\mathbf{D}_{k}\right)&\!-\frac{\omega_{c}}{\omega_{k}}\Im\left(\mathbf{D}_{k}\right)\\ \Im\left(\mathbf{D}_{k}\right)&\!\frac{\omega_{c}}{\omega_{k}}\Re\left(\mathbf{D}_{k}\right)\end{array}\!\!\!\right] (61)
=(a)k=1K[(𝐃kH𝐃k)(ωcωk)(𝐃kH𝐃k)(ωcωk)(𝐃kH𝐃k)(ωcωk)2(𝐃kH𝐃k)],\displaystyle\overset{(a)}{=}\sum_{k=1}^{K}\left[\begin{array}[]{cc}\Re(\mathbf{D}_{k}^{H}\mathbf{D}_{k})&-(\frac{\omega_{c}}{\omega_{k}})\Im(\mathbf{D}_{k}^{H}\mathbf{D}_{k})\\ (\frac{\omega_{c}}{\omega_{k}})\Im(\mathbf{D}_{k}^{H}\mathbf{D}_{k})&(\frac{\omega_{c}}{\omega_{k}})^{2}\Re(\mathbf{D}_{k}^{H}\mathbf{D}_{k})\end{array}\!\right],\! (64)

where =(a)\overset{(a)}{=} comes from the following equality:

𝐃kH𝐃k\displaystyle\mathbf{D}_{k}^{H}\mathbf{D}_{k} =(𝐃k)(𝐃k)+(𝐃k)(𝐃k)\displaystyle=\Re(\mathbf{D}_{k})^{\top}\Re(\mathbf{D}_{k})+\Im(\mathbf{D}_{k})^{\top}\Im(\mathbf{D}_{k})
+j[(𝐃k)(𝐃k)(𝐃k)(𝐃k)].\displaystyle+j\left[\Re(\mathbf{D}_{k})^{\top}\Im(\mathbf{D}_{k})-\Im(\mathbf{D}_{k})^{\top}\Re(\mathbf{D}_{k})\right]. (65)

In order to minimize the mutual coherence of the general sensing matrix 𝐄~\tilde{\mathbf{E}}, we need to minimize the absolute value of off-diagonal elements in 𝐄~𝐄~\tilde{\mathbf{E}}^{\top}\tilde{\mathbf{E}}. According to (64), the objective is to minimize the absolute value of real parts of the off-diagonal elements in 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k} and the absolute value of imaginary parts of all elements in 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k} for all kk. Since the diagonal elements in 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k} are all real numbers, the objective is to minimize the absolute value of both real and imaginary parts of the off-diagonal elements, i.e, to minimize the mutual coherence of 𝐃k\mathbf{D}_{k} for all kk.

Substituting the BA-based initial guess 𝐃k0=(𝐖~k𝐇1,k)𝐇2,k\mathbf{D}_{k}^{0}=\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)\circ\mathbf{H}_{2,k} into 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k}, we can compute the (i,j)(i,j)th element of 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k} as (66) at the top of the next page.

(𝐃kH𝐃k)[i,j]\displaystyle\left(\mathbf{D}_{k}^{H}\mathbf{D}_{k}\right)[i,j] =((𝐖~k𝐇1,k)[:,i]𝐇2,k[:,i])H((𝐖~k𝐇1,k)[:,j]𝐇2,k[:,j])\displaystyle=\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,i]\otimes\mathbf{H}_{2,k}[:,i]\right)^{H}\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,j]\otimes\mathbf{H}_{2,k}[:,j]\right)
=((𝐖~k𝐇1,k)[:,i]H𝐇2,k[:,i]H)((𝐖~k𝐇1,k)[:,j]𝐇2,k[:,j])\displaystyle=\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,i]^{H}\otimes\mathbf{H}_{2,k}[:,i]^{H}\right)\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,j]\otimes\mathbf{H}_{2,k}[:,j]\right)
=(a)((𝐖~k𝐇1,k)[:,i]H(𝐖~k𝐇1,k)[:,j])(𝐇2,k[:,i]H𝐇2,k[:,j])\displaystyle\overset{(a)}{=}\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,i]^{H}\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,j]\right)\otimes\left(\mathbf{H}_{2,k}[:,i]^{H}\mathbf{H}_{2,k}[:,j]\right)
=(b)((𝐖~k𝐇1,k)[:,i]H(𝐖~k𝐇1,k)[:,j])(𝐇2,k[:,i]H𝐇2,k,[:,j])\displaystyle\overset{(b)}{=}\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,i]^{H}\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)[:,j]\right)\left(\mathbf{H}_{2,k}[:,i]^{H}\mathbf{H}_{2,k},[:,j]\right) (66)

In (66), =(a)\overset{(a)}{=} comes from the equality (𝐀𝐁)(𝐂𝐃)=(𝐀𝐂)(𝐁𝐃)(\mathbf{A}\otimes\mathbf{B})(\mathbf{C}\otimes\mathbf{D})=(\mathbf{A}\mathbf{C})\otimes(\mathbf{B}\mathbf{D}), while =(b)\overset{(b)}{=} holds true because the Kronecker product is taken between two scalars and is equivalent to the scalar product. Integrating (66) for all elements in 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k}, we can formulate 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k} as:

𝐃kH𝐃k=((𝐖~k𝐇1,k)H(𝐖~k𝐇1,k))(𝐇2,kH𝐇2,k).\displaystyle\!\mathbf{D}_{k}^{H}\mathbf{D}_{k}\!=\!\left(\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)^{H}\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)\right)\!\odot\!\left(\mathbf{H}_{2,k}^{H}\mathbf{H}_{2,k}\right). (67)
Refer to caption
(a) d=10d=10 m
Refer to caption
(b) d=20d=20 m
Refer to caption
(c) d=40d=40 m
Figure 2: Absolute values of Gram matrix 𝐄~𝐄~\tilde{\mathbf{E}}^{\top}\tilde{\mathbf{E}} normalized by its largest element is demonstrated after designing the beamforming matrix for different dd.

Since 𝐇2,kH𝐇2,k\mathbf{H}_{2,k}^{H}\mathbf{H}_{2,k} is determined by the positions of the target and the receiver, 𝐇2,kH𝐇2,k\mathbf{H}_{2,k}^{H}\mathbf{H}_{2,k} is not subject to change. Thus, minimizing the off-diagonal elements of 𝐃kH𝐃k\mathbf{D}_{k}^{H}\mathbf{D}_{k} is equivalent to minimizing the off-diagonal elements of (𝐖~k𝐇1,k)H(𝐖~k𝐇1,k)\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)^{H}\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right). Hence, we focus on designing (𝐖~k𝐇1,k)H(𝐖~k𝐇1,k)\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right)^{H}\left(\tilde{\mathbf{W}}_{k}^{\top}\mathbf{H}_{1,k}^{\top}\right) in (67) to minimize the mutual coherence of 𝐃k\mathbf{D}_{k}.

Since we consider a fully-digital beamforming transmitter, 𝐃k\mathbf{D}_{k} can be designed in the identical way for any subcarrier of an arbitrary index kk. Thus, we will omit the subscript kk for notational brevity in the remainder of this section.

Denote 𝐃p=Δ𝐇1\mathbf{D}_{p}\overset{\Delta}{=}\mathbf{H}_{1}^{\top} and 𝐖=Δ𝐖~\mathbf{W}\overset{\Delta}{=}\tilde{\mathbf{W}}^{\top}. In order to minimize the mutual coherence of 𝐖𝐃p\mathbf{W}\mathbf{D}_{p}, we can solve the following optimization problem that is cast in terms of the Gram matrix 𝐆p=(𝐖𝐃p)H(𝐖𝐃p)M×M\mathbf{G}_{p}=(\mathbf{W}\mathbf{D}_{p})^{H}(\mathbf{W}\mathbf{D}_{p})\in\mathbb{C}^{M\times M}:

𝐖^=\displaystyle\hat{\mathbf{W}}= argmin𝐖,α(𝐖𝐃p)H(𝐖𝐃p)α𝐓F2\displaystyle\arg\,\min_{\mathbf{W},\,\alpha}\,\|(\mathbf{WD}_{p})^{H}(\mathbf{WD}_{p})-\alpha\mathbf{T}\|_{F}^{2} (68a)
s.t.\displaystyle\mathrm{s.t.\,\,} tr(𝐖H𝐖)PK,\displaystyle\mathrm{tr}(\mathbf{W}^{H}\mathbf{W})\leq\frac{P}{K}, (68b)

where 𝐓M×M\mathbf{T}\in\mathbb{C}^{M\times M} denotes the target matrix of 𝐆p\mathbf{G}_{p}, PP denotes the general power budget at the transmitter which is assumed to be evenly allocated to all KK subcarriers, and α\alpha denotes the auxiliary scaling factor. The mutual coherence of 𝐖𝐃p\mathbf{W}\mathbf{D}_{p} is not affected by the scaling factor that is utilized to satisfy the power constraint. We refer to equation (68) as the mutual coherence based design criterion due to its connection with the mutual coherence outlined in (56). This relationship is further exemplified by the interplay among various Gram matrices 𝐄~𝐄~\tilde{\mathbf{E}}^{\top}\tilde{\mathbf{E}}, 𝐃kH𝐃k{\mathbf{D}_{k}}^{H}{\mathbf{D}_{k}}, and (𝐖𝐃p)H(𝐖𝐃p)(\mathbf{W}\mathbf{D}_{p})^{H}(\mathbf{W}\mathbf{D}_{p}), as detailed in equations (67) and (64).

In order to build a robust sensing system that is able to deal with the representation error, a promising approach is to employ the Gram matrix of 𝐃p\mathbf{D}_{p} as the target Gram [35], [37]. Similar to [35], 𝐓\mathbf{T} is judiciously designed using the element-wise absolute value of 𝐃pH𝐃p\mathbf{D}_{p}^{H}\mathbf{D}_{p}, where the element of 𝐓\mathbf{T} is formulated as:

Tij=|𝐃p[:,i]H𝐃p[:,j]|,1i,jM.T_{ij}=\left|\mathbf{D}_{p}[:,i]^{H}\mathbf{D}_{p}[:,j]\right|,1\leq i,j\leq M. (69)

Since multiplying 𝐖\mathbf{W} by a scalar does not change the mutual coherence of 𝐖𝐃p\mathbf{W}\mathbf{D}_{p}, we can remove the power budget constraint and neglect the scaling factor α\alpha in (68) to find an unnormalized beamforming matrix 𝐖u\mathbf{W}^{u} without the power constraint. Thus, (68) can be transformed into an unconstrained optimization problem over 𝐖u\mathbf{W}^{u} as:

𝐖^u=\displaystyle\hat{\mathbf{W}}^{u}= argmin𝐖u(𝐖uDp)H(𝐖uDp)𝐓F2.\displaystyle\arg\,\min_{\mathbf{W}^{u}}\|(\mathbf{W}^{u}\textbf{D}_{p})^{H}(\mathbf{W}^{u}\textbf{D}_{p})-\mathbf{T}\|_{F}^{2}. (70)

Let the singular value decomposition (SVD) of 𝐃𝐩\mathbf{\mathbf{D}_{p}} be 𝐃𝐩=𝐔𝐃p𝚺𝐃p𝐕𝐃pH\mathbf{\mathbf{D}_{p}}=\mathbf{U}_{\mathbf{D}_{p}}\boldsymbol{\Sigma}_{\mathbf{D}_{p}}\mathbf{V}_{\mathbf{D}_{p}}^{H}. By defining 𝚿=𝐖u𝐔𝐃p𝚺𝐃p\mathbf{\Psi}=\mathbf{W}^{u}\mathbf{U}_{\mathbf{D}_{p}}\boldsymbol{\Sigma}_{\mathbf{D}_{p}}, (68) can be written as:

𝚿^=argmin𝚿𝐕𝐃p𝚿H𝚿𝐕𝐃pH𝐓F2.\hat{\mathbf{\Psi}}=\arg\,\min_{\mathbf{\Psi}}\|\mathbf{V}_{\mathbf{D}_{p}}\mathbf{\Psi}^{H}\mathbf{\Psi}\mathbf{V}_{\mathbf{D}_{p}}^{H}-\mathbf{T}\|_{F}^{2}. (71)

Since 𝐕𝐃p\mathbf{V}_{\mathbf{D}_{p}} is a unitary matrix that does not change the Frobenius norm by multiplication, (71) is equivalent to

𝚿^=argmin𝚿𝚿H𝚿𝐕𝐃pH𝐓𝐕𝐃pF2.\displaystyle\hat{\mathbf{\Psi}}=\arg\,\min_{\mathbf{\Psi}}\|\mathbf{\Psi}^{H}\mathbf{\Psi}-\mathbf{V}_{\mathbf{D}_{p}}^{H}\mathbf{T}\mathbf{V}_{\mathbf{D}_{p}}\|_{F}^{2}. (72)

Since (72) is a quartic optimization problem that is neither convex nor concave over 𝚿\mathbf{\Psi}, problem (72) is non-convex. Therefore, we recast (72) in terms of the Gram matrix 𝐆Ψ=𝚿H𝚿\mathbf{G}_{\Psi}=\boldsymbol{\Psi}^{H}\boldsymbol{\Psi} and the new target matrix 𝐙=𝐕𝐃pH𝐓𝐕𝐃p\mathbf{Z}=\mathbf{V}_{\mathbf{D}_{p}}^{H}\mathbf{T}\mathbf{V}_{\mathbf{D}_{p}} as:

𝐆^Ψ=\displaystyle\hat{\mathbf{G}}_{\Psi}= argmin𝐆Ψ𝐆Ψ𝐙F2\displaystyle\arg\,\min_{\mathbf{G}_{\Psi}}\|\mathbf{G}_{\Psi}-\mathbf{Z}\|_{F}^{2} (73a)
s.t.\displaystyle\mathrm{s.t.\,\,} 𝐆Ψ0,rank(𝐆Ψ)I.\displaystyle\mathbf{G}_{\Psi}\succeq\textbf{0},\,\text{rank}(\mathbf{G}_{\Psi})\leq I. (73b)

The rank constraint in (73b) comes from the fact that the dimensions of 𝚿\boldsymbol{\Psi} are I×NtI\times N_{t}, which determines the rank of 𝐆ΨNt×Nt\mathbf{G}_{\Psi}\in\mathbb{C}^{N_{t}\times N_{t}} to be smaller than or equal to II. Although (73a) is convex over 𝐆Ψ\mathbf{G}_{\Psi} after transformation, the rank constraint in (73b) makes (73) non-convex. Note that we do not employ semidefinite relaxation (SDR) [38], because the optimization problem in (73) is a semi-definite low-rank approximation problem, whose optimal solution can be obtained using the generalized Eckart-Young Theorem as [39], [40]:

𝐆^Ψ=i=1min{I,z}λi𝐪i𝐪iH,\hat{\mathbf{G}}_{\Psi}=\sum_{i=1}^{\text{min}\{I,z\}}\lambda_{i}\mathbf{q}_{i}\mathbf{q}_{i}^{H}, (74)

where the Hermitian target matrix 𝐙\mathbf{Z} has the eigen-decomposition: 𝐙=𝐐𝚲𝐐H=i=1Mλi𝐪i𝐪iH\mathbf{Z}=\mathbf{Q}\mathbf{\Lambda}\mathbf{Q}^{H}=\sum_{i=1}^{M}\lambda_{i}\mathbf{q}_{i}\mathbf{q}_{i}^{H} with λ1λM\lambda_{1}\geq\ldots\geq\lambda_{M}, and zz denotes the number of non-negative eigenvalues of 𝐙\mathbf{Z}. After the optimal positive semi-definite matrix 𝐆^Ψ\hat{\mathbf{G}}_{\Psi} is obtained by (74), 𝚿^\hat{\boldsymbol{\Psi}} that satisfies 𝚿^H𝚿^=𝐆^Ψ\hat{\boldsymbol{\Psi}}^{H}\hat{\boldsymbol{\Psi}}=\hat{\mathbf{G}}_{\Psi} is then found from the eigen-decomposition of 𝐆^Ψ\hat{\mathbf{G}}_{\Psi}:

𝚿^={𝚲I𝐐IH, if Iz[𝐐z𝚲zH,𝟎]H, if I>z,\displaystyle\hat{\boldsymbol{\Psi}}=\begin{cases}\mathbf{\Lambda}_{I}\mathbf{Q}_{I}^{H},&\text{ if }I\leq z\\ {\left[\mathbf{Q}_{z}\mathbf{\Lambda}_{z}^{H},\mathbf{0}\right]^{H},}&\text{ if }I>z\end{cases}, (75)

where 𝐐I\mathbf{Q}_{I} (or 𝐐z\mathbf{Q}_{z}) is defined as the matrix that only takes the first II (or zz) columns of 𝐐\mathbf{Q}, and 𝚲I\mathbf{\Lambda}_{I} (or 𝚲z\mathbf{\Lambda}_{z}) is defined as the diagonal matrix that only takes the first II (or zz) columns and rows of 𝚲\mathbf{\Lambda}. Then, the optimal unnormalized beamforming matrix 𝐖^u\hat{\mathbf{W}}^{u} that solves (70) can be formulated as:

𝐖^u=𝚿^𝚺𝐃p1𝐔𝐃pH.\hat{\mathbf{W}}^{u}=\hat{\boldsymbol{\Psi}}\boldsymbol{\Sigma}_{\mathbf{D}_{p}}^{-1}\mathbf{U}_{\mathbf{D}_{p}}^{H}. (76)

Considering that the power budget PP is evenly allocated to KK subcarriers at the transmitter, the optimal beamforming matrix should be normalized as:

𝐖^=PK𝐖^u𝐖^uF.\hat{\mathbf{W}}=\sqrt{\frac{P}{K}}\frac{\hat{\mathbf{W}}^{u}}{\|\hat{\mathbf{W}}^{u}\|_{F}}. (77)

V-B Computational Complexity

In this subsection, we analyze the computational complexity of designing the beamforming matrix 𝐖^\hat{\mathbf{W}} in the previous subsection. For each subcarrier, the computational complexity of calculating SVD of 𝐃p\mathbf{D}_{p} is 𝒪(min(Nt2M,NtM2))\mathcal{O}(\min(N_{t}^{2}M,N_{t}M^{2})); the computational complexity of calculating 𝐓\mathbf{T} and 𝐙\mathbf{Z} is 𝒪(M2Nt+Nt2M)\mathcal{O}(M^{2}N_{t}+N_{t}^{2}M); the computational complexity of calculating 𝐆^𝚿\hat{\mathbf{G}}_{\boldsymbol{\Psi}} is 𝒪(min(I,z)M2)\mathcal{O}(\min(I,z)M^{2}); the computational complexity of calculating 𝚿^\hat{\boldsymbol{\Psi}} and 𝐖^u\hat{\mathbf{W}}^{u} is 𝒪(min(I,z)Nt2)\mathcal{O}(\min(I,z)N_{t}^{2}); the computational complexity of calculating 𝐖^\hat{\mathbf{W}} is 𝒪(INt)\mathcal{O}(IN_{t}). Thus, the overall computational complexity of designing the beamforming matrices 𝐖^\hat{\mathbf{W}} of all KK subcarriers is given by 𝒪([M2Nt+Nt2M+min(I,z)(M2+Nt2)]K)\mathcal{O}([M^{2}N_{t}+N_{t}^{2}M+\min(I,z)(M^{2}+N_{t}^{2})]K).

V-C Influence of Transmitter-Target Distance on Sensing

In this subsection, we analyze the influence of the transmitter-target distance based on the effective degrees of freedom (EDOF) of the transmitter-target sensing system [41]. Define the correlation matrix of the transmitter-target channel of an arbitrary subcarrier as 𝐑=𝐇1𝐇1H\mathbf{R}=\mathbf{H}_{1}\mathbf{H}_{1}^{H}. The EDOF of the transmitter-target sensing system is a function of 𝐑\mathbf{R} denoted by Ξ\Xi, and can be approximately calculated as [42], [43]:

Ξ=(tr(𝐑)𝐑F)2=(i=1Mσi)2i=1Mσi2,\Xi=\left(\frac{\operatorname{tr}(\mathbf{R})}{\|\mathbf{R}\|_{F}}\right)^{2}=\frac{\left(\sum_{i=1}^{M}\sigma_{i}\right)^{2}}{\sum_{i=1}^{M}\sigma_{i}^{2}}, (78)

where σi\sigma_{i} is the ii-th eigenvalue of 𝐑\mathbf{R}. In the far-field sensing scenarios, the leading eigenvalue of 𝐑\mathbf{R} is significantly larger than the other eigenvalues, and the EDOF is close to 11 corresponding to the only dominant sensing mode where a planar wave travels from the transmitter to the target [44]. Thus, the target is required to be located within the near field of the transmitter where the EDOF is significantly larger than 11, which enables accurate RPCD reconstruction and material identification.

VI Simulation Results and Analysis

Refer to caption

Figure 3: Mutual coherence of the general sensing matrix 𝐄~\tilde{\mathbf{E}} with the increase of the number of subcarriers KK.

In this section, we use the EM simulation software Ansys HFSS to simulate the transmission process in the ISAC system and to generate the received signals, which are used in reconstructing the EM property and identifying the material of the target. Suppose the center of the target is located at the origin. We consider a uniform linear array (ULA) transmitter equipped with Nt=1024N_{t}=1024 antennas. The ULA transmitter is parallel to the yy-axis, and its center is located at (xt,yt)=(d,0)(x_{t},y_{t})=(d,0) m, where dd denotes the distance from the transmitter to the target. Suppose a ULA receiver equipped with Nr=16N_{r}=16 antennas is located at (xr,yr)=(20,20)(x_{r},y_{r})=(-20,-20) m and is parallel to the ULA transmitter. The inter-antenna spacing for both the transmitter and the receiver is set as λc/2\lambda_{c}/2. The central frequency is fc=30f_{c}=30 GHz and the frequency step of OFDM subcarriers is Δf=200\Delta f=200 KHz. In each subcarrier, I=32I=32 pilot OFDM symbols are transmitted. Suppose prior knowledge determines that the target is located within the region D=[1,1]×[1,1]D=[-1,1]\times[-1,1] m2\mathrm{m}^{2}. We choose the number of sampling points in the domain DD as M=32×32=1024M=32\times 32=1024. Each sampling point in DD can be regarded as a pixel in the image, i.e., the RPCD image is composed of 32×32=102432\times 32=1024 pixels. More pixels could hardly improve the RPCD reconstruction quality due to the resolution limit.

Besides, we introduce the normalized mean square error (NMSE) of RPCD reconstruction as the criterion to quantitatively describe the performance of EM property sensing

NMSE\displaystyle\mathrm{NMSE} =10log10𝐬𝐬^22𝐬22\displaystyle=10\log_{10}\frac{\left\|\mathbf{s}-\hat{\mathbf{s}}\right\|_{2}^{2}}{\left\|\mathbf{s}\right\|_{2}^{2}}
=10log10ϵrϵ^r22+1ωc2ϵ02𝝈𝝈^22ϵr22+1ωc2ϵ02𝝈22.\displaystyle=10\log_{10}\frac{\left\|\boldsymbol{\epsilon}_{r}-\hat{\boldsymbol{\epsilon}}_{r}\right\|_{2}^{2}+\frac{1}{\omega_{c}^{2}\epsilon_{0}^{2}}\left\|\boldsymbol{\sigma}-\hat{\boldsymbol{\sigma}}\right\|_{2}^{2}}{\left\|\boldsymbol{\epsilon}_{r}\right\|_{2}^{2}+\frac{1}{\omega_{c}^{2}\epsilon_{0}^{2}}\left\|\boldsymbol{\sigma}\right\|_{2}^{2}}. (79)

According to (79), the NMSE of RPCD combines the estimation error of both ϵ\boldsymbol{\epsilon} and 𝝈\boldsymbol{\sigma}, which comprehensively assess the EM property sensing performance.

In order to provide a visual example of the mutual coherence of the general sensing matrix 𝐄~\tilde{\mathbf{E}}, we show the absolute values of Gram matrix 𝐄~𝐄~\tilde{\mathbf{E}}^{\top}\tilde{\mathbf{E}} normalized by its largest element in Fig. 2. We set the number of subcarriers to be K=32K=32. It is seen from Fig. 2 that the off-diagonal components are generally much smaller than the diagonal components, indicating that the mutual coherence is relatively small after designing the beamforming matrix. However, with an increase in the distance between the transmitting antennas and the target, the mutual coherence also increases correspondingly. This is because as the distance between the transmitting antennas and the target increases, the channel matrix can become more ill-conditioned or closer to being singular. The correlation degree of adjacent lattice points in DD is then increased, which will be reflected in the reduction of the reconstructed RPCD resolution.

Refer to caption

Figure 4: Change of EDOF with the increase of the number of sampling points MM in the domain DD.

Refer to caption

Figure 5: NMSE of PRCD versus SNR at the receiver with K=32K=32.
Refer to caption
(a) Target relative permittivity
Refer to caption
(b) Reconstrcted relative permittivity
with SNR = 10 dB
Refer to caption
(c) Reconstrcted relative permittivity
with SNR = 30 dB
Refer to caption
(d) Target conductivity
Refer to caption
(e) Reconstrcted conductivity with SNR = 10 dB
Refer to caption
(f) Reconstrcted conductivity with SNR = 30 dB
Figure 6: RPCD reconstruction results versus SNR with d=20d=20 m and K=32K=32. Unit of conductivity is mS/m.

Correspondingly, the change of mutual coherence of the general sensing matrix 𝐄~\tilde{\mathbf{E}} with the increase of the number of subcarriers KK is demonstrated in Fig. 3. It is seen that μ\mu decreases with the increase of KK, which indicates that the multi-frequency scheme can enhance the EM property sensing performance. When KK reaches a certain threshold, μ\mu scarcely changes, where the transmitter-target distance dd is the decisive factor of sensing performance. When the distance becomes larger, the mutual coherence of 𝐄~\tilde{\mathbf{E}} also becomes larger, which indicates worse sensing quality.

In order to demonstrate the change of EDOF for the transmitter-target channel with the increase of the number of sampling points in the domain DD, we show the EDOF of the central-frequency subcarrier with the increase of MM in Fig. 4. We define LL as the limit value of Ξ\Xi when MM approaches infinity in (78). EDOF increases with the increase of MM almost linearly until it reaches an upper bound. As shown in Fig. 4, when the distance between the target and the transmitter becomes larger, the upper bound of EDOF is smaller and is reached at a smaller MM, indicating that the RPCD reconstruction quality is worse.

VI-A RPCD Reconstruction Performance versus SNR

We investigate NMSE of reconstructed RPCD versus the SNR at the receiver, as shown in Fig. 5. We set the number of subcarriers to be K=32K=32 and the distance between the target and the transmitter to be d=10,20d=10,20, and 4040 m, respectively. It is seen from Fig. 5 that NMSE decreases with the increase of SNR for all dd, and the best performance is achieved when d=10d=10 m. When SNR is smaller than 1212 dB, the NMSE is large and decreases slowly with the increase of SNR. In this stage, the differences among the NMSE for different dd are not pronounced. The NMSE decreases rapidly when SNR increases from 1515 dB to 2020 dB. When SNR reaches certain thresholds, the NMSE decreases to the error floor and hardly changes. At this point, the restriction of RPCD reconstruction quality is no longer the noise at the receiver, but is the imperfect condition of the mutual coherence of the sensing matrix. As the target gets farther away from the transmitter, the mutual coherence of the sensing matrix becomes larger, leading to a larger error floor in RPCD reconstruction. Moreover, an error floor is reached at lower SNR levels.

To illustrate the RPCD reconstruction results vividly, we present the reconstructed images of the target based on relative permittivity (or conductivity) when d=20d=20 m and K=32K=32 for SNR =10=10 dB and 3030 dB, respectively. As shown in Fig. 6, both relative permittivity and conductivity reconstructed distribution can reproduce the general shape of the target. The RPCD reconstructed at SNR =30=30 dB is more accurate to demonstrate the target’s shape compared to the RPCD reconstructed at SNR =10=10 dB. Moreover, a higher SNR value results in more accurate reconstructed values of relative permittivity and conductivity, which leads to better representation of the target’s real EM property.

Refer to caption

Figure 7: NMSE of PRCD versus KK with SNR = 30 dB.
Refer to caption
(a) Target relative permittivity
Refer to caption
(b) Reconstructed relative permittivity with KK = 16
Refer to caption
(c) Reconstructed relative permittivity with KK = 64
Refer to caption
(d) Target conductivity
Refer to caption
(e) Reconstructed conductivity with KK = 16
Refer to caption
(f) Reconstructed conductivity with KK = 64
Figure 8: RPCD reconstruction results versus KK with d=20d=20 m and SNR = 30 dB. Unit of conductivity is mS/m.

VI-B RPCD Reconstruction Performance versus Bandwidth

We investigate NMSE of reconstructed RPCD versus the bandwidth by changing the number of subcarriers KK while keeping the frequency step unchanged, as shown in Fig. 7. We set SNR = 30 dB and the distance between the target and the transmitter to be d=10d=10, 20, and 4040 m, respectively. It is seen from Fig. 7 that, NMSE decreases with the increase of KK for all dd, and the best performance is achieved when d=10d=10 m. As the target gets farther from the transmitter, the mutual coherence of the sensing matrix becomes larger, causing larger errors in RPCD reconstruction. Although the mutual coherence of the general sensing matrix 𝐄~\tilde{\mathbf{E}} do not change significantly in K[16,64]K\in[16,64] according to Fig. 3, the increase of KK enlarges the row number of 𝐄~\tilde{\mathbf{E}} and leads to more measurement data, which improves the accuracy of RPCD reconstruction.

To illustrate the RPCD reconstruction results vividly, we present the reconstructed images of the target based on relative permittivity (or conductivity) with d=20d=20 m and SNR = 30 dB for K=16K=16 and 6464, respectively. As shown in Fig. 8, the RPCD reconstructed with K=64K=64 is more accurate to demonstrate the target’s shape compared to the RPCD reconstructed at K=16K=16. Moreover, a larger number of subcarriers results in more accurate reconstructed values of relative permittivity and conductivity, which leads to the better representation of the target’s real EM property.

VI-C Material Classification Accuracy versus SNR

Refer to caption

Figure 9: Classification between the air and the target using the K-means clustering method.

Refer to caption

Figure 10: Material classification accuracy versus SNR.

Suppose the target may be composed of 1010 possible kinds of homogenous materials, such as wood, concrete, etc, whose relative permittivity and conductivity are precisely known. The shape of the target is set to be identical to the “T” shape in Fig. 6, while the EM property of the target is decided by the material.

To provide an example of classification between the air and the target, we show the K-means clustering results when K=32K=32, SNR = 2020 dB and d=20d=20 m in Fig. 9. In Fig. 9, each data point represents a sampling point in the domain DD, and the colors of the data points represent the classification results. It is seen that, the cluster centroid of the air, representing the average permittivity and conductivity values of the air, is close to the (1,0)(1,0) point. On the other hand, the cluster centroid of the target material, representing its average permittivity and conductivity, is far away from the (1,0)(1,0) point. Thus, the sampling points occupied by air and those occupied by the target can be distinguished.

Using the sampling points occupied by the target, the material classification accuracy versus SNR with different dd when K=32K=32 is shown in Fig. 10. We conduct 10000 Monte Carlo experiments for each material under each simulation setting. It is seen in Fig. 10 that, the classification accuracy increases with the increase of SNR for all dd, and the best performance is achieved with d=10d=10 m. When SNR is smaller than 1212 dB, the accuracy is smaller than 50%50\%, and the differences among the classification accuracies with different dd are not pronounced. The accuracy increases rapidly when SNR increases from 1010 dB to 2020 dB and reaches an upper bound at a certain threshold of SNR.

VI-D Material Classification Accuracy versus Bandwidth

Refer to caption

Figure 11: Material classification accuracy versus KK.

Under the same simulation setting as in the previous subsection, we investigate the material classification accuracy versus the bandwidth by changing the number of subcarriers KK while keeping the frequency step unchanged, as shown in Fig. 11. We set SNR = 30 dB and d=10,20,d=10,20, and 4040 m respectively. It is seen that, the classification accuracy increases with the increase of KK for all dd. The best performance is achieved with d=10d=10 m and K=64K=64, where the accuracy is 96.7%96.7\%. When KK is larger than 3232, the accuracies with all dd are larger than 50%50\%. Generally speaking, the larger dd leads to the lower RPCD reconstruction error, which further results in the higher classification accuracy according to Fig. 7 and Fig. 11.

VII Conclusion

In this paper, we propose a groundbreaking EM property sensing and material identification scheme in ISAC systems by utilizing OFDM pilot signals. We develop an end-to-end EM propagation model grounded in Maxwell equations, enabling the reconstruction of relative permittivity and conductivity distributions within a defined sensing region. We then propose a multi-frequency EM property sensing method, employing compressive sensing techniques, and involving the optimization of the beamforming matrices. Simulation results demonstrate that the proposed method is capable of achieving high-quality RPCD reconstruction and accurate material classification. This paper opens new possibilities for precise EM property sensing in ISAC systems, with implications for applications demanding advanced material identification capabilities.

References

  • [1] W. Großmann, H. Horn, and O. Niggemann, “Improving remote material classification ability with thermal imagery,” Scientific Reports, vol. 12, no. 1, p. 17288, 2022.
  • [2] J. L. Miller, Principles of infrared technology. Springer, 1994.
  • [3] P. Gao, L. Lian, and J. Yu, “Cooperative ISAC with direct localization and rate-splitting multiple access communication: A pareto optimization framework,” IEEE J. Sel. Areas Commun., vol. 41, no. 5, pp. 1496–1515, 2023.
  • [4] Q. Zhang, H. Sun, X. Gao, X. Wang, and Z. Feng, “Time-division ISAC enabled connected automated vehicles cooperation algorithm design and performance evaluation,” IEEE J. Sel. Areas Commun., vol. 40, no. 7, pp. 2206–2218, 2022.
  • [5] X. Cheng, D. Duan, S. Gao, and L. Yang, “Integrated sensing and communications (ISAC) for vehicular communication networks (VCN),” IEEE Internet Things J., vol. 9, no. 23, pp. 23441–23451, 2022.
  • [6] F. Gao, L. Xu, and S. Ma, “Integrated sensing and communications with joint beam-squint and beam-split for mmwave/thz massive mimo,” IEEE Trans. Commun., 2023.
  • [7] Z. Ren, Y. Peng, X. Song, Y. Fang, L. Qiu, L. Liu, D. W. K. Ng, and J. Xu, “Fundamental CRB-rate tradeoff in multi-antenna ISAC systems with information multicasting and multi-target sensing,” IEEE Trans. Wireless Commun., 2023.
  • [8] Y. Jiang, F. Gao, Y. Liu, S. Jin, and T. Cui, “Near field computational imaging with RIS generated virtual masks,” 2023.
  • [9] F. Dong, F. Liu, Y. Cui, W. Wang, K. Han, and Z. Wang, “Sensing as a service in 6G perceptive networks: A unified framework for ISAC resource allocation,” IEEE Trans. Wireless Commun., 2022.
  • [10] X. Meng, F. Liu, C. Masouros, W. Yuan, Q. Zhang, and Z. Feng, “Vehicular connectivity on complex trajectories: Roadway-geometry aware isac beam-tracking,” IEEE Trans. Wireless Commun., 2023.
  • [11] N. Su, F. Liu, and C. Masouros, “Sensing-assisted eavesdropper estimation: An ISAC breakthrough in physical layer security,” IEEE Trans. Wireless Commun., 2023.
  • [12] K. Chen, C. Qi, O. A. Dobre, and G. Y. Li, “Simultaneous beam training and target sensing in ISAC systems with RIS,” IEEE Trans. Wireless Commun., 2023.
  • [13] Z. He, W. Xu, H. Shen, D. W. K. Ng, Y. C. Eldar, and X. You, “Full-duplex communication for ISAC: Joint beamforming and power optimization,” IEEE J. Sel. Areas Commun., 2023.
  • [14] S. Li, W. Yuan, C. Liu, Z. Wei, J. Yuan, B. Bai, and D. W. K. Ng, “A novel ISAC transmission framework based on spatially-spread orthogonal time frequency space modulation,” IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1854–1872, 2022.
  • [15] Y. Tao and Z. Zhang, “Distributed computational imaging with reconfigurable intelligent surface,” in 2020 International Conference on Wireless Communications and Signal Processing (WCSP), pp. 448–454, Oct. 2020.
  • [16] Y. Jiang, F. Gao, M. Jian, S. Zhang, and W. Zhang, “Reconfigurable intelligent surface for near field communications: Beamforming and sensing,” IEEE Trans. Wireless Commun., vol. 22, no. 5, pp. 3447–3459, 2023.
  • [17] A. Alkhateeb, S. Jiang, and G. Charan, “Real-time digital twins: Vision and research directions for 6g and beyond,” IEEE Communications Magazine, 2023.
  • [18] Y. Cui, W. Yuan, Z. Zhang, J. Mu, and X. Li, “On the physical layer of digital twin: An integrated sensing and communications perspective,” IEEE J. Sel. Areas Commun., 2023.
  • [19] J. O. Vargas and R. Adriano, “Subspace-based conjugate-gradient method for solving inverse scattering problems,” IEEE Trans. Antennas Propag., vol. 70, no. 12, pp. 12139–12146, 2022.
  • [20] T.-F. Wei, X.-H. Wang, L. Wang, Z. Feng, and B.-Z. Wang, “Efficient born iterative method for inverse scattering based on modified forward-solver,” IEEE Access, vol. 8, pp. 229101–229107, 2020.
  • [21] N. Zaiping, Y. Feng, Z. Yanwen, and Z. Yerong, “Variational born iteration method and its applications to hybrid inversion,” IEEE Trans. Geosci. Remote Sens., vol. 38, no. 4, pp. 1709–1715, 2000.
  • [22] Z. Liu and Z. Nie, “Subspace-based variational born iterative method for solving inverse scattering problems,” IEEE Geoscience and Remote Sensing Letters, vol. 16, no. 7, pp. 1017–1020, 2019.
  • [23] J. O. Vargas and R. Adriano, “Subspace-based conjugate-gradient method for solving inverse scattering problems,” IEEE Transactions on Antennas and Propagation, vol. 70, no. 12, pp. 12139–12146, 2022.
  • [24] Y. Ren, Q. H. Liu, and Y. P. Chen, “A hybrid FEM/MoM method for 3-D electromagnetic scattering in layered medium,” IEEE Trans. Antennas Propag., vol. 64, no. 8, pp. 3487–3495, 2016.
  • [25] F. M. Kahnert, “Numerical methods in electromagnetic scattering theory,” Journal of Quantitative Spectroscopy and Radiative Transfer, vol. 79, pp. 775–824, 2003.
  • [26] W. Hou, M. Azadifar, M. Rubinstein, Q. Zhang, and F. Rachidi, “An efficient fdtd method to calculate lightning electromagnetic fields over irregular terrain adopting the moving computational domain technique,” IEEE Trans. Electromagn. Compat., vol. 62, no. 3, pp. 976–980, 2019.
  • [27] F.-F. Wang and Q. H. Liu, “A hybrid Born iterative Bayesian inversion method for electromagnetic imaging of moderate-contrast scatterers with piecewise homogeneities,” IEEE Trans. Antennas Propag., vol. 70, no. 10, pp. 9652–9661, 2022.
  • [28] C. Stoeckle, J. Munir, A. Mezghani, and J. A. Nossek, “DoA estimation performance and computational complexity of subspace-and compressed sensing-based methods,” in WSA 2015; 19th International ITG Workshop on Smart Antennas, pp. 1–6, VDE, 2015.
  • [29] D. Tajik, R. Kazemivala, and N. K. Nikolova, “Real-time imaging with simultaneous use of Born and Rytov approximations in quantitative microwave holography,” IEEE Trans. Microw. Theory Tech., vol. 70, no. 3, pp. 1896–1909, 2021.
  • [30] J. Guillemoteau, P. Sailhac, and M. Behaegel, “Fast approximate 2D inversion of airborne tem data: Born approximation and empirical approach,” Geophysics, vol. 77, no. 4, pp. WB89–WB97, 2012.
  • [31] M. Ahmed, R. Seraj, and S. M. S. Islam, “The K-means algorithm: A comprehensive survey and performance evaluation,” Electronics, vol. 9, no. 8, p. 1295, 2020.
  • [32] E. Bayram and V. Nabiyev, “Image segmentation by using k-means clustering algorithm in euclidean and mahalanobis distance calculation in camouflage images,” in 2020 28th Signal Processing and Communications Applications Conference (SIU), pp. 1–4, IEEE, 2020.
  • [33] X. Jin and J. Han, K-Means Clustering, pp. 563–564. Boston, MA: Springer US, 2010.
  • [34] E. Candes and T. Tao, “Decoding by linear programming,” IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203–4215, 2005.
  • [35] B. Kilic, A. Güngör, M. Kalfa, and O. Arıkan, “Adaptive measurement matrix design in direction of arrival estimation,” IEEE Trans. Signal Process., vol. 70, pp. 4742–4756, 2022.
  • [36] D. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289–1306, 2006.
  • [37] T. Huang, Y. Liu, H. Meng, and X. Wang, “Adaptive compressed sensing via minimizing cramer–rao bound,” IEEE Signal Process. Lett., vol. 21, no. 3, pp. 270–274, 2014.
  • [38] Z.-q. Luo, W.-k. Ma, A. M.-c. So, Y. Ye, and S. Zhang, “Semidefinite relaxation of quadratic optimization problems,” IEEE Signal Processing Magazine, vol. 27, no. 3, pp. 20–34, 2010.
  • [39] G. H. Golub, A. Hoffman, and G. W. Stewart, “A generalization of the Eckart-Young-Mirsky matrix approximation theorem,” Linear Algebra and its applications, vol. 88, pp. 317–327, 1987.
  • [40] A. Dax et al., “Low-rank positive approximants of symmetric matrices,” Advances in Linear Algebra & Matrix Theory, vol. 4, no. 03, p. 172, 2014.
  • [41] Y. Jiang and F. Gao, “Electromagnetic channel model for near field MIMO systems in the half space,” IEEE Commun. Lett., vol. 27, no. 2, pp. 706–710, 2023.
  • [42] T. A. Sleasman, M. F. Imani, A. V. Diebold, M. Boyarsky, K. P. Trofatter, and D. R. Smith, “Implementation and characterization of a two-dimensional printed circuit dynamic metasurface aperture for computational microwave imaging,” IEEE Trans. Antennas Propagat., vol. 69, no. 4, pp. 2151–2164, Apr. 2021.
  • [43] G. Sun, R. He, B. Ai, Z. Ma, P. Li, Y. Niu, J. Ding, D. Fei, and Z. Zhong, “A 3D wideband channel model for RIS-assisted MIMO communications,” IEEE Trans. Vehi. Tech., vol. 71, no. 8, pp. 8016–8029, Aug. 2022.
  • [44] 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, Aug. 2022.