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

Uplink Sensing in Perceptive Mobile Networks with Asynchronous Transceivers

Zhitong Ni, , J. Andrew Zhang, ,
Xiaojing Huang, , Kai Yang,  , and Jinhong Yuan
Z. Ni and K. Yang are with the School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China. Z. Ni is also with the Global Big Data Technologies Centre, University of Technology Sydney, Sydney, NSW 2007, Australia (Emails: zhitong.ni@student.uts.edu.au, yangkai@ieee.org). J. A. Zhang and X. Huang are with the Global Big Data Technologies Centre, University of Technology Sydney, Sydney, NSW 2007, Australia (Emails: Andrew.Zhang@uts.edu.au, Xiaojing.Huang@uts.edu.au).J. Yuan is with the University of New South Wales, Sydney, NSW 2052, Australia (Email: J.Yuan@unsw.edu.au).
Abstract

Perceptive mobile network (PMN) is a recently proposed next-generation network that integrates radar sensing into communication. One major challenge for realizing sensing in PMNs is how to deal with spatially-separated asynchronous transceivers. The asynchrony between sensing receiver and transmitter will cause both timing offsets (TOs) and carrier frequency offsets (CFOs) and lead to degraded sensing accuracy in both ranging and velocity measurements. In this paper, we propose an uplink sensing scheme for PMNs with asynchronous transceivers, targeting at resolving the sensing ambiguity and improving the sensing accuracy. We first adopt a cross-antenna cross-correlation (CACC) operation to remove the sensing ambiguity associated with both TOs and CFOs. Without sensing ambiguity, both actual propagation delay and actual Doppler frequency of multiple targets can be obtained using CACC outputs. To exploit the redundancy of the CACC outputs and reduce the complexity, we then propose a novel mirrored-MUSIC algorithm, which halves the number of unknown parameters to be estimated, for obtaining actual values of delays and Doppler frequencies. Finally, we propose a high-resolution angles-of-arrival (AoAs) estimation algorithm, which jointly processes all measurements from spatial, temporal, and frequency domains. The proposed AoAs estimation algorithm can achieve significantly higher estimation accuracy than that of using samples from the spatial domain only. We also derive the theoretical mean-square-error of the proposed algorithms. Numerical results are provided and validate the effectiveness of the proposed scheme.

Index Terms:
Joint communication and radar sensing, dual-functional radar-communications, uplink sensing, mirrored-MUSIC, perceptive mobile network,

I Introduction

The emerging joint communication and radar sensing (JCAS) techniques, aka, dual-functional radar-communications (DFRC), integrate communication and radar sensing functions into one system by sharing a single transmitted signal and many hardware and signal processing modules [1, 2, 3, 4, 5, 6]. The integration not only achieves immediate benefits of reduced size, power consumption, cost, and improved spectrum efficiency but also helps to establish a communication link using sensing information or vise versa [7]. The perceptive mobile network (PMN) [8, 9, 10, 11] is a recently proposed next-generation mobile network based on the JCAS techniques. The concept of PMN was first introduced in [8] and then elaborated in [9]. Evolving from the current communication-only mobile network, PMN is expected to serve as a ubiquitous radar-sensing network, whilst providing uncompromising mobile communication services.

Although PMN and its systematic framework were introduced in [8], JCAS technologies have been actively studied in the past decade, particularly the technologies closely related to modern mobile networks. In [12], the orthogonal-frequency-division-multiplexing (OFDM) signal was used for sensing and communication simultaneously. Also using the OFDM signals, the authors in [13] developed a smoothing approach that jointly estimates the delay and Doppler frequency of targets moving at high speed. In the scenario of multiuser systems, the authors in [14] proposed an interleaved OFDM signal model to mitigate the multiuser interference (MUI). The authors in [15] analyzed the MUI tolerance of a multiple-input multiple-out (MIMO) JCAS system in terms of the resulting radar signal-to-interference-plus-noise ratio (SINR), using the signal model in [14]. In [16], the authors used separated antenna arrays to realize dual-function JCAS systems. A multi-objective function was further applied to trade off the similarity of the generated waveform to the desired one in [17]. It is noted that all these papers use a co-located DFRC transceiver, similar to a mono-static radar, and face an essential requirement of the full-duplex capability of the transceiver [18]. Alternative solutions other than full-duplex transceiver exist but require changes to existing network infrastructure, e.g., the authors in [19] used a synchronized single-antenna sensing receiver that is sufficiently separated from the transmitter.

Since the full-duplex technology is not quite mature, there exists an optional transceiver setup for realizing JCAS in PMNs, similar to a bi-static radar [20], where the sensing receiver is physically separated from the transmitter. This setup is consistent with the uplink sensing as defined in [9]. Such a setup can be implemented with minimal network changes only and is a favorite option in the near term. Some works have been done for realizing JCAS for the uplink channels [21, 22]. In [21], the authors investigated the uplink sensing in a 5G cellular network using massive MIMO and coexisting with a radar in the same frequency band. The authors adopted broadband OFDM modulation and obtained the uplink channel via minimum-mean-squared-error (MMSE) or zero-forcing (ZF) based processing schemes. In [22], the authors proposed a receiver architecture for DFRC systems and obtained its corresponding uplink communication channel capacity and radar channel capacity, respectively. The main challenges for realizing this setup in PMNs are (1) the unavailability of clock-level synchronization between the sensing receiver and the transmitter; (2) the relatively low angle-of-arrival (AoA) estimation accuracy due to the rich multi-path environment in mobile networks [9]. Perfect synchronization was assumed in most recent papers about JCAS, whereas the asynchrony between the sensing receiver and the transmitter is not addressed yet. Some papers on cognitive radio have dealt with the asynchronous issues [23, 24] but they are unrelated to JCAS. These works analyzed the interferences caused by asynchrony but did not provide an effective way for parameter estimation. Without clock-level synchronization between the sensing receiver and the transmitter, both timing offsets (TOs) and carrier frequency offsets (CFOs) can occur [25, 26], leading to sensing ambiguity and degraded accuracy in estimating delay and Doppler frequency of targets.

To handle the asynchronous transceivers, a limited number of works on passive WiFi sensing have been proposed based on a cross-antenna cross-correlation (CACC) method [25, 26, 27]. The underlying principle of CACC is that TOs can be removed by computing the cross-correlation between signals of multiple receiving antennas and exploiting the same TO across multiple antennas in one device. In [25], CACC is applied to resolve the AoA estimation problem for device-free human tracking with commodity WiFi devices. In [26], CACC is used to resolve the ranging estimation problem for passive human tracking using a single WiFi link. Unfortunately, there exists a derivative problem with the CACC method, i.e., the outputs from CACC contain mirrored unknown parameters. The mirrored parameters double the number of unknown parameters and also obscured the sign of Doppler frequencies, leading to a degraded sensing accuracy. The author in [25] proposed an add-minus suppression (AMS) method that suppresses the mirrored parameters and extracts the actual ones. However, the AMS method needs the power of static paths to be much stronger than that of the dynamic paths, otherwise the mirrored component is suppressed slightly in a rich multi-path environment.

To overcome the challenge of low AoA estimation accuracy in the physically-separated transceiver, techniques based on spatial smoothing and combining measurements in spatial and other domains have been proposed [28, 29, 30]. In [28], the authors proposed a high-resolution two-dimension (2D) MUSIC estimator via spatial smoothing, to obtain accurate AoA estimates with a small scale of antennas. In [29], the authors jointly combined spatial and temporal measurements to obtain high-resolution AoA estimation. In [30], the authors defined a spatial path filter that is used to separate signals from multiple propagation paths and obtained the AoAs via CACC outputs. All these methods are designed for narrowband systems and they do not have the capability of jointly estimating AoAs and other parameters such as delay and Doppler frequency.

In this paper, we propose a broadband uplink sensing scheme for PMNs with physically-separated asynchronous transceivers and OFDM modulation. There are two key novelties in our scheme. Firstly, since the mirrored components derived from the CACC outputs have not been addressed properly in prior works, we propose a mirrored-MUSIC algorithm that jointly processing the actual and mirrored parameters to overcome the mirrored parameter problem associated with CACC. Secondly, noting that the estimates of AoAs are not included in the proposed mirrored-MUSIC algorithm, we propose a high-resolution AoA estimation algorithm that can obtain high-resolution estimates of AoAs by combining spatial and other domain measurements. Our proposed scheme is applicable for practical scenarios requiring a single static user equipment (UE) and a line-of-sight (LOS) path between the static transmitter and the base station (BS). Our major contributions are summarized as follows.

  • We provide a practical radar sensing scheme that can be implemented in mobile networks without the requirement of clock-level synchronization between the transmitter and receiver. By using a CACC method to mitigate the TOs and CFOs resulted from asynchrony, our scheme relaxes stringent clock-level synchronization between physically-separated transceivers. The mean-squared-error (MSE) between the CACC output and our desired signal also keeps at a minimum level.

  • We propose a mirrored-MUSIC algorithm to handle the mirrored outputs of the CACC method and a general problem where the test basis vectors show mirror symmetry. The algorithm, which halves the unknown variables without introducing any approximation, has lower complexity and better performances compared to conventional MUSIC. This algorithm can also be applied to many other applications, such as traditional harmonic retrieval problems with the sinusoidal modulated signals [31, 32], ESPRIT [29], and the matrix pencil method [33].

  • We develop a high-resolution MUSIC-based AoA estimation algorithm that combines measurements from spatial, temporal, and frequency domains. This algorithm equivalently increases the samples in the spatial domain and hence significantly improves the resolution of AoAs, compared with estimating the AoAs in the spatial domain only. In particular, a new issue of “ambiguity of basis vectors” occurs when integrating multiple parameters into one domain measurement. Our algorithm resolves this critical issue in combining multi-domain measurements by selecting multiple peaks from the MUSIC outputs.

The rest of this paper is organized as follows. Section II introduces system and channel models. Section III presents the CACC method. Section IV introduces the proposed mirrored-MUSIC algorithm for estimating the actual delays and Doppler frequencies. Section V presents the high-resolution AoA estimation scheme. Extensive simulation results are presented in Section VI. Finally, conclusions are drawn in Section VII.

Notations: 𝐚\rm\bf a denotes a vector, 𝐀\rm\bf A denotes a matrix, italic English letters like NN and lower-case Greek letters α\alpha are a scalar, a\angle a is the phase angle of complex value aa. |𝐀|,𝐀T,𝐀H,𝐀|{\rm\bf A}|,{\rm\bf A}^{T},{\rm\bf A}^{H},{\rm\bf A}^{\dagger} represent determinant value, transpose, conjugate transpose, pseudo inverse, respectively. We denote Frobenius norm of a matrix as 𝐀F\|{\rm\bf A}\|_{F}. We use diag(α1,,αk){\rm diag}(\alpha_{1},\cdots,\alpha_{k}) to denote a diagonal matrix. [𝐀]N[{\rm\bf A}]_{N} is the NNth column of a matrix and [𝐀]N[{\rm\bf A}]^{N} is the NNth row of a matrix.

Refer to caption
Figure 1: Illustration of the system model for uplink sensing.

II System and Channel Models

We consider the uplink communication and sensing in a PMN, as shown in Fig. 1. Multiple UEs communicate with a BS. The BS is physically static and uses received uplink signals for both communication and sensing. Each UE has one antenna and the BS has a limited number of NN antennas. Our proposed scheme in this paper requires the following setups:

  • The signals used for sensing are from a specific UE of which location is fixed and known to the BS.

  • There is a LOS propagation path between the BS and the UE used for sensing. The power of the LOS path is much larger than that of non-LOS (NLOS) paths.

This setup is practically feasible for PMNs. The fixed UE can be a node that provides fixed broadband access in the mobile network. We can adopt the millimeter-wave frequency band to guarantee the dominating power of the LOS path. In PMN, several types of signals may be used for sensing. Referring to the fifth-generation (5G) mobile network, they can be demodulation reference signals (DMRSs) that are specifically provided for channel estimation, synchronization signal blocks (SSBs), and even demodulated data symbols [34, 35, 36, 37]. Without loss of generality, we consider sensing via the uplink signal from a specific UE, denoted as UE 1.

At all UEs, we adopt a simplified packet structure, as shown in Fig. 2. In each packet, training symbols, denoted as preambles, are followed by a sequence of data symbols. OFDM modulation is applied across the whole packet. These data symbols can be empty if the packet is a DMRS. We only use the OFDM preambles for sensing. The preambles can also be used for synchronization and channel estimation for communications, which needs different processing at the BS. In this paper, we would like to use the preambles for sensing multiple targets in the PMN. The parameters of targets including the propagation delay, Doppler frequency, and AoA need to be obtained. Our proposed scheme can also be applied to other systems with similar signal structure, such as WiFi systems.

Refer to caption
Figure 2: Illustration of transmitted OFDM packets at the UE baseband.

Without losing generality, we assume each packet has only one preamble. For both preamble symbol and data symbol, each of them has GG subcarriers with a subcarrier interval of 1/T1/T, where TT denotes the length of an OFDM symbol. Each of the OFDM symbols is prepended by a cyclic prefix (CP) of period TCT_{\rm C}. Our scheme works if and only if a segment of subcarriers with an interleaved interval is available for UE 1. When multiple UEs communicate with the BS, each UE occupies a unique segment of subcarriers with the interleaved interval as in [15]. For notational simplicity, we assume that UE 1 occupies the whole preamble symbol here. Mathematically, the mmth preamble symbol can be expressed as [13, 14]

s(t|m)=g=0G1exp(j2πgtT)rect(tT+TC)x[m,g],\displaystyle s(t|m)=\sum\limits_{g=0}^{G-1}\exp\left(j2\pi g\frac{t}{T}\right){\rm rect}\left(\frac{t}{T+T_{\rm C}}\right)x[m,g], (1)

where x[m,g]x[m,g] is a modulated symbol transmitted on the ggth subcarrier of the mmth preamble symbol and rect(tT+TC){\rm rect}\left(\frac{t}{T+T_{\rm C}}\right) denotes a rectangular window of length T+TCT+T_{\rm C}.

The BS receives the preambles using a uniform linear array (ULA) of NN antennas. The uplink channel between receiver at BS and the transmitter at UE 1 has LL NLOS paths reflected or refracted from LL targets, together with a dominating LOS path, where the index of the LOS path is denoted as l=0l=0. Let αl\alpha_{l}, fD,lf_{{\rm D},l}, τl\tau_{l} and θl\theta_{l} denote the channel gain, the Doppler frequency, the propagation delay, and the AoA of the llth path, respectively. Due to the fixed locations of BS and UE 1, we assume that the parameters, τ0\tau_{0} and θ0\theta_{0}, which correspond to the LOS path, are known at the BS, and fD,0f_{{\rm D},0} is 0. We also assume that |α0||αl|,l{1,,L}|\alpha_{0}|\gg|\alpha_{l}|,\forall l\in\{1,\cdots,L\}. Note that the Doppler frequency of the llth path comes from the llth target of the channel, which can be either positive or negative depending on the moving directions.

We assume that MM packets are sent at the same interval, denoted as TAT_{\rm A}, at the UE baseband. Since there is typically no synchronization at clock level between BS and UE 1, the received signal has an unknown time-varying TO, denoted as δτ(m)\delta_{\tau}(m), associated with the clock asynchrony, even if the packet level synchronization is achieved. Hence, the total time delay during signal propagation for the llth target as seen by BS equals τl+δτ(m)\tau_{l}+\delta_{\tau}(m). In [26], it is shown that there also exists an unknown time-varying CFO due to the asynchronous carrier frequency, denoted as δf(m)\delta_{f}(m). The received time-domain signal corresponding to the preamble symbol in the mmth packet can be represented as [26]

𝐲(t|m)=\displaystyle{\bf y}(t|m)= l=0Lαlej2πm(TA+δτ(m)+τl)(fD,l+δf(m))×\displaystyle\sum\limits_{l=0}^{L}\alpha_{l}e^{j2\pi m(T_{\rm A}+\delta_{\tau}(m)+\tau_{l})(f_{{\rm D},l}+\delta_{f}(m))}\times
s(tτlδτ(m))𝐚(Ωl)+𝐳(t|m)\displaystyle s(t-\tau_{l}-\delta_{\tau}(m)){\bf a}(\Omega_{l})+{\bf z}(t|m)
\displaystyle\approx l=0Lαlej2πmTA(fD,l+δf(m))×\displaystyle\sum\limits_{l=0}^{L}\alpha_{l}e^{j2\pi mT_{\rm A}(f_{{\rm D},l}+\delta_{f}(m))}\times
s(tτlδτ(m))𝐚(Ωl)+𝐳(t|m),\displaystyle s(t-\tau_{l}-\delta_{\tau}(m)){\bf a}(\Omega_{l})+{\bf z}(t|m), (2)

where the vector, 𝐚(Ωl)=exp[jΩl(0,1,,N1)]T{\bf a}(\Omega_{l})=\exp[j\Omega_{l}(0,1,\cdots,N-1)]^{T}, is the array response vector of size N×1N\times 1, with Ωl\Omega_{l} being 2πdλcosθl\frac{2\pi d}{\lambda}\cos\theta_{l}, dd denoting the antenna interval, λ\lambda denoting the wavelength, and θl\theta_{l} being the AoA from the llth target, and 𝐳(t|m){\bf z}(t|m) is a complex additive-white-Gaussian-noise (AWGN) vector with zero mean and variance of σ2\sigma^{2}. TO is typically time-varying and has a random value that changes during any two discontinuous transmissions. The CFO may slowly vary over time. It is noted that TO and CFO are mixed with the actual propagation delay and the actual Doppler frequency, respectively. Hence they can directly cause ambiguity of ranging and velocity measurements. They also make the total delay and total Doppler frequency vary with time and prevent from aggregating signals for joint processing. It should be noted that, for the communication purpose, there is no need to distinguish the actual parameters with these offsets, since they can be estimated as a whole value and then be removed. As for the radar sensing purpose, these offsets have to be mitigated since the range and the velocity of targets only depend on actual parameters. Note that we use the approximation ej2πm(TA+δτ(m)+τl)(fD,l+δf(m))ej2πmTA(fD,l+δf(m))e^{j2\pi m(T_{\rm A}+\delta_{\tau}(m)+\tau_{l})(f_{{\rm D},l}+\delta_{f}(m))}\approx e^{j2\pi mT_{\rm A}(f_{{\rm D},l}+\delta_{f}(m))}, since the timing values of (δτ(m)+τl)(\delta_{\tau}(m)+\tau_{l}) are much smaller than TAT_{\rm A} and (fD,l+δf(m))(f_{{\rm D},l}+\delta_{f}(m)) is also small in relation to the sampling rate.

After removing CP from the received time-domain signal, we then transform the signal into frequency domain via GG-point fast-Fourier-transform (FFT)’s. Referring to (II), the received frequency-domain signal is

yn[m,g]=\displaystyle y_{n}[m,g]= l=0LαlejnΩlej2πmTA(fD,l+δf(m))×\displaystyle\sum\limits_{l=0}^{L}\alpha_{l}e^{jn\Omega_{l}}e^{j2\pi mT_{\rm A}(f_{{\rm D},l}+\delta_{f}(m))}\times
ej2πgT(τl+δτ(m))x[m,g]+zn[m,g],\displaystyle e^{-j2\pi\frac{g}{T}(\tau_{l}+\delta_{\tau}(m))}x[m,g]+z_{n}[m,g], (3)

where yn[m,g]y_{n}[m,g] is the received frequency-domain signal on the ggth subcarrier at the nnth receiving antenna of the mmth OFDM preamble symbol, and zn[m,g]z_{n}[m,g] is a complex AWGN with zero mean and variance of σ2\sigma^{2}. The actual value of |x[m,g]|2|x[m,g]|^{2} has insignificant impact on our proposed scheme. For simplicity, we assume |x[m,g]|2=1|x[m,g]|^{2}=1.

III CACC for Mitigating TOs and CFOs

As we mentioned in Section II, the actual delays and the actual Doppler frequencies are mixed with TOs and CFOs, respectively. In this section, we adopt and extend the CACC method to generate signals with TOs and CFOs being removed, in order to obtain the delay and the Doppler frequency of targets.

We decompose the received signals into three parts, i.e.,

yn[m,g]=Dn[m,g]+In[m,g]+zn[m,g],\displaystyle y_{n}[m,g]=D_{n}[m,g]+I_{n}[m,g]+z_{n}[m,g], (4)

where Dn[m,g]D_{n}[m,g] denotes the received signal from the LOS path, given by

Dn[m,g]=\displaystyle D_{n}[m,g]= α0ejnΩ0ej2πmTAδf(m)ej2πgT(τ0+δτ(m))x[m,g],\displaystyle\alpha_{0}e^{jn\Omega_{0}}e^{j2\pi mT_{\rm A}\delta_{f}(m)}e^{-j2\pi\frac{g}{T}(\tau_{0}+\delta_{\tau}(m))}x[m,g], (5)

and In[m,g]I_{n}[m,g] is the received signals reflected or refracted from the targets, given by

In[m,g]\displaystyle I_{n}[m,g]
=\displaystyle= l=1LαlejnΩlej2πmTA(fD,l+δf(m))ej2πgT(τl+δτ(m))x[m,g].\displaystyle\sum\limits_{l=1}^{L}\alpha_{l}e^{jn\Omega_{l}}e^{j2\pi mT_{\rm A}(f_{{\rm D},l}+\delta_{f}(m))}e^{-j2\pi\frac{g}{T}(\tau_{l}+\delta_{\tau}(m))}x[m,g]. (6)

The CACC operation makes it possible to mitigate both TO and CFO. This operation computes the cross-correlation between different antennas and is generally used in estimating the AoA with hybrid subarrays [30]. We select one antenna that has the largest received average power as reference antenna. Without losing generality, we assume that the reference antenna is the 0th antenna. Neglecting the noise term, the CACC operation between the nnth antenna and the 0th antenna generates

ρn[m,g]\displaystyle\rho_{n}[m,g] =yn[m,g]y0H[m,g]\displaystyle=y_{n}[m,g]y_{0}^{H}[m,g]
(Dn[m,g]+In[m,g])(D0H[m,g]+I0H[m,g])\displaystyle\approx(D_{n}[m,g]+I_{n}[m,g])(D_{0}^{H}[m,g]+I_{0}^{H}[m,g])
ρn(1)+ρn(2)[m,g]+ρn(3)[m,g]+ρn(4)[m,g],\displaystyle\triangleq\rho_{n}^{(1)}+\rho_{n}^{(2)}[m,g]+\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g], (7)

where y0[m,g]y_{0}[m,g] is the received signal at the reference antenna, ρn(1)[m,g]=Dn[m,g]D0H[m,g]\rho_{n}^{(1)}[m,g]=D_{n}[m,g]D_{0}^{H}[m,g], ρn(2)[m,g]=In[m,g]I0H[m,g]\rho_{n}^{(2)}[m,g]=I_{n}[m,g]I_{0}^{H}[m,g], ρn(3)[m,g]=Dn[m,g]I0H[m,g]\rho_{n}^{(3)}[m,g]=D_{n}[m,g]I_{0}^{H}[m,g], and ρn(4)[m,g]=In[m,g]D0H[m,g]\rho_{n}^{(4)}[m,g]=I_{n}[m,g]D_{0}^{H}[m,g]. For those CACC outputs, we have the following proposition.

Proposition 1.

In ρn[m,g]\rho_{n}[m,g], ρn(1)[m,g]\rho_{n}^{(1)}[m,g] is invariant with mm and gg. The 2D-FFT output of ρn(3)[m,g]+ρn(4)[m,g]\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g] over mm and gg shows an impulsive shape that is centred around τl\tau_{l} and fD,lf_{{\rm D},l}. The power of ρn(2)[m,g]\rho_{n}^{(2)}[m,g] is significantly lower than the other three terms.

Proof.

The proof is provided in Appendix A. ∎

According to Proposition 1, by using a 2D high-pass filter with respect to mm and gg, we can remove the invariant component from the CACC outputs and obtain ξ^n[m,g]ρn(3)[m,g]+ρn(4)[m,g]\hat{\xi}_{n}[m,g]\approx\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g]. The cut-off frequency of the 2D high-pass filter depends on the bandwidth of ξ^n[m,g]\hat{\xi}_{n}[m,g]. From Appendix A, the cut-off frequency of ξ^n[m,g]\hat{\xi}_{n}[m,g] is (ωf,ωτ)=(min|πTAfD,l|,min(π(τlτ0)/T))(\omega_{f},\omega_{\tau})=\left(\min\left|\pi T_{\rm A}f_{{\rm D},l}\right|,\min(\pi(\tau_{l}-\tau_{0})/T)\right).

From the expression of ρn(3)[m,g]+ρn(4)[m,g]\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g], we note that ξ^n[m,g]\hat{\xi}_{n}[m,g] contains the actual sensing parameters without TOs and CFOs. The output from the high-pass filter can be represented as

ξ^n[m,g]=\displaystyle\hat{\xi}_{n}[m,g]= ρn[m,g]ρ¯n\displaystyle\rho_{n}[m,g]-\bar{\rho}_{n}
\displaystyle\approx ρn(3)[m,g]+ρn(4)[m,g]\displaystyle\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g]
=\displaystyle= l=1Lα0αlHej2πmTA(fD,l)ej2πgT(τ0τl)ejnΩ0+\displaystyle\sum\limits_{l=1}^{L}\alpha_{0}\alpha_{l}^{H}e^{j2\pi mT_{\rm A}(-f_{{\rm D},l})}e^{-j\frac{2\pi g}{T}(\tau_{0}-\tau_{l})}e^{jn\Omega_{0}}+
l=1Lαlα0Hej2πmTAfD,lej2πgT(τlτ0)ejnΩl\displaystyle\sum\limits_{l=1}^{L}\alpha_{l}\alpha_{0}^{H}e^{j2\pi mT_{\rm A}f_{{\rm D},l}}e^{-j\frac{2\pi g}{T}(\tau_{l}-\tau_{0})}e^{jn\Omega_{l}}
\displaystyle\triangleq ξn[m,g],\displaystyle\xi_{n}[m,g], (8)

where ρ¯n\bar{\rho}_{n} is the low-pass component in ρn[m,g]\rho_{n}[m,g]. Note that the delays in (III) become relative values, i.e., τlτ0\tau_{l}-\tau_{0}, (0<τ0<τl)(0<\tau_{0}<\tau_{l}). Since τ0\tau_{0} is assumed to be known at the BS, the problem of estimating τl\tau_{l} becomes how to estimate the relative delays. The error between ξ^n[m,g]\hat{\xi}_{n}[m,g] and ξn[m,g]\xi_{n}[m,g] is resulted from ρn(2)[m,g]\rho_{n}^{(2)}[m,g] and hence not affected by the noise. We define this error as the input error, i.e. e2=𝔼ξ^n[m,g]ξn[m,g]2e^{2}=\mathbb{E}\|\hat{\xi}_{n}[m,g]-\xi_{n}[m,g]\|^{2}.

In ξn[m,g]\xi_{n}[m,g], ρn(3)[m,g]\rho_{n}^{(3)}[m,g] can be seen as the side product, which is mixed with the actual component of interest, ρn(4)[m,g]\rho_{n}^{(4)}[m,g], since ρn(4)[m,g]\rho_{n}^{(4)}[m,g] already contains all sensing parameters. It would be redundant to estimate ρn(3)[m,g]\rho_{n}^{(3)}[m,g] and the estimation would require a doubled number of samples if conventional methods are used to estimate the actual component and the side product together. One idea is to separate ρn(3)[m,g]\rho_{n}^{(3)}[m,g] from ρn(4)[m,g]\rho_{n}^{(4)}[m,g], which is a challenging task. The AMS method was proposed in [26] and [25] to remove the side product. However, this method does not always work, particularly when the number of signal propagation paths is large in a rich multi-path propagation environment. In Appendix B, we briefly describe the AMS method and compare its input error with ξn[m,g]\xi_{n}[m,g] that is adopted in our scheme. We show that our adopted ξn[m,g]\xi_{n}[m,g] has a smaller input error than that of the AMS method.

IV Mirrored-MUSIC for Estimating Propagation Delays and Doppler Frequencies

In this section, we propose a mirrored-MUSIC algorithm that is tailored to directly estimating conjugated variables from signals similar to the one in (III).

MUSIC-based algorithms have been widely used for estimating different parameters of channels, including delay, Doppler frequency, and AoA [20, 26, 29]. With a given signal matrix, conventional MUSIC finds the formulation of basis vectors of the signal matrix. Utilizing the fact that the basis vectors fall into the null-space of the signal matrix, the parameter can be obtained by checking if the candidate basis vector with a testing parameter falls into the null-space of the signal matrix. Conventional MUSIC would construct ξn[m,g]\xi_{n}[m,g] into a matrix. The matrix corresponding to ξn[m,g]\xi_{n}[m,g] has a doubled number of parameters to be estimated. We will exploit this redundancy, and the estimation of both delay and Doppler frequency will be transformed into an equivalent problem with halved unknown variables. This can achieve significantly improved performance compared to the conventional MUSIC algorithms.

IV-A Proposed Mirrored-MUSIC Algorithm

With integrating the side product and the actual component, we rewrite ξn[m,g]\xi_{n}[m,g] to a general expression as

ξn[m,g]=l=L,l0LPlejmf¯D,lejgτ¯lejnΩl.\displaystyle\xi_{n}[m,g]=\sum\limits_{l^{\prime}=-L,l^{\prime}\neq 0}^{L}P_{l^{\prime}}e^{jm{\bar{f}}_{{\rm D},l^{\prime}}}e^{-jg\bar{\tau}_{l^{\prime}}}e^{jn\Omega_{l^{\prime}}}. (9)

In (9), the variables with indexes l<0l^{\prime}<0 represent those actual ones to be estimated and those with l>0l^{\prime}>0 belong to the side product, that is, PlP_{l^{\prime}} equals α0αlH\alpha_{0}\alpha_{l}^{H} and αlα0H\alpha_{l}\alpha_{0}^{H} when l>0l^{\prime}>0 and l<0l^{\prime}<0, respectively, f¯D,l=2πTAfD,l(1)step(l){\bar{f}}_{{\rm D},l^{\prime}}=2\pi T_{\rm A}f_{{\rm D},l}(-1)^{{\rm step}(l^{\prime})} denotes the mirrored Doppler frequency, τ¯l=2πT(τ0τl)(1)step(l)\bar{\tau}_{l^{\prime}}=\frac{2\pi}{T}(\tau_{0}-\tau_{l})(-1)^{{\rm step}(l^{\prime})} denotes the mirrored delay, and Ωl\Omega_{l^{\prime}} equals Ω0\Omega_{0} and Ωl\Omega_{l} when l>0l^{\prime}>0 and l<0l^{\prime}<0, respectively. It is worth pointing out that only the terms of Doppler frequency and delay exhibit mirror symmetry, i.e., the Doppler frequency and the delay of the side product are opposite to those of the actual component. The AoA terms in the side product have no such a property. By exploiting the mirror symmetry of both Doppler frequency and delay, we can reduce the number of estimates for delay and Doppler frequency by half to LL, respectively.

Let us generate two types of mirrored signal vectors based on ξn[m,g]\xi_{n}[m,g] by adding a vector with its reversed version. The two new vectors are given by

𝐩n[m,g]=\displaystyle{\bf p}_{n}[m,g]= [ξn[m,g],,ξn[m+P,g]]T+\displaystyle[\xi_{n}[m,g],\cdots,\xi_{n}[m+P,g]]^{T}+
[ξn[m+P,g],,ξn[m,g]]T,\displaystyle[\xi_{n}[m+P,g],\cdots,\xi_{n}[m,g]]^{T}, (10)

and

𝐪n[m,g]=\displaystyle{\bf q}_{n}[m,g]= [ξn[m,g],,ξn[m,g+Q]]T+\displaystyle[\xi_{n}[m,g],\cdots,\xi_{n}[m,g+Q]]^{T}+
[ξn[m,g+Q],,ξn[m,g]]T,\displaystyle[\xi_{n}[m,g+Q],\cdots,\xi_{n}[m,g]]^{T}, (11)

where PP and QQ satisfy LP<MLL\leq P<M-L and LQ<GLL\leq Q<G-L, respectively, P,QP\in{\mathbb{N}},Q\in{\mathbb{N}}. The applied ranges of PP and QQ guarantee that there are at least LL mirrored vectors that are linearly independent of each other. The proposed mirrored vectors exhibit mirror symmetry too. It is clear to see that the iith entry of 𝐩[m,g]{\bf p}[m,g] is the same with the (Pi)(P-i)th entry and the iith entry of 𝐪[m,g]{\bf q}[m,g] is the same with the (Qi)(Q-i)th entry. More importantly, we have the following theorem.

Theorem 1.

The signal vectors, 𝐩n[m,g]{\bf p}_{n}[m,g] and 𝐪n[m,g]{\bf q}_{n}[m,g], have only LL basis vectors, respectively.

Proof.

We define two types of mirrored basis vectors as

𝐩m(f¯D,l)=\displaystyle{\bf p}_{m}(\bar{f}_{{\rm D},l^{\prime}})= [ejmf¯D,l,,ej(m+P)f¯D,l]T+\displaystyle\left[e^{jm\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{j(m+P)\bar{f}_{{\rm D},l^{\prime}}}\right]^{T}+
[ej(m+P)f¯D,l,,ejmf¯D,l]T,\displaystyle\left[e^{j(m+P)\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{jm\bar{f}_{{\rm D},l^{\prime}}}\right]^{T},
l{±1,,±L},m{0,,MP1},\displaystyle l^{\prime}\in\{\pm 1,\cdots,\pm L\},m\in\{0,\cdots,M-P-1\}, (12)

and

𝐪g(τ¯l)=\displaystyle{\bf q}_{g}(\bar{\tau}_{l^{\prime}})= [ejgτ¯l,,ej(g+Q)τ¯l]T+\displaystyle\left[e^{-jg\bar{\tau}_{l^{\prime}}},\cdots,e^{-j(g+Q)\bar{\tau}_{l^{\prime}}}\right]^{T}+
[ej(g+Q)τ¯l,,ejgτ¯l]T,\displaystyle\left[e^{-j(g+Q)\bar{\tau}_{l^{\prime}}},\cdots,e^{-jg\bar{\tau}_{l^{\prime}}}\right]^{T},
l{±1,,±L},g{0,,GQ1}.\displaystyle l^{\prime}\in\{\pm 1,\cdots,\pm L\},g\in\{0,\cdots,G-Q-1\}. (13)

It is noted that

𝐩n[m,g]=l=L,l0LPlejgτ¯lejnΩl𝐩m(f¯D,l),\displaystyle{\bf p}_{n}[m,g]=\sum\limits_{l^{\prime}=-L,l^{\prime}\neq 0}^{L}P_{l^{\prime}}e^{-jg\bar{\tau}_{l^{\prime}}}e^{jn\Omega_{l^{\prime}}}{\bf p}_{m}(\bar{f}_{{\rm D},l^{\prime}}), (14)

and

𝐪n[m,g]=l=L,l0LPlejmf¯D,lejnΩl𝐪g(τ¯l).\displaystyle{\bf q}_{n}[m,g]=\sum_{l^{\prime}=-L,l^{\prime}\neq 0}^{L}P_{l^{\prime}}e^{jm\bar{f}_{{\rm D},l^{\prime}}}e^{jn\Omega_{l^{\prime}}}{\bf q}_{g}(\bar{\tau}_{l^{\prime}}). (15)

Hence, 𝐩m(f¯D,l){\bf p}_{m}(\bar{f}_{{\rm D},l^{\prime}}) and 𝐪g(τ¯l){\bf q}_{g}(\bar{\tau}_{l^{\prime}}), l{±1,,±L},l^{\prime}\in\{\pm 1,\cdots,\pm L\}, are the basis vectors of 𝐩n[m,g]{\bf p}_{n}[m,g] and 𝐪n[m,g]{\bf q}_{n}[m,g], respectively.

Then, we need to prove that those mirrored basis vectors only span a space of rank LL. For 𝐩m(f¯D,l){\bf p}_{m}(\bar{f}_{{\rm D},l^{\prime}}), we have

𝐩m(f¯D,l)=\displaystyle{\bf p}_{m}(\bar{f}_{{\rm D},-l^{\prime}})= [ejmf¯D,l,,ej(m+P)f¯D,l]T+\displaystyle\left[e^{-jm\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{-j(m+P)\bar{f}_{{\rm D},l^{\prime}}}\right]^{T}+
[ej(m+P)f¯D,l,,ejmf¯D,l]T\displaystyle\left[e^{-j(m+P)\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{-jm\bar{f}_{{\rm D},l^{\prime}}}\right]^{T}
=\displaystyle= [ejmf¯D,l,,ej(m+P)f¯D,l]Tej(2m+P)f¯D,l+\displaystyle\left[e^{jm\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{j(m+P)\bar{f}_{{\rm D},l^{\prime}}}\right]^{T}e^{-j(2m+P)\bar{f}_{{\rm D},l^{\prime}}}+
[ej(m+P)f¯D,l,,ejmf¯D,l]Tej(2m+P)f¯D,l\displaystyle\left[e^{j(m+P)\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{jm\bar{f}_{{\rm D},l^{\prime}}}\right]^{T}e^{-j(2m+P)\bar{f}_{{\rm D},l^{\prime}}}
=\displaystyle= 𝐩m(f¯D,l)ej(2m+P)f¯D,l.\displaystyle{\bf p}_{m}(\bar{f}_{{\rm D},l^{\prime}})e^{-j(2m+P)\bar{f}_{{\rm D},l^{\prime}}}. (16)

and

𝐩m+1(f¯D,l)=\displaystyle{\bf p}_{m+1}(\bar{f}_{{\rm D},l^{\prime}})= [ej(m+1)f¯D,l,,ej(m+1+P)f¯D,l]T+\displaystyle[e^{j(m+1)\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{j(m+1+P)\bar{f}_{{\rm D},l^{\prime}}}]^{T}+
[ej(m+1+P)f¯D,l,,ej(m+1)f¯D,l]T\displaystyle[e^{j(m+1+P)\bar{f}_{{\rm D},l^{\prime}}},\cdots,e^{j(m+1)\bar{f}_{{\rm D},l^{\prime}}}]^{T}
=𝐩m(f¯D,l)ejf¯D,l.\displaystyle={\bf p}_{m}(\bar{f}_{{\rm D},l^{\prime}})e^{j\bar{f}_{{\rm D},l^{\prime}}}. (17)

Therefore, all vectors of 𝐩m(f¯D,l){\bf p}_{m}(\bar{f}_{{\rm D},-l^{\prime}}), m,l\forall m,\forall l^{\prime}, have only LL linearly independent basis vectors, i.e., {𝐩0(f¯D,l)}l=1L\{{\bf p}_{0}(\bar{f}_{{\rm D},l^{\prime}})\}_{l^{\prime}=1}^{L}. Likewise, for 𝐪g(τ¯l){\bf q}_{g}(\bar{\tau}_{l^{\prime}}), we have

𝐪g(τ¯l)=𝐪g,lej(2g+Q)τ¯l,\displaystyle{\bf q}_{g}(\bar{\tau}_{-l^{\prime}})={\bf q}_{g,l^{\prime}}e^{j(2g+Q)\bar{\tau}_{l^{\prime}}}, (18)

and

𝐪g+1(τ¯l)=𝐪g,lejτ¯l.\displaystyle{\bf q}_{g+1}(\bar{\tau}_{l^{\prime}})={\bf q}_{g,l^{\prime}}e^{-j\bar{\tau}_{l^{\prime}}}. (19)

Therefore, all vectors of 𝐪g(τ¯l){\bf q}_{g}(\bar{\tau}_{l^{\prime}}), g,l\forall g,\forall l^{\prime}, have only LL linearly independent basis vectors, i.e., {𝐪g(τ¯l)}l=1L\{{\bf q}_{g}(\bar{\tau}_{l^{\prime}})\}_{l^{\prime}=1}^{L}. Overall, 2L(MP)2L(M-P) 𝐩m,l{\bf p}_{m,l^{\prime}} span a space of rank LL and 2L(GQ)2L(G-Q) 𝐪g,l{\bf q}_{g,l^{\prime}} span a space of rank LL. ∎

The class of MUSIC algorithms requires the formulation of basis vectors that can span the entire signal space. Directly using ξn[m,g]\xi_{n}[m,g] to construct the signal matrix, as in the case of the conventional MUSIC, would require 2L2L basis vectors due to the side product. The proposed mirrored signal vectors have only LL basis vectors that can span the whole signal space.

For 𝐩n[m,g]{\bf p}_{n}[m,g], n{1,,N1}n\in\{1,\cdots,N-1\}, m{0,,MP1}m\in\{0,\cdots,M-P-1\}, and g{0,,G1}g\in\{0,\cdots,G-1\}, there are G(N1)(MP)G(N-1)(M-P) vectors in total. For 𝐪n[m,g]{\bf q}_{n}[m,g], n{1,,N1}n\in\{1,\cdots,N-1\}, m{0,,M1}m\in\{0,\cdots,M-1\}, and g{0,,GQ1}g\in\{0,\cdots,G-Q-1\}, there are M(N1)(GQ)M(N-1)(G-Q) vectors in total. Due to the high computational complexity of singular value decomposition (SVD) in MUSIC, stacking all signal vectors into a matrix would lead to prohibitive complexity. Instead, we fix nn and gg as n0n_{0} and g0g_{0}, respectively, and stack 𝐩n0[m,g0]{\bf p}_{n_{0}}[m,g_{0}], m{0,,MP1}m\in\{0,\cdots,M-P-1\}, into a matrix of dimension (P+1)×(MP)(P+1)\times(M-P), i.e.,

𝐏=[𝐩n0[0,g0],𝐩n0[1,g0],,𝐩n0[MP1,g0]].\displaystyle{\bf P}=[{\bf p}_{n_{0}}[0,g_{0}],{\bf p}_{n_{0}}[1,g_{0}],\cdots,{\bf p}_{n_{0}}[M-P-1,g_{0}]]. (20)

Neglecting the noise term, all column vectors in 𝐏{\bf P} can be expressed by {𝐩0(f¯D,l)}l=1L\left\{{\bf p}_{0}(\bar{f}_{{\rm D},l^{\prime}})\right\}_{l^{\prime}=1}^{L}. Hence, the rank of 𝐏{\bf P} is LL. Similarly, we can stack all 𝐪n0[m0,g]{\bf q}_{n_{0}}[m_{0},g], g{0,,(GQ1)}g\in\{0,\cdots,(G-Q-1)\}, into a matrix, denoted as 𝐐{\bf Q}, which is also of rank LL. The optimal value of n0n_{0} is demonstrated in Proposition 2. As for optimizing m0m_{0} and g0g_{0}, we can use the signals with the largest received power on average.

The matrix 𝐏{\bf P} is only related to the Doppler frequency. Let us perform the SVD of 𝐏{\bf P}, i.e., 𝐏=𝐔P𝐄P𝐕PH{\bf P}={\bf U}_{\rm P}{\bf E}_{\rm P}{\bf V}_{\rm P}^{H}, where 𝐄P{\bf E}_{\rm P} is an L×LL\times L diagonal matrix, 𝐔P{\bf U}_{\rm P} is the left singular matrix, and 𝐕P{\bf V}_{\rm P} is the right singular matrix. Denoting the null-space of 𝐔P{\bf U}_{\rm P} as 𝐔¯P\bar{\bf U}_{\rm P}, we can then estimate the Doppler frequency via

PeakL(1𝐩0H(2πTAf)𝐔¯PF2),\displaystyle{\rm Peak}^{L}\left(\frac{1}{\left\|{\bf p}^{H}_{0}(2\pi T_{\rm A}f^{\prime})\bar{\bf U}_{\rm P}\right\|_{F}^{2}}\right), (21)

where PeakL(){\rm Peak}^{L}(\cdot) denotes the operation that takes LL estimates corresponding to the LL largest peak values of the function in the bracket, 𝐩0(2πTAf){\bf p}_{0}(2\pi T_{\rm A}f^{\prime}) has the same expression as (IV-A) with m=0m=0, and f,f(0,1TA),f^{\prime},f^{\prime}\in\left(0,\frac{1}{T_{\rm A}}\right), is a quantized Doppler frequency for testing, with the interval between adjacent ff^{\prime} being 1TA(P+1)\frac{1}{T_{\rm A}(P+1)}. Note that ff^{\prime} only needs to be tested from 0 to 1TA\frac{1}{T_{\rm A}} due to the mirror symmetry of the proposed basis vectors. Hence, the proposed mirrored-MUSIC algorithm can increase the estimation accuracy with the same quantization interval.

For 𝐐=𝐔Q𝐄Q𝐕QH{\bf Q}={\bf U}_{\rm Q}{\bf E}_{\rm Q}{\bf V}^{H}_{\rm Q}, denoting the null-space of 𝐔Q{\bf U}_{\rm Q} as 𝐔¯Q\bar{\bf U}_{\rm Q}, we can estimate the relative delay, in parallel with estimating the Doppler frequency, via

PeakL(1𝐪0H(2πτT)𝐔¯QF2),\displaystyle{\rm Peak}^{L}\left(\frac{1}{\left\|{\bf q}_{0}^{H}\left(\frac{2\pi\tau^{\prime}}{T}\right)\bar{\bf U}_{\rm Q}\right\|_{F}^{2}}\right), (22)

where 𝐪0(2πτT){\bf q}_{0}\left(\frac{2\pi\tau^{\prime}}{T}\right) has the same expression as (IV-A), and τ\tau^{\prime}, τ(0,T)\tau^{\prime}\in(0,T), is a quantized delay for testing, with the interval between adjacent τ\tau^{\prime} being T(Q+1)\frac{T}{(Q+1)}. Similar to ff^{\prime}, τ\tau^{\prime} only needs to be tested from 0 to TT due to the mirror symmetry.

To determine the number of targets, we can adopt existing algorithms such as the well-known minimum description length (MDL) method and the simplified one in [38], using the diagonal elements in the singular value matrix of both 𝐏{\bf P} and 𝐐{\bf Q}.

IV-B Pair Matching and Doppler Frequency’s Sign Determination

There are two problems yet to be solved, following the ’Peak’ function in (21) and (22). Firstly, the estimates of delays and Doppler frequencies are not automatically matched to one target. Hence, we need to make a pair for each estimate of delay with each estimate of Doppler frequency. Secondly, the sign of the estimate of Doppler frequency is yet to be determined since we only obtain the absolute values of Doppler frequency. The sign of delay does not need to be determined, since τ¯l=τlτ0\bar{\tau}_{l}=\tau_{l}-\tau_{0} is larger than zero by default. Note that the two derivative problems also exist and they are even more challenging when a conventional MUSIC algorithm is applied, because conventional MUSIC would obtain two values for one Doppler frequency and it needs to determine the correct value from two individual estimates. We now solve these two problems based on the CACC outputs.

From (9), we see that the term of AoA does not have mirror symmetry. All AoAs of ξn[m,g]\xi_{n}[m,g] equal Ω0\Omega_{0} when l>0l^{\prime}>0. Since Ω0\Omega_{0} is known to the sensing receiver (BS), we can utilize Ω0\Omega_{0} to address the above-mentioned two problems. Due to the undetermined sign of Doppler frequency and the unmatched delay and Doppler frequency, there are 2L22L^{2} candidates, i.e.,

(f^D,lx,τ^ly),lx{±1,,±L},ly{1,,L},\displaystyle({\hat{f}}_{{\rm D},l_{x}},\hat{\tau}_{l_{y}}),l_{x}\in\{\pm 1,\cdots,\pm L\},l_{y}\in\{1,\cdots,L\}, (23)

where f^D,lx{\hat{f}}_{{\rm D},l_{x}} and τ^ly\hat{\tau}_{l_{y}} are candidates to be paired. The value of τ^ly\hat{\tau}_{l_{y}}, which is larger than zero, is the estimate obtained from (22). The absolute value of f^D,lx{\hat{f}}_{{\rm D},l_{x}} is the estimate obtained from (21). Note that there are two opposite values for one Doppler frequency and only one of them matches the actual one. The actual one has the maximum combining gain in the following function that combines ξn[m,g]\xi_{n}[m,g], i.e.,

Pξ(lx,ly)\displaystyle P_{\xi}(l_{x},l_{y})
=\displaystyle= m=0M1g=0G1n=0N1ξn[m,g]ejm2πTAf^D,lxjg2πgT(τ^lyτ0)jnΩ0.\displaystyle\sum\limits_{m=0}^{M-1}\sum\limits_{g=0}^{G-1}\sum\limits_{n=0}^{N-1}\xi_{n}[m,g]e^{jm2\pi T_{\rm A}\hat{f}_{{\rm D},l_{x}}-jg\frac{2\pi g}{T}(\hat{\tau}_{l_{y}}-\tau_{0})-jn\Omega_{0}}. (24)

We can first select one out of 2L22L^{2} candidates that maximizes the absolute value of Pξ(lx,ly)P_{\xi}(l_{x},l_{y}). Supposing that the selected index of the obtained pair is (lx0,ly0)(l_{x_{0}},l_{y_{0}}), we remove both this pair and its mirrored index, (lx0,ly0)(-l_{x_{0}},l_{y_{0}}) from the set of candidates. Meanwhile, the sign of Doppler frequency for fD,lx0f_{{\rm D},l_{x_{0}}} is determined. After removing the pair of (±lx0,ly0)(\pm l_{x_{0}},l_{y_{0}}), the number of candidates is reduced to 2(L1)22(L-1)^{2}, i.e., lx{±1,,±L},lx{±lx0}l_{x}\in\{\pm 1,\cdots,\pm L\},l_{x}\notin\{\pm l_{x_{0}}\}, ly{1,,L},ly{ly0}l_{y}\in\{1,\cdots,L\},l_{y}\notin\{l_{y_{0}}\}. We then match the next pair of Doppler frequency and delay. Repeating the process LL times, we can match Doppler frequency with delay and obtain the sign of Doppler frequency simultaneously.

The whole process of estimating Doppler frequency and delay using the CACC outputs is summarized in Algorithm 1.

Algorithm 1 Proposed Mirrored-MUSIC Estimation Algorithm
1:  Input: ξn[m,g]\xi_{n}[m,g] and Ω0\Omega_{0}.
2:  Initialization: PP\in{\mathbb{N}} and QQ\in{\mathbb{N}} satisfy LP<MLL\leq P<M-L and LQ<GLL\leq Q<G-L. Candidates of quantized Doppler frequency and delay for testing are selected uniformly over (0,1TA)(0,\frac{1}{T_{\rm A}}) and (0,T)(0,T), respectively.
3:  Generate 𝐩n[m,g]{\bf p}_{n}[m,g] and 𝐪n[m,g]{\bf q}_{n}[m,g] according to (IV-A) and (IV-A).
4:  Assemble 𝐩n0[m,g0]{\bf p}_{n_{0}}[m,g_{0}] from m=0m=0 to m=(MP1)m=(M-P-1) into matrix 𝐏\bf P. Assemble 𝐪n0[m0,g]{\bf q}_{n_{0}}[m_{0},g] from g=0g=0 to g=(GQ1)g=(G-Q-1) into matrix 𝐐\bf Q.
5:  SVD: 𝐏=𝐔P𝐄P𝐕PH{\bf P}={\bf U}_{\rm P}{\bf E}_{\rm P}{\bf V}^{H}_{\rm P} and 𝐐=𝐔Q𝐄Q𝐕QH{\bf Q}={\bf U}_{\rm Q}{\bf E}_{\rm Q}{\bf V}^{H}_{\rm Q}.
6:  Denote the null-space of 𝐔P{\bf U}_{\rm P} and 𝐔Q{\bf U}_{\rm Q} as 𝐔¯P\bar{\bf U}_{\rm P} and 𝐔¯Q\bar{\bf U}_{\rm Q}, respectively.
7:  Estimate {fD,l}l=1L\{f_{{\rm D},l}\}_{l=1}^{L} and {τl}l=1L\{\tau_{l}\}_{l=1}^{L} via (21) and (22), respectively. The estimates are denoted as f^D,l\hat{f}_{{\rm D},l} and τl\tau_{l}.
8:  Generate 2L22L^{2} candidates for Doppler frequency and delay according to (23), and obtain 2L22L^{2} Pξ(lx,ly)P_{\xi}(l_{x},l_{y}) according to (IV-B).
9:  for X=L:1:1X=L:-1:1 do
10:     Select one out of 2X22X^{2} candidates with the maximal |Pξ(lx,ly)||P_{\xi}(l_{x},l_{y})|, with the selected index being iXi_{X}.
11:     Find lxl_{x} and lyl_{y} that correspond to iXi_{X}.
12:     Remove Pξ(lx,)P_{\xi}(l_{x},\cdot) and Pξ(,ly)P_{\xi}(\cdot,l_{y}).
13:  end for
14:  Output: f^D,l\hat{f}_{{\rm D},l} and τ^l\hat{\tau}_{l}.

IV-C Performance Analysis

Since the MUSIC-based estimators are non-linear approaches, we analyze the performance of the proposed mirrored-MUSIC using the perturbation methods as in [39, 40]. The mirrored-MUSIC is based on CACC, which makes the analysis more challenging than that in [39, 40]. Without losing generality, we analyze the performance for estimating Doppler frequency, and the performance for estimating delay can be similarly derived.

We rewrite the signal block, 𝐏{\bf P}, as 𝐏=𝐏s+𝚿{\bf P}={\bf P}_{\rm s}+{\bf\Psi}, where 𝐏s{\bf P}_{\rm s} is the signal block that is composed of the signals of interest, and 𝚿{\bf\Psi} is the perturbations of signal block resulted from the interference of the high-pass filter and the AWGN noise. Then, we can rewrite the signal null-space, 𝐔¯P\bar{\bf U}_{\rm P}, as 𝐔¯P=𝐔¯Ps+Δ𝐔¯Ψ\bar{\bf U}_{\rm P}=\bar{\bf U}_{{\rm P}_{\rm s}}+\Delta\bar{\bf U}_{\Psi}, where 𝐔¯Ps\bar{\bf U}_{{\rm P}_{\rm s}} is the null-space that corresponds to 𝐏s{\bf P}_{\rm s} and Δ𝐔¯Ψ\Delta\bar{\bf U}_{\Psi} is the related perturbations. The perturbations of the signal null-space can be approximately written as

Δ𝐔¯Ψ=𝐔P𝐄P1𝐕PH𝚿H𝐔¯Ps.\displaystyle\Delta\bar{\bf U}_{\Psi}=-{\bf U}_{\rm P}{\bf E}_{\rm P}^{-1}{\bf V}_{\rm P}^{H}{\bf\Psi}^{H}\bar{\bf U}_{{\rm P}_{\rm s}}. (25)

We define a null-spectrum function as F(f,𝐔¯P)=𝐩t(f)H𝐔¯P𝐔¯PH𝐩t(f)F(f,\bar{\bf U}_{\rm P})={\bf p}_{t}(f)^{H}\bar{\bf U}_{\rm P}\bar{\bf U}_{\rm P}^{H}{\bf p}_{t}(f), which is the denominator of the objective function in (21). It is noted that F(fD,l,𝐔¯Ps)=0F(f_{{\rm D},l},\bar{\bf U}_{{\rm P_{s}}})=0. When the interference and noise term are introduced, the objective function in (21) is equivalent to finding LL estimates of fD,lf_{{\rm D},l}, such that F(f^D,l,𝐔¯P)F(\hat{f}_{{\rm D},l},\bar{\bf U}_{\rm P}) approach to 0. The error between f^D,l\hat{f}_{{\rm D},l} and fD,lf_{{\rm D},l} is denoted as Δfl\Delta f_{l}, which determines the performance of the MUSIC algorithms. For notational simplicity, we drop the subscript ll. At a high SNR, Δf\Delta f can be obtained via the Newton method, i.e.,

Δf=\displaystyle\Delta f= F(f,𝐔¯P)f2F(f,𝐔¯P)2fF1(f,𝐔¯P)F2(f,𝐔¯P)F1(f,𝐔¯Ps)+ΔF1F2(f,𝐔¯Ps)+ΔF2\displaystyle{\frac{\partial F(f,\bar{\bf U}_{\rm P})}{\partial f}\over\frac{\partial^{2}F(f,\bar{\bf U}_{\rm P})}{\partial^{2}f}}\triangleq\frac{F_{1}(f,\bar{\bf U}_{\rm P})}{F_{2}(f,\bar{\bf U}_{\rm P})}\approx\frac{F_{1}(f,\bar{\bf U}_{\rm P_{s}})+\Delta F_{1}}{F_{2}(f,\bar{\bf U}_{\rm P_{s}})+\Delta F_{2}}
\displaystyle\approx ΔF1F2(f,𝐔¯Ps)=Re[𝐩0(f)HΔ𝐔¯Ψ𝐔¯PsH𝐩0(1)(f)]𝐩0(1)(f)H𝐔¯Ps𝐔¯PsH𝐩0(1)(f),\displaystyle\frac{\Delta F_{1}}{F_{2}(f,\bar{\bf U}_{\rm P_{s}})}={{{\rm Re}\left[{\bf p}_{0}(f)^{H}\Delta\bar{\bf U}_{\Psi}\bar{\bf U}_{\rm P_{s}}^{H}{\bf p}^{(1)}_{0}(f)\right]}\over{{{\bf p}^{(1)}_{0}}(f)^{H}\bar{\bf U}_{\rm P_{s}}\bar{\bf U}_{\rm P_{s}}^{H}{{\bf p}^{(1)}_{0}}(f)}}, (26)

where F1()F_{1}(\cdot) and F2()F_{2}(\cdot) denote the first- and second-order derivatives with respect to ff, ΔF1\Delta F_{1} denotes the error between F1(f,𝐔¯P)F_{1}(f,\bar{\bf U}_{\rm P}) and F1(f,𝐔¯Ps)F_{1}(f,\bar{\bf U}_{\rm P_{s}}), ΔF2\Delta F_{2} denotes the error between F2(f,𝐔¯Ps)F_{2}(f,\bar{\bf U}_{\rm P_{s}}) and F2(f,𝐔¯P)F_{2}(f,\bar{\bf U}_{\rm P}), and 𝐩0(1)(f){{\bf p}^{(1)}_{0}}(f) denotes the first order derivative of the basis vector with respect to ff. The derivation can be referred to [39]. Substituting (25) into (IV-C), we simplify the expression of Δf\Delta f as

Δf=Re[𝜷(f)H𝚿H𝜸(f)]𝐩0(1)(f)H𝜸(f),\displaystyle\Delta f=\frac{{\rm Re}\left[{\bm{\beta}}(f)^{H}{\bf\Psi}^{H}{\bm{\gamma}}(f)\right]}{{\bf p}_{0}^{(1)}(f)^{H}{\bm{\gamma}}(f)}, (27)

where 𝜷(f){\bm{\beta}}(f) and 𝜸(f){\bm{\gamma}}(f) are vectors given by 𝐕P𝐄P1𝐔PH𝐩0(f)-{\bf V}_{\rm P}{\bf E}_{\rm P}^{-1}{\bf U}^{H}_{\rm P}{\bf p}_{0}(f) and 𝐔¯Ps𝐔¯PsH𝐩0(1)(f)\bar{\bf U}_{\rm P_{s}}\bar{\bf U}_{\rm P_{s}}^{H}{{\bf p}^{(1)}_{0}}(f), respectively.

Intuitively, an effective way to reducing the error of Δf\Delta f is to suppress the variance of 𝚿{\bf\Psi}. When the entries of 𝚿{\bf\Psi} are independent Gaussian variables with zero mean and variance of σΨ2\sigma_{\Psi}^{2}, the variance of Δf\Delta f is given by 12𝜷(f)F2𝜸(f)F2σΨ2\frac{1}{2}\|{\bm{\beta}}(f)\|_{F}^{2}\|{\bm{\gamma}}(f)\|_{F}^{2}\sigma^{2}_{\Psi}. However, due to the CACC operation, the entries of 𝚿{\bf\Psi} are not independent Gaussian variables. In Appendix C, we analyze the variance of Ψ{\Psi} and obtain the following proposition.

Proposition 2.

The index of the optimal reference antenna used for forming the matrix of 𝐏{\bf P} and 𝐐\bf Q, n0n_{0}, is obtained by minimizing |l=0L|αl|2ejn0Ωl|2\left|\sum\limits_{l=0}^{L}|\alpha_{l}|^{2}e^{jn_{0}\Omega_{l}}\right|^{2}.

Proof.

See proof in Appendix C. ∎

Proposition 2 indicates that a fixed index of receiving antenna can help suppress the variance of 𝚿{\bf\Psi} when performing the MUSIC estimation algorithms, and hence improve the sensing performance. It is unnecessary to integrate all nn’s and gg’s to perform the SVD of 𝐏\bf P. We note that |l=0L|αl|2ejn0Ωl|2\left|\sum\limits_{l=0}^{L}|\alpha_{l}|^{2}e^{jn_{0}\Omega_{l}}\right|^{2} is equivalent to the low-pass component in the 2D-FFT of the CACC signals. One way to obtain the optimal n0n_{0} is to select the n0n_{0}th 2D-FFT of ξn[m,g]\xi_{n}[m,g], such that the low-pass component of the 2D-FFT of ξn[m,g]\xi_{n}[m,g] has the minimum among all nn’s. This proposition is as expected since only the high-pass components contain the information of interest.

TABLE I: Comparison of Computational Complexity
The proposed Algorithm 1
Operation Complexity
Conduct SVD of 𝐏{\bf P} 𝒪((P+1)2(MP))\mathcal{O}\big{(}(P+1)^{2}(M-P)\big{)}
Obtain the objective function in (21) 𝒪(FX(P+1)(MP))\mathcal{O}\big{(}F_{X}(P+1)(M-P)\big{)}
Overall 𝒪((P+1)2(MP))\mathcal{O}\big{(}(P+1)^{2}(M-P)\big{)}
Conventional MUSIC
Operation Complexity
Conduct SVD 𝒪((P+1)2(MP))\mathcal{O}\big{(}(P+1)^{2}(M-P)\big{)}
Obtain the objective function 𝒪(2FX(P+1)(MP))\mathcal{O}\big{(}2F_{X}(P+1)(M-P)\big{)}
Overall 𝒪(2FX(P+1)(MP))\mathcal{O}\big{(}2F_{X}(P+1)(M-P)\big{)}

IV-D Complexity Analysis

In this subsection, we analyze the computational complexity of Algorithm 1. Note that the delay and the Doppler frequency are estimated in parallel. Without losing generality, we only analyze the complexity of estimating Doppler frequency. One main computation in Algorithm 1 is the SVD of 𝐏{\bf P} with the dimension of (P+1)×(MP)(P+1)\times(M-P). Since we only need the left singular matrices of 𝐏{\bf P}, the complexities for obtaining 𝐔P{\bf U}_{\rm P} is 𝒪((P+1)2(MP))\mathcal{O}\big{(}(P+1)^{2}(M-P)\big{)}. Another main computation is obtaining the objective function in (21). Given FXF_{X} candidates of ff^{\prime}, obtaining the objective function in (21) has a complexity of (𝒪(FX(P+1)(MP))+𝒪(FX(MP)))𝒪(FX(P+1)(MP))\big{(}\mathcal{O}(F_{X}(P+1)(M-P))+\mathcal{O}(F_{X}(M-P))\big{)}\approx\mathcal{O}\big{(}F_{X}(P+1)(M-P)\big{)}. Other steps in Algorithm 1 have much lower complexity and can be omitted. Generally, the number of candidates, FXF_{X}, should be no greater than P+1P+1. Hence, the overall complexity for estimating Doppler frequency is 𝒪((P+1)2(MP))\mathcal{O}\big{(}(P+1)^{2}(M-P)\big{)}. Likewise, the complexity for estimating delay is 𝒪((Q+1)2(GQ))\mathcal{O}\big{(}(Q+1)^{2}(G-Q)\big{)}. The complexities of the main steps of Algorithm 1 are summarized in Table I and are compared with those of the conventional MUSIC method. From Table I, we note that the overall complexity of conventional MUSIC doubles our proposed mirrored-MUSIC, which is because conventional MUSIC requires a doubled number of candidates.

V High Resolution AoAs Estimation

In Algorithm 1, the NLOS AoAs are still unknown but necessary for locating the targets. When the number of spatial samples is large, AoAs can be estimated directly using one-shot measurements in the spatial domain, which can be done in parallel with estimating Doppler frequency and delay [41, 10]. When the number of antennas at the BS is small, such as the JCAS system setup in [9], the one-shot measurements are insufficient for achieving accurate AoA estimation. In this section, we propose a high-resolution AoA estimation algorithm by combining measurements from the spatial and other domains.

S. Chuang et al. proposed a high-resolution AoA estimation method by using both time-domain and spatial-domain measurements [29]. However, their method is only applicable to narrowband systems and there exists a problem in the broadband scenario that some AoAs estimates would be missing if multiple Doppler frequencies (or delays) are close to each other. We will analyze the reason for this problem and obtain more accurate AoA estimates using measurements from all three domains in time, frequency, and space.

Using measurements in the spatial domain can distinguish among NN AoAs only. We attempt to equivalently enlarge the length of the spatial array response vectors by integrating both the time-domain and the frequency-domain signals into the spatial domain. Since all other parameters except NLOS AoAs have been obtained from Algorithm 1, the integrated signal vector only varies with NLOS AoAs. Otherwise, without the results from Algorithm 1, all parameters are mixed together and can be difficult to be obtained simultaneously. In the following of this section, we assume that delays and Doppler frequencies are already obtained at the BS. Still using ξn[m,g]\xi_{n}[m,g], we generate a spatial signal vector as

𝐜[m,g]=\displaystyle{\bf c}[m,g]= [ξ1[m,g],,ξN1[m,g]]T\displaystyle[\xi_{1}[m,g],\cdots,\xi_{N-1}[m,g]]^{T}
=\displaystyle= l=L,l0LPl𝐚(Ωl)ejmf¯D,lejgτ¯l,\displaystyle\sum_{l^{\prime}=-L,l\neq 0}^{L}P_{l^{\prime}}{\bf a}(\Omega_{l^{\prime}})e^{jm\bar{f}_{{\rm D},l^{\prime}}}e^{-jg\bar{\tau}_{l^{\prime}}}, (28)

where 𝐚(Ωl)=exp[jΩl(1,,N1)]T{\bf a}(\Omega_{l^{\prime}})=\exp[j\Omega_{l^{\prime}}(1,\cdots,N-1)]^{T} is the (N1)×1(N-1)\times 1 array response vector. Note that the length of the array response vector is reduced to N1N-1 due to the CACC operation. We integrate the spatial domain with the other two domains to enlarge the dimension of array response vectors. This can be realized using the following proposed matrix, i.e.,

𝐂[m,g]\displaystyle{\bf C}^{\prime}[m,g] =[𝐜[m,g]𝐜[m,g]𝐜[m,g+1]𝐜[m+1,g]𝐜[m,g+C1]𝐜[m+C1,g]],\displaystyle=\left[\begin{array}[]{cc}{\bf c}[m,g]&{\bf c}[m,g]\\ {\bf c}[m,g+1]&{\bf c}[m+1,g]\\ \vdots&\vdots\\ {\bf c}[m,g+C-1]&{\bf c}[m+C-1,g]\\ \end{array}\right], (33)

where C,C,C,C\in{\mathbb{N}}, satisfies 4L/(N1)<C<min(G4L,M4L)4L/(N-1)<C<\min(G-4L,M-4L). The dimension of 𝐂[m,g]{\bf C}^{\prime}[m,g] is C(N1)×2C(N-1)\times 2. The first column of 𝐂[m,g]{\bf C}^{\prime}[m,g] is an enlarged vector corresponding to the spatial (angle) domain and the frequency (delay) domain. The second column is an enlarged vector corresponding to the spatial (angle) domain and the time (Doppler frequency) domain. In Appendix D, we show that the basis vector for the first column of 𝐂[m,g]{\bf C}^{\prime}[m,g] is given by

𝐜l1=[𝐚(Ωl)ej0τ¯l𝐚(Ωl)ej1τ¯l𝐚(Ωl)ej(C1)τ¯l].\displaystyle{\bf c}^{1}_{l^{\prime}}=\left[\begin{array}[]{c}{\bf a}(\Omega_{l^{\prime}})e^{-j0\bar{\tau}_{l^{\prime}}}\\ {\bf a}(\Omega_{l^{\prime}})e^{-j1\bar{\tau}_{l^{\prime}}}\\ \vdots\\ {\bf a}(\Omega_{l^{\prime}})e^{-j(C-1)\bar{\tau}_{l^{\prime}}}\\ \end{array}\right]. (38)

Likewise, the basis vector for the second column of 𝐂[m,g]{\bf C}^{\prime}[m,g], denoted as 𝐜l2{\bf c}^{2}_{l^{\prime}}, has the same expression as (38) with replacing τ¯l\bar{\tau}_{l^{\prime}} by f¯D,l\bar{f}_{{\rm D},l^{\prime}}.

It is noted that the AoA parameter in (33) is mixed with other known parameters. The other two parameters, i.e., delay and Doppler frequency, are estimated and already available. These parameters are used to enlarge the dimension of the basis vector. We stack 𝐂[m,g]{\bf C}^{\prime}[m,g] with different mm and gg into a bigger matrix,

𝐂=[𝐂[0,0],𝐂[1,1],,𝐂[C1,C1]],\displaystyle{\bf C}=[{\bf C}^{\prime}[0,0],{\bf C}^{\prime}[1,1],\cdots,{\bf C}^{\prime}[C_{1},C_{1}]], (39)

where C1,C1,C_{1},C_{1}\in\mathbb{N}, satisfies C+C1<min(M,G).C+C_{1}<\min(M,G). The basis vectors of columns of 𝐂\bf C are given by 𝐜l1{\bf c}_{l^{\prime}}^{1} and 𝐜l2{\bf c}_{l^{\prime}}^{2}, with l{±1,,±L}l^{\prime}\in\{\pm 1,\cdots,\pm L\}. Hence, the rank of 𝐂{\bf C} is 4L4L. It is worth noting that those 4L4L basis vectors only correspond to (L+1)(L+1) AoAs, i.e., one LOS AoA and LL NLOS AoAs. The 2L2L basis vectors with l>0{l^{\prime}}>0 all correspond to Ω0\Omega_{0}, which is already known at the BS. For the other 2L2L basis vectors with l<0l^{\prime}<0, both 𝐜l1{\bf c}_{l^{\prime}}^{1} and 𝐜l2{\bf c}_{l^{\prime}}^{2} correspond to one AoA. Hence, it is not necessary to test the basis vectors with l>0{l^{\prime}}>0.

The AoAs can be obtained by performing the SVD of 𝐂{\bf C}. In general, one pair of basis vectors, 𝐜l1{\bf c}_{l^{\prime}}^{1} and 𝐜l2{\bf c}_{l^{\prime}}^{2}, corresponds to one AoA. By using the total 2L2L basis vectors, l{1,,L},l^{\prime}\in\{1,\cdots,L\}, we can obtain LL AoAs corresponding to LL NLOS targets. However, we notice an issue here: when the values of delays and Doppler frequencies of different targets are close to each other, respectively, different basis vectors with similar delays and Doppler frequencies can be responded to multiple different AoAs. This would directly cause that some estimates of Ωl\Omega_{l} with a lower gain will be missing from the estimated outputs. We call this issue as the “ambiguity of basis vectors”. The method in [29] is proposed in the narrowband scenario and did not address the ambiguity of basis vectors.

Let us denote the SVD of 𝐂{\bf C} as 𝐂=𝐔C𝐄C𝐕CH{\bf C}={\bf U}_{\rm C}{\bf E}_{\rm C}{\bf V}^{H}_{\rm C}, where 𝐄C{\bf E}_{\rm C} is an 4L×4L4L\times 4L diagonal matrix with the 4L4L largest entries, 𝐔C{\bf U}_{\rm C} is the left singular matrix of 𝐂{\bf C}, and 𝐕C{\bf V}_{\rm C} is the right singular matrix of 𝐂{\bf C}. We choose multiple peaks to address the ambiguity of basis vectors, i.e.,

PeakXl(1[𝐜t1(Ω,l),𝐜t2(Ω,l)]H𝐔¯CF2),l<0,\displaystyle{\rm Peak}^{X_{l^{\prime}}}\left(\frac{1}{\|\left[{\bf c}_{t}^{1}(\Omega^{\prime},l^{\prime}),{\bf c}_{t}^{2}(\Omega^{\prime},l^{\prime})\right]^{H}\bar{\bf U}_{\rm C}\|_{F}^{2}}\right),l^{\prime}<0, (40)

where 𝐔¯C\bar{\bf U}_{\rm C} is the null-space of 𝐔C{\bf U}_{\rm C}, XlX_{l^{\prime}} is the number of peaks in the objective function, and 𝐜t1(Ω,l){\bf c}_{t}^{1}(\Omega^{\prime},l^{\prime}) and 𝐜t2(Ω,l){\bf c}^{2}_{t}(\Omega^{\prime},l^{\prime}) are the testing basis vectors that have the same expressions as 𝐜l1{\bf c}^{1}_{l^{\prime}} and 𝐜l2{\bf c}^{2}_{l^{\prime}}, respectively, after replacing Ωl\Omega_{l^{\prime}} by a testing AoA candidate, Ω{\Omega^{\prime}}. The number of peaks is determined by how many peaks that are larger than the half of the maximal objective function. Note that the equivalent spatial dimension is extended to C(N1)C(N-1), hence the maximum detectable number of AoAs is C(N1)C(N-1). If Xl>1X_{l^{\prime}}>1, we need to retain one AoA and discard the rest. The determined AoAs with Xl=1X_{l^{\prime}}=1 form a set of {ΩS}\{\Omega_{S}\}. Supposing that the undetermined AoAs with Xl>1X_{l^{\prime}}>1 are Ω^1,,Ω^Xl\hat{\Omega}_{1},\cdots,\hat{\Omega}_{X_{l^{\prime}}}, we select the one with the highest value of (40), dented as Ω^1\hat{\Omega}_{1}, if |Ω^1ΩS|>2πC(N1)|\hat{\Omega}_{1}-\Omega_{S}|>\frac{2\pi}{C(N-1)}. Otherwise, we select the one with a second highest value.

Algorithm 2 Proposed High Resolution AoA Estimation
1:  Input: τ¯^l\hat{\bar{\tau}}_{l} and ξn[m,g]\xi_{n}[m,g].
2:  Initialization: CC\in{\mathbb{N}} satisfies 4L/(N1)<C<min(G4L,M4L)4L/(N-1)<C<\min(G-4L,M-4L). C1C_{1}\in\mathbb{N} satisfies C+C1<min(M,G).C+C_{1}<\min(M,G). The AoA candidate is Ω\Omega^{\prime} that goes through the entire range of (π,π)(-\pi,\pi).
3:  Generate 𝐜[m,g]{\bf c}[m,g] according to (V).
4:  Generate 𝐂[m,g]{\bf C}^{\prime}[m,g] according to (33).
5:  Generate 𝐂{\bf C} according to (39).
6:  SVD: 𝐂=𝐔C𝐄C𝐕CH{\bf C}={\bf U}_{\rm C}{\bf E}_{\rm C}{\bf V}^{H}_{\rm C}, where the dimension of 𝐄C{\bf E}_{\rm C} is 4L×4L4L\times 4L.
7:  Denote the null-space of 𝐔C{\bf U}_{\rm C} as 𝐔¯C\bar{\bf U}_{\rm C}.
8:  Estimate {Ωl}l=1L\{\Omega_{l}\}_{l=1}^{L} according to (40).
9:  Output: Ω^l\hat{\Omega}_{l}.

Since Algorithm 2 is also based on MUSIC algorithms, the analysis in Section IV-C can be applied to obtaining the theoretical error of AoA estimates. Similar to (27), letting 𝐂=𝐂s+𝚿{\bf C}={\bf C}_{s}+{\bf\Psi}^{\prime} and 𝐔¯C=𝐔¯Cs+Δ𝐔Ψ\bar{\bf U}_{\rm C}=\bar{\bf U}_{\rm C_{s}}+{\Delta\bf U}_{\rm\Psi^{\prime}}, we can obtain the error of AoA estimates error as

ΔΩ=Re[𝜷(Ω)H𝚿H𝜸(Ω)]𝐜t(1)(Ω,l)H𝜸(Ω),\displaystyle\Delta\Omega=\frac{{\rm Re}\left[{\bm{\beta}}^{\prime}(\Omega)^{H}{\bf\Psi}^{\prime H}{\bm{\gamma}}^{\prime}(\Omega)\right]}{{\bf c}_{t}^{(1)}(\Omega,l^{\prime})^{H}{\bm{\gamma}}^{\prime}(\Omega)}, (41)

where 𝐜t(Ω,l)=[𝐜t1(Ω,l),𝐜t2(Ω,l)]{\bf c}_{t}(\Omega,l^{\prime})=[{\bf c}_{t}^{1}(\Omega,l^{\prime}),{\bf c}^{2}_{t}(\Omega,l^{\prime})], 𝐜t(1)(Ω,l){\bf c}_{t}^{(1)}(\Omega,l^{\prime}) is the first order derivative of 𝐜t(Ω,l){\bf c}_{t}(\Omega,l^{\prime}) with respect to Ω\Omega, 𝜷(Ω){\bm{\beta}}^{\prime}(\Omega) and 𝜸(Ω){\bm{\gamma}}^{\prime}(\Omega) are vectors that are written as 𝐕C𝐄C1𝐔CH𝐜t(Ω,l)-{\bf V}_{\rm C}{\bf E}_{\rm C}^{-1}{\bf U}^{H}_{\rm C}{\bf c}_{t}(\Omega,l^{\prime}) and 𝐔¯Cs𝐔¯CsH𝐜t(1)(Ω,l)\bar{\bf U}_{\rm C_{s}}\bar{\bf U}_{\rm C_{s}}^{H}{{\bf c}^{(1)}_{t}}(\Omega,l^{\prime}), respectively.

Now, we analyze the computational complexity of Algorithm 2. One main computation in Algorithm 2 is the SVD of 𝐂{\bf C} with the dimension of C(N1)×2C1C(N-1)\times 2C_{1}. Since we only need the left singular matrix of 𝐂{\bf C}, the complexity for obtaining 𝐔C{\bf U}_{\rm C} is 𝒪(2C2(N1)2C1)\mathcal{O}\big{(}2C^{2}(N-1)^{2}C_{1}\big{)}. Another main computation is involved in obtaining the objective function in (32). Given CXC_{X} candidates of Ω\Omega^{\prime}, obtaining the objective function has a complexity of (𝒪(CXC(N1)2C1)+𝒪(2CXC1))𝒪(2CXC(N1)C1)\big{(}\mathcal{O}(C_{X}C(N-1)2C_{1})+\mathcal{O}(2C_{X}C_{1})\big{)}\approx\mathcal{O}\big{(}2C_{X}C(N-1)C_{1}\big{)}. Other steps in Algorithm 2 have much lower complexity and can be omitted. Generally, the number of candidates should be no greater than C(N1)C(N-1). Hence, the overall complexity for estimating Doppler frequency is 𝒪(2C2(N1)2C1)\mathcal{O}\big{(}2C^{2}(N-1)^{2}C_{1}\big{)}.

VI Simulation Results

In this section, we provide simulation results to validate the proposed scheme. The carrier frequency is 33 GHz. The number of subcarriers is G=256G=256. The frequency bandwidth is 128128 MHz. Hence, the OFDM symbol period TT is 22 uus. The propagation delay is randomly distributed over [0,0.4][0,0.4] uus. The length of CP is D=50D=50 to avoid inter-symbol interference (ISI) and the CP period TCT_{\rm C} is about 0.40.4 uus. The approximate interval between two packets, TAT_{\rm A}, is 1 ms. We use the preamble in M=128M=128 packets for sensing parameter estimation. The velocities of targets range from -30 mps to 30 mps, and the Doppler frequency is randomly distributed over [0.3,0.3][-0.3,0.3] KHz. The AoAs of targets are random values uniformly distributed from 0 to π\pi. All the targets are modeled as point sources, and the radar cross-sections are assumed to be 1. The BS employs a ULA with N=4N=4 antenna elements. Unless stating otherwise, we assume that there is one LOS path and L=3L=3 NLOS paths that are reflected or refracted from 3 targets. The power of the LOS path is assumed to be 1010 dB higher than those of the NLOS paths.

Refer to caption
Figure 3: An example of the 2D spectrum of ρn[m,g]\rho_{n}[m,g].
Refer to caption
Figure 4: MSE of ξn[m,g]\xi_{n}[m,g] versus SNR and number of paths.
Refer to caption
Figure 5: NMSE of the estimates for the actual delays versus SNR.
Refer to caption
Figure 6: NMSE of the estimates for the actual delays versus QQ. The SNR is fixed at 2020 dB.

Fig. 3 illustrates an example of the spectrum of the cross-correlated signals ρ1[m,g]\rho_{1}[m,g] by performing the 2D-FFT over mm and gg. The x-axis of the plot denotes the Doppler frequency, f¯D,l\bar{f}_{{\rm D},l}, and the y-axis denotes the relative delay, τ¯l\bar{\tau}_{l}. In order to see the targets clearly, we truncate the absolute value of the spectrum by half. At the origin of the spectrum plot, we see that there is a rectangular spot with the highest brightness. This spot denotes the low-pass component of ρn[m,g]\rho_{n}[m,g] which does not contain targets’ information of interest. Above the origin, there are three blue spots. We also see that there are three spots at the bottom of the figure, which denote the side products caused by cross-correlation. The side products also contain the parameters of targets with the opposite signs. This figure verifies the low-pass and the mirrored high-pass components of the CACC outputs as we described in Section III. It clearly shows that a high-pass filter can be applied to remove the non-desired low-pass component.

Fig. 4 presents the MSE of ξn[m,g]\xi_{n}[m,g], defined as |ξ^n[m,g]ξn[m,g]|2|\hat{\xi}_{n}[m,g]-\xi_{n}[m,g]|^{2}. The MSE of ξn[m,g]\xi_{n}[m,g] reflects the accuracy of the constructed high-pass signals and directly impacts the following sensing parameter estimation. Two methods are tested to filter out the low-pass component. One is a Butterworth filter with the cut-off frequency of (ωτ,ωf)=(π128,π128)(\omega_{\tau},\omega_{f})=(\frac{\pi}{128},\frac{\pi}{128}). The other one is via removing the component of the LOS path, i.e., ρn(1)\rho_{n}^{(1)}, over a short period from itself. It is clear that the Butterworth filter outperforms the method of removing the LOS path for either L=1L=1 or L=3L=3. It is worth pointing out that the MSE of the Buttworth filter drops linearly with the SNR increasing for L=1L=1 target. This indicates that the input error of ξn[m,g]\xi_{n}[m,g] can be sufficiently small when there is only one target. This is because, when L=1L=1, ρn(2)[m,g]\rho_{n}^{(2)}[m,g] is also a low-pass component, and when there are multiple targets, the MSE approaches to a fixed level that is the mean power of ρn(2)[m,g]\rho_{n}^{(2)}[m,g].

Next, we present the estimation performance for sensing parameters. Since the Doppler frequencies are obtained by the same algorithm as delays, we mainly present the simulation results for delays and AoAs next.

Fig. 5 illustrates the normalized MSE (NMSE) for the estimates of the actual propagation delays, i.e., |τ^lτl|2/T2|\hat{\tau}_{l}-\tau_{l}|^{2}/T^{2}. The benchmark algorithms for comparison include the AMS method in [26] and conventional MUSIC. The system setup is the same as that in Fig. 3. For our proposed Algorithm 1, the parameter QQ, which defines the length of the mirrored vector in (IV-A), is set to 128128. We see that our proposed algorithm outperforms the other two methods significantly. The AMS algorithm shows a large NMSE, possibly due to its inefficiency in dealing with multiple paths. Our proposed algorithm achieves lower NMSE than the conventional MUSIC because it removes the mirrored side products and reduces the rank of the signal space. An error floor can be observed for both our proposed Algorithm 1 and the conventional MUSIC. This is caused by the error of ξn[m,g]\xi_{n}[m,g], which cannot be removed by increasing SNR. We also plot the theoretical NMSE of the proposed mirrored-MUSIC. The NMSE of the proposed Algorithm 1 matches the theoretical NMSE tightly. Our proposed algorithm can achieve better performance by using larger bandwidth since the bandwidth has a significant impact on sensing performance and mainly influences the time resolution. With the used bandwidth increasing, the time duration of each symbol is reduced and the time resolution is improved.

Fig. 6 shows how the NMSE of delay estimates varies with LL. The system setups are the same as those in Fig. 3, except that the SNR is fixed at 2020 dB. The number of targets, LL, is chosen from 11 to 1010. We compare our proposed mirrored-MUSIC with the conventional MUSIC and the AMS method. It is noted that, when LL is 1, the NMSEs for all these methods are nearly the same. When LL ranges from 33 to 1010, our proposed mirrored-MUSIC can achieve much lower NMSE than the other two methods. The NMSE increases with the number of targets while the growth rate drops, because the delays of multiple targets become closer to each other and can be separated into several groups.

Refer to caption
Figure 7: ROC versus SNR and the number of targets. Each mark on one curve is for one SNR value from -10 dB (left) to 20 dB (right), at a step of 5 dB.
Refer to caption
Figure 8: RMSE of the AoA estimates versus SNR.

Fig. 7 presents the receiver operating characteristic (ROC) of the proposed Algorithm 1 after matching the estimates for delays and Doppler frequencies. The x-axis measures the detection probability and the y-axis measures the false-alarm rate. We use a common threshold of NMSE, 10310^{-3}, to detect whether the estimated values are effective ones. If the NMSE is smaller than 10310^{-3}, the estimated values are seen as effective values, and the targets are regarded as detected. We increase the SNR from 10-10 dB to 2020 dB, at an interval of 5 dB, to observe the variance of the ROC. According to the figure, the detection probability rises with the SNR increasing and approaches to one, while the false-alarm rate shows an opposite trend and approaches to zero. With the number of targets, LL, increasing, the detection probability drops and the false-alarm rate grows, which indicates that the performance declines. We can also see that the sum of detection probability and the false-alarm rate is less than 1, which is because one target may have more than one estimate.

Fig. 8 shows the RMSE of the AoA estimation versus SNR. Our proposed Algorithm 2 is compared with the H-MUSIC method and the H-ESPRIT method from [29]. The system setup is the same as that in Fig. 3. Noting that the H-MUSIC and the H-ESPRIT are based on hybrid arrays, we simplified their methods by letting each hybrid array has one receiving antenna, which is equivalent to a fully-digital array. For the initialization of Algorithm 2, we let C=128C=128 and C1=10C_{1}=10, and use the estimated delays obtained from Algorithm 1. Our algorithm outperforms H-MUSIC and H-ESPRIT, since our proposed Algorithm 2 can better address the ambiguity of basis vectors as we discussed in the section V. We see that the RMSE of AoAs drops slighly with SNR increasing from 1515 dB to 3030 dB, and the simulated RMSE matches well with the theoretical values. To further decrease the RMSE, we can increase the bandwidth to increase the accuracy of all estimates.

VII Conclusion

We have proposed an uplink sensing scheme for JCAS PWNs, which can achieve high-accuracy sensing parameter estimation with asynchronous transceivers and a small number of receiving antennas. We extend the CACC methods to mitigate the timing and frequency ambiguity. We then propose a mirrored-MUSIC algorithm to efficiently handle the CACC outputs with equivalently doubled unknown sensing parameters, at a complexity lower than that of the conventional MUSIC algorithm. Simulation results demonstrate that our proposed mirrored-MUSIC can effectively estimate the actual values of delay and Doppler frequency. Using the estimates of delay and Doppler frequency, we then obtain high-resolution AoAs estimates with a small number of receiving antennas. This is achieved via an improved MUSIC algorithm that combines measurements from spatial, temporal, and frequency domains. Our scheme enables radar sensing to be effectively implemented in mobile networks using the uplink channel and requires little modifications on infrastructure or advanced hardware, such as a full-duplex transceiver. The results show that the proposed scheme of uplink parameter estimation outperforms the state of the arts and can accurately detect multiple targets for the JCAS PWNs.

Our proposed mirrored-MUSIC algorithm can be applied to other problems with mirrored signals, such as the general harmonic retrieval problem with sinusoidal modulations. Its basic idea can also be extended to other spectral analysis techniques such as ESPRIT and the matrix pencil method. The proposed high-resolution AoA estimation can also be applied to other problems involving a similar combination of multi-domain measurements.

Appendix A Proof of Theorem 1

We write ρn(1)[m,g]\rho_{n}^{(1)}[m,g] as

ρn(1)\displaystyle\rho_{n}^{(1)} =Dn[m,g]D0H[m,g]=|α0|2ejnΩ0.\displaystyle=D_{n}[m,g]D_{0}^{H}[m,g]=|\alpha_{0}|^{2}e^{jn\Omega_{0}}. (42)

It is noted that ρn(1)\rho_{n}^{(1)} is invariant with mm and gg.

We express the sum of ρn(3)[m,g]\rho^{(3)}_{n}[m,g] and ρn(4)[m,g]\rho^{(4)}_{n}[m,g] as

ρn(3)[m,g]+ρn(4)[m,g]\displaystyle\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g]
=\displaystyle= l=1Lα0αlHej2πmTA(fD,l)ej2πgT(τ0τl)ejnΩ0+\displaystyle\sum\limits_{l=1}^{L}\alpha_{0}\alpha_{l}^{H}e^{j2\pi mT_{\rm A}(-f_{{\rm D},l})}e^{-j\frac{2\pi g}{T}(\tau_{0}-\tau_{l})}e^{jn\Omega_{0}}+
l=1Lαlα0Hej2πmTAfD,lej2πgT(τlτ0)ejnΩl.\displaystyle\sum\limits_{l=1}^{L}\alpha_{l}\alpha_{0}^{H}e^{j2\pi mT_{\rm A}f_{{\rm D},l}}e^{-j\frac{2\pi g}{T}(\tau_{l}-\tau_{0})}e^{jn\Omega_{l}}. (43)

The 2D-FFT of ρn(3)[m,g]+ρn(4)[m,g]\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g] is given by

FFT(ρn(3)[m,g]+ρn(4)[m,g])\displaystyle{\rm FFT}\left(\rho_{n}^{(3)}[m,g]+\rho_{n}^{(4)}[m,g]\right)
=\displaystyle= α0αlHejnΩ0sin(MTAfD,l+m)πsin(TAfD,l+mM)πsin(Gτ0τlT+g)πsin(τ0τlT+gG)π+\displaystyle\alpha_{0}\alpha_{l}^{H}e^{jn\Omega_{0}}\frac{\sin\left(MT_{\rm A}f_{{\rm D},l}+m^{\prime}\right)\pi}{\sin\left(T_{\rm A}f_{{\rm D},l}+\frac{m^{\prime}}{M}\right)\pi}\frac{\sin\left(G\frac{\tau_{0}-\tau_{l}}{T}+g^{\prime}\right)\pi}{\sin\left(\frac{\tau_{0}-\tau_{l}}{T}+\frac{g^{\prime}}{G}\right)\pi}+
αlα0HejnΩlsin(MTAfD,lm)πsin(TAfD,lmM)πsin(Gτ0τlTg)πsin(τ0τlTgG)π,\displaystyle\alpha_{l}\alpha_{0}^{H}e^{jn\Omega_{l}}\frac{\sin\left(MT_{\rm A}f_{{\rm D},l}-m^{\prime}\right)\pi}{\sin\left(T_{\rm A}f_{{\rm D},l}-\frac{m^{\prime}}{M}\right)\pi}\frac{\sin\left(G\frac{\tau_{0}-\tau_{l}}{T}-g^{\prime}\right)\pi}{\sin\left(\frac{\tau_{0}-\tau_{l}}{T}-\frac{g^{\prime}}{G}\right)\pi}, (44)

and has an impulsive shape with the peak points at

(ωf,ωτ)=±(πTAfD,l,π(τ0τl)/T).\displaystyle(\omega_{f},\omega_{\tau})=\pm(\pi T_{\rm A}f_{{\rm D},l},\pi(\tau_{0}-\tau_{l})/T). (45)

Note that mm^{\prime} and gg^{\prime} are integers, while ωf\omega_{f} and ωτ\omega_{\tau} are continuous values ranging from π-\pi to π\pi.

As for ρn(2)[m,g]\rho_{n}^{(2)}[m,g], it is written as

ρn(2)[m,g]\displaystyle\rho_{n}^{(2)}[m,g]
=\displaystyle= In[m,g]I0H[m,g]\displaystyle I_{n}[m,g]I_{0}^{H}[m,g]
=\displaystyle= (l=1LαlejnΩlej2πmTA(fD,l+δf(m))ej2πgT(τl+δτ(m)))×\displaystyle\big{(}\sum\limits_{l=1}^{L}\alpha_{l}e^{jn\Omega_{l}}e^{j2\pi mT_{\rm A}(f_{{\rm D},l}+\delta_{f}(m))}e^{-j\frac{2\pi g}{T}(\tau_{l}+\delta_{\tau}(m))}\big{)}\times
(l=1LαlHej0Ωlej2πmTA(fD,l+δf(m))ej2πgT(τl+δτ(m)))\displaystyle\big{(}\sum\limits_{l=1}^{L}\alpha^{H}_{l}e^{-j0\Omega_{l}}e^{-j2\pi mT_{\rm A}(f_{{\rm D},l}+\delta_{f}(m))}e^{j\frac{2\pi g}{T}(\tau_{l}+\delta_{\tau}(m))}\big{)}
=\displaystyle= l=1L|αl|2ejnΩl+l=1LxlLαlαxHejnΩlej2πmTAfl,xej2πgTτl,x\displaystyle\sum\limits_{l=1}^{L}|\alpha_{l}|^{2}e^{jn\Omega_{l}}+\sum\limits_{l=1}^{L}\sum\limits_{x\neq l}^{L}\alpha_{l}\alpha_{x}^{H}e^{jn\Omega_{l}}e^{j2\pi mT_{\rm A}f_{l,x}}e^{-j\frac{2\pi g}{T}\tau_{l,x}}
\displaystyle\triangleq ρ¯(2)+ρ~(2)[m,g],\displaystyle\bar{\rho}^{(2)}+\tilde{\rho}^{(2)}[m,g], (46)

where fl,x=fD,lfD,xf_{l,x}=f_{{\rm D},l}-f_{{\rm D},x} and τl,x=τlτx\tau_{l,x}=\tau_{l}-\tau_{x}. It is noted that ρ¯(2)\bar{\rho}^{(2)} is an invariant component and ρ~(2)[m,g]\tilde{\rho}^{(2)}[m,g] is a variant component. The 2D-FFT of ρ~(2)[m,g]\tilde{\rho}^{(2)}[m,g] also has an impulsive shape, but the power of ρ~(2)[m,g]\tilde{\rho}^{(2)}[m,g] is significantly lower than other components and can be neglected.

Appendix B The Error of ξn[m,g]\xi_{n}[m,g]

The components of ρn(1)\rho_{n}^{(1)} and ρ¯n(2)\bar{\rho}_{n}^{(2)} are invariant with mm and gg and can be largely suppressed after high-pass filtering. Without the noise term, the error of ξn[m,g]\xi_{n}[m,g] is mainly caused by the variant part of ρ~n(2)[m,g]\tilde{\rho}_{n}^{(2)}[m,g]. Hence, we can define the statistical mean error of ξn[m,g]\xi_{n}[m,g] as

δξ=var(ρ~n(2)[m,g]).\displaystyle{\delta}_{\xi}={\rm var}(\tilde{\rho}_{n}^{(2)}[m,g]). (47)

As for the AMS method, it assumes that |α0||αl||\alpha_{0}|\gg|\alpha_{l}| and estimates Dn[m,g]D_{n}[m,g] as the mean value of yn[m,g]y_{n}[m,g], which is denoted as D^n[m,g]\hat{D}_{n}[m,g]. Then, the AMS method obtains two signals. One is An[m,g]=yn[m,g]D^n[m,g]=I^n[m,g]A_{n}[m,g]=y_{n}[m,g]-\hat{D}_{n}[m,g]=\hat{I}_{n}[m,g] and the other one is Bn[m,g]=yn[m,g]+D^n[m,g]2D^n[m,g]+I^n[m,g]B_{n}[m,g]=y_{n}[m,g]+\hat{D}_{n}[m,g]\approx 2\hat{D}_{n}[m,g]+\hat{I}_{n}[m,g]. The cross correlated signal of the AMS method is expressed as

ξnAMS[m,g]\displaystyle\xi_{n}^{\rm AMS}[m,g] =An[m,g]B0H[m,g]\displaystyle=A_{n}[m,g]B_{0}^{H}[m,g]
In[m,g](2D0[m,g]+I0[m,g])\displaystyle\approx I_{n}[m,g](2D_{0}[m,g]+I_{0}[m,g])
2ρn(4)[m,g]+ρn(2)[m,g].\displaystyle\approx 2\rho_{n}^{(4)}[m,g]+\rho^{(2)}_{n}[m,g]. (48)

The AMS method uses 2ρn(4)[m,g]2\rho_{n}^{(4)}[m,g] as output to conduct parameter estimation. The error in the AMS method is up to ρn(2)[m,g]\rho^{(2)}_{n}[m,g], which is larger than the ξn[m,g]\xi_{n}[m,g] used in our method without by-product suppression. More importantly, Dn[m,g]D_{n}[m,g] and In[m,g]I_{n}[m,g] in the AMS method are approximated values, which would result in extra errors. Therefore, the AMS method causes larger ξn[m,g]\xi_{n}[m,g] errors than our method in (III).

Appendix C The Variance of 𝚿\bf\Psi

The dimension of 𝚿{\bf\Psi} is (P+1)×(MP)(P+1)\times(M-P). The expectation of entries of 𝚿\bf\Psi can be approximately as

𝔼[𝚿]pi,mj\displaystyle{\mathbb{E}}[{\bf\Psi}]_{p_{i},m_{j}}
=\displaystyle= 𝔼[ρn0[mj+pi,g0]+ρn0[mj+Ppi,g0]2ρ¯n0\displaystyle{\mathbb{E}}\big{[}\rho_{n_{0}}[m_{j}+p_{i},g_{0}]+\rho_{n_{0}}[m_{j}+P-p_{i},g_{0}]-2\bar{\rho}_{n_{0}}
ρn0(3)[mj+pi,g0]ρn0(4)[mj+pi,g0]\displaystyle-\rho^{(3)}_{n_{0}}[m_{j}+p_{i},g_{0}]-\rho^{(4)}_{n_{0}}[m_{j}+p_{i},g_{0}]
ρn0(3)[mj+Ppi,g0]ρn0(4)[mj+Ppi,g0]]\displaystyle-\rho^{(3)}_{n_{0}}[m_{j}+P-p_{i},g_{0}]-\rho^{(4)}_{n_{0}}[m_{j}+P-p_{i},g_{0}]\big{]}
\displaystyle\approx 2𝔼[ρ~n0(2)[m,g0]]+2𝔼[Dn0[m,g0]+In0[m,g0]]𝔼[zn0[m,g0]]\displaystyle 2{\mathbb{E}}\left[\tilde{\rho}_{n_{0}}^{(2)}[m,g_{0}]\right]+2{\mathbb{E}}\left[D_{n_{0}}[m,g_{0}]+I_{n_{0}}[m,g_{0}]\right]{\mathbb{E}}[z_{n_{0}}[m,g_{0}]]
=\displaystyle= 2𝔼[ρ~n0(2)[m,g0]]+2𝔼[ρn(1)+ρ¯n(2)]𝔼[zn0[m,g0]]\displaystyle 2{\mathbb{E}}\left[\tilde{\rho}_{n_{0}}^{(2)}[m,g_{0}]\right]+2{\mathbb{E}}\left[\rho_{n}^{(1)}+\bar{\rho}_{n}^{(2)}\right]{\mathbb{E}}[z_{n_{0}}[m,g_{0}]]
=\displaystyle= 2𝔼[ρ~n0(2)[m,g0]]+2l=0L|αl|2ejn0Ωl𝔼[zn0[m,g0]],\displaystyle 2{\mathbb{E}}\left[\tilde{\rho}_{n_{0}}^{(2)}[m,g_{0}]\right]+2\sum\limits_{l=0}^{L}|\alpha_{l}|^{2}e^{jn_{0}\Omega_{l}}{\mathbb{E}}[z_{n_{0}}[m,g_{0}]], (49)

where the definition of ρ~n(2)[m,g]\tilde{\rho}_{n}^{(2)}[m,g] and ρ¯n(2)\bar{\rho}_{n}^{(2)} can be referred to Appendix A. The first term in the end of (C), 2𝔼[ρ~n0(2)[m,g0]]2{\mathbb{E}}\left[\tilde{\rho}_{n_{0}}^{(2)}[m,g_{0}]\right], is the interference with variance of δξ\delta_{\xi} after conducting the high-pass filter, and the second term in (C) denotes the noise term after CACC. Hence, the variance of each entry of 𝚿{\bf\Psi} is

var([𝚿]pi,mj)\displaystyle{\rm var}\big{(}[{\bf\Psi}]_{p_{i},m_{j}}\big{)}
=\displaystyle= var[2ρ~n0(2)[m,g0]]+var[2l=0L|αl|2ejn0Ωlzn0[m,g0]]\displaystyle{\rm var}\left[2\tilde{\rho}_{n_{0}}^{(2)}[m,g_{0}]\right]+{\rm var}\left[2\sum\limits_{l=0}^{L}|\alpha_{l}|^{2}e^{jn_{0}\Omega_{l}}z_{n_{0}}[m,g_{0}]\right]
=\displaystyle= 4δξ+4|l=0L|αl|2ejn0Ωl|2σ2\displaystyle 4\delta_{\xi}+4\left|\sum\limits_{l=0}^{L}|\alpha_{l}|^{2}e^{jn_{0}\Omega_{l}}\right|^{2}\sigma^{2}
\displaystyle\triangleq 4δξ+4δn0σ2.\displaystyle 4\delta_{\xi}+4\delta_{n_{0}}\sigma^{2}. (50)

To minimize the variance of each entry of 𝚿{\bf\Psi}, δn0\delta_{n_{0}} needs to be minimized. Therefore, the optimal selected index of receiving antenna, n0n_{0}, satisfies that |l=0L|αl|2ejn0Ωl|2\left|\sum\limits_{l=0}^{L}|\alpha_{l}|^{2}e^{jn_{0}\Omega_{l}}\right|^{2} is minimized.

Appendix D Proof of (38)

From (V), the basis vectors of 𝐜[m,g]{\bf c}[m,g] are given by 𝐚(Ωl){\bf a}(\Omega_{l^{\prime}}). It is noted that

𝐜[m,g+c]=l=L,l0Lψl[m,g]𝐚(Ωl)ejcτ¯l,\displaystyle{\bf c}[m,g+c]=\sum\limits_{l^{\prime}=-L,l\neq 0}^{L}\psi_{l^{\prime}}[m,g]{\bf a}(\Omega_{l^{\prime}})e^{-jc\bar{\tau}_{l^{\prime}}}, (51)

where ψl[m,g]=Plejmf¯D,lejgτ¯l\psi_{l^{\prime}}[m,g]=P_{l^{\prime}}e^{jm\bar{f}_{{\rm D},l^{\prime}}}e^{-jg\bar{\tau}_{l^{\prime}}} denotes the weighting factor. Hence, the basis vectors of 𝐜[m,g+c]{\bf c}[m,g+c] only have a phase shift of cτ¯l-c\bar{\tau}_{l^{\prime}} compared with those of 𝐜[m,g]{\bf c}[m,g]. We denote the first column of 𝐂[m,g]{\bf C^{\prime}}[m,g] as 𝐜1[m,g]{\bf c}_{1}[m,g]. Then, we have

𝐜1[m,g]\displaystyle{\bf c}_{1}[m,g]
=\displaystyle= [𝐜T[m,g],,𝐜T[m,g+C1]]T\displaystyle\big{[}{\bf c^{\prime}}^{T}[m,g],\cdots,{\bf c^{\prime}}^{T}[m,g+C-1]\big{]}^{T}
=\displaystyle= l=LLψl[m,g][𝐚T(Ωl)ej0τ¯l,,𝐚T(Ωl)ej(C1)τ¯l]T.\displaystyle\sum\limits_{l=-L}^{L}\psi_{l}[m,g]\big{[}{\bf a}^{T}(\Omega_{l})e^{-j0\bar{\tau}_{l}},\cdots,{\bf a}^{T}(\Omega_{l})e^{-j(C-1)\bar{\tau}_{l}}\big{]}^{T}. (52)

Therefore, the basis vectors for 𝐜1[m,g]{\bf c}_{1}[m,g] are given by [𝐚T(Ωl),,𝐚T(Ωl)ej(C1)τ¯l]T[{\bf a}^{T}(\Omega_{l^{\prime}}),\cdots,{\bf a}^{T}(\Omega_{l^{\prime}})e^{-j(C-1)\bar{\tau}_{l^{\prime}}}]^{T}. Likewise, the basis vectors for the second column of 𝐂[m,g]{\bf C}^{\prime}[m,g] have the same expression with replacing τ¯\bar{\tau} by f¯D\bar{f}_{\rm D}.

References

  • [1] C. Sturm and W. Wiesbeck, “Waveform design and signal processing aspects for fusion of wireless communications and radar sensing,” Proc. IEEE, vol. 99, no. 7, pp. 1236–1259, Jul. 2011.
  • [2] A. R. Chiriyath, B. Paul, and D. W. Bliss, “Radar-communications convergence: Coexistence, cooperation, and co-design,” IEEE Trans. on Cogn. Commun. Netw., vol. 3, no. 1, pp. 1–12, Mar. 2017.
  • [3] P. Kumari, J. Choi, N. González-Prelcic, and R. W. Heath, “IEEE 802.11ad-based radar: An approach to joint vehicular communication-radar system,” IEEE Trans. Veh. Technol., vol. 67, no. 4, pp. 3012–3027, Apr. 2018.
  • [4] J. A. Zhang, X. Huang, Y. J. Guo, J. Yuan, and R. W. Heath, “Multibeam for joint communication and radar sensing using steerable analog antenna arrays,” IEEE Trans. Veh. Technol., vol. 68, no. 1, pp. 671–685, Jan. 2019.
  • [5] Y. Luo, J. A. Zhang, X. Huang, W. Ni, and J. Pan, “Optimization and quantization of multibeam beamforming vector for joint communication and radio sensing,” IEEE Trans. Commun., vol. 67, no. 9, pp. 6468–6482, Sep. 2019.
  • [6] F. Liu, C. Masouros, A. P. Petropulu, H. Griffiths, and L. Hanzo, “Joint radar and communication design: Applications, state-of-the-art, and the road ahead,” IEEE Trans. Commun., vol. 68, no. 6, pp. 3834–3862, Jun. 2020.
  • [7] N. González-Prelcic, R. Méndez-Rial, and R. W. Heath, “Radar aided beam alignment in mmWave V2I communications supporting antenna diversity,” in 2016 Information Theory and Applications Workshop (ITA), Jan. 2016, pp. 1–7.
  • [8] J. A. Zhang, A. Cantoni, X. Huang, Y. J. Guo, and R. W. Heath, “Framework for an innovative perceptive mobile network using joint communication and sensing,” in 2017 IEEE 85th Vehicular Technology Conference (VTC Spring), Jun. 2017, pp. 1–5.
  • [9] M. L. Rahman, J. A. Zhang, X. Huang, Y. J. Guo, and R. W. Heath, “Framework for a perceptive mobile network using joint communication and radar sensing,” IEEE Trans. Aerosp. Electron. Syst., vol. 56, no. 3, pp. 1926–1941, Jun. 2020.
  • [10] M. L. Rahman, P. Cui, J. A. Zhang, X. Huang, Y. J. Guo, and Z. Lu, “Joint communication and radar sensing in 5G mobile network by compressive sensing,” in 2019 19th International Symposium on Communications and Information Technologies (ISCIT), Sep. 2019, pp. 599–604.
  • [11] M. L. Rahman, J. A. Zhang, K. Wu, X. Huang, Y. J. Guo, S. Chen, and J. Yuan, “Enabling joint communication and radio sensing in mobile networks–a survey,” arXiv preprint arXiv:2006.07559, 2020.
  • [12] M. Braun, “OFDM radar algorithms in mobile communication networks,” in PhD thesis, Institut fur Nachrichtentechnik des Karlsruher Instituts fur Technologie, Karlsruhe,, 2014.
  • [13] J. Gu, J. Moghaddasi, and K. Wu, “Delay and Doppler shift estimation for OFDM-based radar-radio (RadCom) system,” in 2015 IEEE International Wireless Symposium (IWS 2015), Mar. 2015, pp. 1–4.
  • [14] C. Sturm, Y. L. Sit, M. Braun, and T. Zwick, “Spectrally interleaved multi-carrier signals for radar network applications and multi-input multi-output radar,” IET Radar, Sonar Navigation, vol. 7, no. 3, pp. 261–269, Mar. 2013.
  • [15] Y. L. Sit, B. Nuss, and T. Zwick, “On mutual interference cancellation in a MIMO OFDM multiuser radar-communication network,” IEEE Trans. Veh. Technol., vol. 67, no. 4, pp. 3339–3348, Apr. 2018.
  • [16] F. Liu, C. Masouros, A. Li, H. Sun, and L. Hanzo, “MU-MIMO communications with MIMO radar: From co-existence to joint transmission,” IEEE Trans. Wireless Commun., vol. 17, no. 4, pp. 2755–2770, Apr. 2018.
  • [17] F. Liu, L. Zhou, C. Masouros, A. Li, W. Luo, and A. Petropulu, “Toward dual-functional radar-communication systems: Optimal waveform design,” IEEE Trans. Signal Process., vol. 66, no. 16, pp. 4264–4279, Aug. 2018.
  • [18] Z. Zhang, X. Chai, K. Long, A. V. Vasilakos, and L. Hanzo, “Full duplex techniques for 5G networks: self-interference cancellation, protocol design, and relay selection,” IEEE Commun. Mag., vol. 53, no. 5, pp. 128–137, May 2015.
  • [19] Z. Ni, J. A. Zhang, X. Huang, K. Yang, and F. Gao, “Parameter estimation and signal optimization for joint communication and radar sensing,” in 2020 IEEE International Conference on Communications Workshops (ICC Workshops), 2020, pp. 1–6.
  • [20] C. R. Berger, B. Demissie, J. Heckenbach, P. Willett, and S. Zhou, “Signal processing for passive radar using OFDM waveforms,” IEEE J. Sel. Topics Signal Process., vol. 4, no. 1, pp. 226–238, Feb. 2010.
  • [21] C. D’Andrea, S. Buzzi, and M. Lops, “Communications and radar coexistence in the massive MIMO regime: Uplink analysis,” IEEE Trans. Wireless Commun., vol. 19, no. 1, pp. 19–33, Jan. 2020.
  • [22] M. Temiz, E. Alsusa, and L. Danoon, “A receiver architecture for dual-functional massive MIMO OFDM RadCom systems,” in 2020 IEEE International Conference on Communications Workshops (ICC Workshops), 2020, pp. 1–6.
  • [23] S. B. Aissa, M. Hizem, and R. Bouallegue, “Performance analysis of underlay waveform in the downlink of asynchronous OFDM/FBMC based cognitive radio transceivers,” in 10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014), 2014, pp. 185–190.
  • [24] S. Ben Aissa, M. Hizem, and R. Bouallegue, “Asynchronous OFDM interference analysis in multi-user cognitive radio networks,” in 2016 International Wireless Communications and Mobile Computing Conference (IWCMC), 2016, pp. 1135–1140.
  • [25] X. Li, D. Zhang, Q. Lv, J. Xiong, S. Li, Y. Zhang, and H. Mei, “Indotrack: Device-free indoor human tracking with commodity Wi-Fi,” Proc. ACM Interact. Mob. Wearable Ubiquitous Technol., vol. 1, no. 3, Sep. 2017. [Online]. Available: https://doi.org/10.1145/3130940
  • [26] K. Qian, C. Wu, Y. Zhang, G. Zhang, Z. Yang, and Y. Liu, “Widar2.0: Passive human tracking with a single Wi-Fi link,” in Proceedings of the 16th Annual International Conference on Mobile Systems, Applications, and Services.   New York, NY, USA: Association for Computing Machinery, 2018, pp. 350–361. [Online]. Available: https://doi.org/10.1145/3210240.3210314
  • [27] D. Garmatyuk, P. Giza, N. Condict, and S. Mudaliar, “Randomized OFDM waveforms for simultaneous radar operation and asynchronous covert communications,” in 2018 IEEE Radar Conference (RadarConf18), 2018, pp. 0975–0980.
  • [28] M. Kotaru, K. Joshi, D. Bharadia, and S. Katti, “SpotFi: Decimeter level localization using wifi.” in Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, vol. 45, no. 4, 2015, pp. 269–282.
  • [29] S. Chuang, W. Wu, and Y. Liu, “High-resolution AoA estimation for hybrid antenna arrays,” IEEE Trans. Antennas Propag., vol. 63, no. 7, pp. 2955–2968, Jul. 2015.
  • [30] Z. Ni, J. A. Zhang, K. Yang, F. Gao, and J. An, “Estimation of multiple angle-of-arrivals with localized hybrid subarrays for millimeter wave systems,” IEEE Trans. Commun., vol. 68, no. 3, pp. 1897–1910, Mar. 2020.
  • [31] K. W. Chan and H. C. So, “Accurate frequency estimation for real harmonic sinusoids,” IEEE Signal Process. Lett., vol. 11, no. 7, pp. 609–612, Jul. 2004.
  • [32] H. C. So, K. W. Chan, Y. T. Chan, and K. C. Ho, “Linear prediction approach for efficient frequency estimation of multiple real sinusoids: algorithms and analyses,” IEEE Trans. Signal Process., vol. 53, no. 7, pp. 2290–2305, Jul. 2005.
  • [33] Y. Liu, Q. H. Liu, and Z. Nie, “Reducing the number of elements in multiple-pattern linear arrays by the extended matrix pencil methods,” IEEE Transactions on Antennas and Propagation, vol. 62, no. 2, pp. 652–660, Feb. 2014.
  • [34] Y. Liu, “Research on the density of demodulation reference signals for dual-layer beamforming in LTE system,” in 2009 IEEE International Conference on Communications Technology and Applications, 2009, pp. 322–325.
  • [35] B. Sadiq, J. Cezanne, S. Subramanian, M. N. Islam, N. Abedini, and T. Luo, “Techniques for communicating synchronization signal block index in a physical broadcast channel payload,” U.S. Patent, Sep. 27, 2018.
  • [36] X. Gao, D. Niyato, P. Wang, K. Yang, and J. An, “Contract design for time resource assignment and pricing in backscatter-assisted RF-powered networks,” IEEE Wireless Commun. Lett., vol. 9, no. 1, pp. 42–46, Jan. 2020.
  • [37] J. An, Y. Zhang, X. Gao, and K. Yang, “Energy-efficient base station association and beamforming for multi-cell multiuser systems,” IEEE Trans. Wireless Commun., vol. 19, no. 4, pp. 2841–2854, Apr. 2020.
  • [38] T. Salman, A. Badawy, T. M. Elfouly, A. Mohamed, and T. Khattab, “Estimating the number of sources: An efficient maximization approach,” in 2015 International Wireless Communications and Mobile Computing Conference (IWCMC), 2015, pp. 199–204.
  • [39] F. Li and R. J. Vaccaro, “Analysis of Min-Norm and MUSIC with arbitrary array geometry,” IEEE Trans. Aerosp. Electron. Syst., vol. 26, no. 6, pp. 976–985, Nov. 1990.
  • [40] F. Li, H. Liu, and R. J. Vaccaro, “Performance analysis for DOA estimation algorithms: unification, simplification, and observations,” IEEE Trans. Aerosp. Electron. Syst., vol. 29, no. 4, pp. 1170–1184, Oct. 1993.
  • [41] Z. Gao, C. Hu, L. Dai, and Z. Wang, “Channel estimation for millimeter-wave massive MIMO with hybrid precoding over frequency-selective fading channels,” IEEE Commun. Lett., vol. 20, no. 6, pp. 1259–1262, Jun. 2016.