ISWSCPTS encompasses two work modes: SM JWM for perception, communication, and PT. The following provides a detailed description of these two modes.
2.2.1. The SM of ISWSCPTS
In the SM, ISWSCPTS lacks a priori information of DDCs for the target, communication, and power transfer, necessitating estimation of these parameters. In this mode, the ISWSCPTS scans the region of interest in a phased-array manner to acquire states of DDCs from various angles.
The TF-domain received target echo whose angle is the same as the searching direction
can be expressed as:
where
is the transmitting power,
is the target scattering coefficient (TSC),
is the TF-domain transmitting signal in search mode,
is the AWGN matrix with the variance of each entry being
,
is the angle of the target,
is the steering vector and
can be expressed as:
where
d is the antenna spacing,
represents the wavelength.
In the phased-array manner,
, thus (
22) can be reformulated as:
According to (
18), the vector form of DD-domain echo
can be expressed as:
where
,
,
vectorizes matrix along the row direction. For a target with delay tap
and Doppler tap
, the
-th entry of
can be expressed as:
the
-th entry of
can be expressed as:
The MF algorithm proposed in Reference [
9] represents a state-of-the-art approach for OTFS-based target detection and parameter estimation. In this work, we offer a re-engineered version of the MF algorithm, employing an equivalent yet distinct methodology. Note that (
25) can be reformulated as:
where
,
,
is the permutation matrix. The
-th entry of
can be expressed as:
where
. Let
, (
28) can be expressed as:
We construct a matrix
. For the
i-th row of
where
,
,
is the power of transmitting signal. Then, the output
of proposed MF algorithm can be expressed as:
Peaks will appear in the indices corresponding to
and
in
, hence target presence can be detected through the constant false alarm rate (CFAR) algorithm. Additionally, by utilizing
, the delay and Doppler frequency of the target can be estimated. Specifically, if the
-th element of
is a peak, then the corresponding estimated delay tap
, Doppler tap
and TSC
are:
where
is the floor operation. Note that
can be precomputed offline. The CP-OTFS MF based target detection and parameters estimation (MF-DaPE) algorithm is summarized in Algorithm 1.
Algorithm 1: The CP-OTFS MF-DaPE algorithm |
Input: ,
Output: , ,
1 Calculate through ( 31)
2 Find peak index in through CFAR algorithm
3 Calculate through ( 32)
4 Calculate through ( 33)
5 Calculate through ( 34)
6 Return , and .
|
2.2.2. The JWM of ISWSCPTS
In the JWM, ISWSCPTS accomplishes target tracking, communication, and power transfer. In this work mode, assuming an approximate target location and using the channel state information (CSI) of the CN and ERN as priors is reasonable, as target detection has already been achieved in the SM, and CSI can be obtained by transmitting pilot signals. The ISWSCPTS aims to achieve better performance in the JWM. In this work, we enhance perception performance while ensuring communication and power transfer performance by designing the transmitting CP-OTFS signal and beamforming.
A. The receiving model of JWM
The DD-domain received echo of the target in TM can be expressed as:
Similarly, the DD-domain received signal in CN can be expressed as follows:
where
is the complex channel gain,
is the steering vector corresponding to angle of CN,
is the communication channel response matrix with delay tap
and Doppler tap
,
is the AWGN matrix with the variance of each entry being
.
The DD-domain received signal in ERN can be expressed as follows:
where
is the power transfer channel gain,
is the transmitting steering vector,
is the communication channel response matrix with delay tap
and Doppler tap
,
is the AWGN matrix with the variance of each entry being
.
B. Waveform design by ambiguity function shaping
The ambiguity function (AF) is crucial metrics for assessing radar signals. To enhance the target tracking performance of the system, we formulate an optimization problem aimed at reshaping the AF to achieve lower integral side-lobe levels (ISL). The definition of the traditional radar signal ambiguity function is as follows:
where
is the transmitting signal,
is the delay and
is the Doppler frequency. However, the output signal of the OTFS system belongs to the delay-Doppler (DD) domain, and the traditional time-domain approach cannot be used to define the OTFS ambiguity function. For OTFS, a discrete AF in the DD domain has been proposed, with the expression as follows:
where
is the DD-domain transmitting signal,
and
are delay tap and Doppler tap of interest, respectively. The ISL of
is:
Thus, the problem of waveform design for AF shaping is expressed as:
The constraint of (
41) is constant modulus constraint, which is preferred by radar system. Based on the proposition 1 presented in [
16],
can be handled by sequentially solving the following approximation problem:
where
denotes the
t-th iteration solution of the proposed iteration algorithm. The expression of
is:
where
satisfies that
. Let
,
is expressed as:
Furthermore, according to proposition 2 in [
16],
can be solved through the following problem:
where
can be expressed as:
Then, the closed-form solution for
is:
where
and
are applied element-wise to the vectors.
Note that the optimal waveform
can also be utilized in SM. This waveform design algorithm is called CP-OTFS AFS, and it is summarized in Algorithm 2.
Algorithm 2: CP-OTFS AFS |
Input: Initial and stop condition
Output: The optimized waveform
1 Let and
2
3
4
5
6 If , return . Otherwise, return to step 2.
|
C. Beamforming Design for ISWSCPTS
In this section, we investigate the beamforming design for ISWSCPTS. Within the beamforming design challenges of ISWSCPTS, two key considerations emerge: 1) optimization of sensing performance; 2) fulfilling the requirements for power transfer in the context of ERN considerations.
We begin by deriving metrics for sensing, communication, and power transfer. Subsequently, we formulate the optimization problem for ISWSCPTS beamforming design. Finally, we propose an algorithm to solve the beamforming design optimization problem.
C1. Sensing metric
In the JWM, the ISWSCPTS system necessitates continuous estimation of target parameters, and the precision of target parameter estimation is closely tied to the signal-to-noise ratio (SNR). Consequently, we employ SNR as the sensing metric.
According to (
25), the
is
Based on the properties of
and
, through a series of calculations, (
48) can be simplified to:
where
.
C2. Communication metric
Due to the impact of communication quality, such as bit error rate (BER) and channel capacity, being closely related to SNR, and in order to maintain consistency with snesing metrics, SNR is also employed as the communication metric. Similar to derivation of sensing metric, the
is
where
.
C3. Power transfer metric
The ERN collects energy from signals emitted by the SN, thus the harvested energy is employed as the metric of Power transfer. Due to the negligible power of noise compared with transmitting signal, the harvested energy can be expressed as:
where
is the energy harvesting efficiency,
.
C4. SDR-BD algorithm
As we want to optimize the sensing performance of ISWSCPTS while meeting the basic requirements for communication and power transfer, the problem of beamforming design can be expressed as:
where
represents the minimum SNR required for communication,
denotes the minimum energy requirement for triggering the energy harvesting process in ERN.
Due to the max operation and quadratic constraints, problem
is non-convex optimization. In this work,
is solved through SDR technique [
17]. According to
, where
denotes the trace operation,
can be transformed into the following equivalent optimization problem:
where
.
Then, the rank constraint is dropped to obtain the following relaxed optimization problem:
The objective function and constraints in
are all affine, thus making
a convex optimization problem.
can be solved by Matlab using the convex optimization toolbox CVX[]. If the rank of the solution
obtained in
is not equal to 1, then feasible solutions
need to be extracted from
. Following [1],
can be obtained as follows:
where
represents the maximum eigenvalue of
, and
denotes the corresponding eigenvector.