Next Article in Journal
Unmasking Nuances Affecting Loneliness: Using Digital Behavioural Markers to Understand Social and Emotional Loneliness in College Students
Next Article in Special Issue
Vehicle Recognition and Driving Information Detection with UAV Video Based on Improved YOLOv5-DeepSORT Algorithm
Previous Article in Journal
Research on Micro-Vibration Analysis of Segmented Telescope Based on Opto-Mechanical Integration
Previous Article in Special Issue
Vehicle Localization Using Crowdsourced Data Collected on Urban Roads
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Interference Mitigation Using UNet for Integrated Sensing and Communicating Vehicle Networks via Delay–Doppler Sounding Reference Signal Approach

School of Information Science and Technology, Fudan University, Shanghai 200438, China
*
Author to whom correspondence should be addressed.
Sensors 2025, 25(6), 1902; https://doi.org/10.3390/s25061902
Submission received: 9 February 2025 / Revised: 16 March 2025 / Accepted: 17 March 2025 / Published: 19 March 2025

Abstract

:
Advanced communication systems, particularly in the context of autonomous driving and integrated sensing and communication (ISAC), require high precision and refresh rates for environmental perception, alongside reliable data transmission. This paper presents a novel approach to enhance the ISAC performance in existing 4G and 5G systems by utilizing a two-dimensional offset in the Delay–Doppler (DD) domain, effectively leveraging the sounding reference signal (SRS) resources. This method aims to improve spectrum efficiency and sensing accuracy in vehicular networks. However, a key challenge arises from interference between multiple users after the wireless propagation of signals. To address this, we propose a deep learning-based interference mitigation solution using an UNet architecture, which operates on the Range–Doppler maps. The UNet model, with its encoder–decoder structure, efficiently filters out unwanted signals, therefore enhancing the system performance. Simulation results show that the proposed method significantly improves the accuracy of environmental sensing and resource utilization while mitigating interference, even in dense network scenarios. Our findings suggest that this DD-domain-based approach offers a promising solution to optimizing ISAC capabilities in current and future communication systems.

1. Introduction

Next-generation mobile communication systems, including 5G-A and 6G, must support a wide range of demanding services, such as autonomous driving and real-time virtual reality [1]. These applications require ultra-low latency, high data throughput, and the ability to connect numerous devices with high reliability and security. In autonomous driving, radar sensing plays a vital role by providing critical environmental awareness for vehicles. At the same time, Vehicle-to-Everything (V2X) networks are expected to deliver low-latency and high-capacity data communications, even in highly dynamic environments [2]. As the frequency bands for communication and radar sensing increasingly overlap, the integration of both functions within the same spectrum, i.e., integrated sensing and communication (ISAC), has become a focal point for advancing next-generation V2X technologies [3,4,5].
A major challenge in achieving ISAC in V2X networks is ensuring that multiple users can coexist while simultaneously receiving both high-precision sensing and efficient communication services. The need for effective ISAC is especially urgent as the number of smart vehicles and connected devices grows, further straining the limited spectrum resources. Although recent studies have explored active sensing within ISAC systems [6,7,8,9], they typically rely on pilot-based methods within limited sub-bands for communications, which are often inadequate for vehicular radar sensing. While the sounding reference signal (SRS) has been identified as a potential resource for enabling broader sensing capabilities, the concurrent multi-user sensing in the SRS channel has not been fully explored. This is particularly challenging when inter-user interference (IUI) arises due to the shared time–frequency (TF) resources in the system.
The emergence of Orthogonal Time Frequency Space (OTFS) technology has sparked interest in two-dimensional (2D) pilot designs. For instance, reference [10] reduces the guard interval between pilot and data symbols, optimizing pilot sequences and power allocation to maximize spectral efficiency while ensuring accurate channel estimation. Similarly, reference [11] addresses pilot placement in the Delay–Doppler (DD) domain to minimize the mean square error (MSE) of channel interpolation and balance power allocation between pilot and data symbols. Considering the application in ISAC systems, reference [12] proposes an information-theory-based target detection framework that utilizes a relative entropy test and an iterative waveform design method with OTFS signals, which improves the detection performance. Despite their contributions, these studies primarily focus on optimizing pilot placement and power distribution in the DD domain, neglecting the challenges posed by integrating multiple sounding signals and mitigating the IUI in ISAC systems with limited resources. Additionally, the implementation of OTFS technology requires significant modifications to existing systems with a new waveform introduced.
Interference cancellation using neural networks is another significant area of research that leverages the 2D characteristics of TF channels. For example, reference [13] exploits properties of the angle-delay and spatial frequency domains using a dual CNN architecture, improving multi-user channel estimation under time-varying conditions and pilot contamination across base stations (BSs). Reference [14] combines model-based and non-model-based deep neural networks (DNNs) in a cascaded structure, employing online Bayesian learning to adaptively mitigate interference in real-time scenarios. Additionally, OTFS technology has inspired image-processing-based methods, such as CNNs for feature extraction in OTFS multiple-access systems [15] and DNNs for reducing computational complexity in channel estimation in the DD domain [16]. However, these methods often neglect the complexities of dynamic vehicular networks and the challenges posed by non-orthogonality between multiple users in ISAC environments.
Inspired by [17], which emphasizes leveraging the limited local environment and TF modulation of SRS sequences in ISAC systems, we propose a novel DD-SRS-based (DD-domain-SRS-based) multi-user ISAC framework. This approach incorporates a 2D image-neural-network-based scheme to extract local environment information, conserving valuable TF resources while accommodating more users compared to orthogonal resource allocation frameworks [17,18,19] within constrained TF scopes to address the challenges of increasingly dense network environments. It is noted that a scheme based on Range–Doppler maps (RD maps) and image segmentation is investigated in [20,21] for multi-target signal classification. To the best of our knowledge, the application of IUI mitigation in non-orthogonal multiple-access scenarios has received limited attention.
Our primary contributions are as follows:
  • Proposing a novel solution for ISAC technology in V2X networks: We introduce an innovative approach that leverages the 2D offset in the DD domain within existing 4G/5G systems. This method maximizes the utilization of SRS for both radar sensing and communications, addressing the increasing demand for high-precision and high-refresh-rate environmental perception in autonomous driving and other V2X applications.
  • Addressing multi-user interference in ISAC systems: We recognize the challenge of the IUI when multiple users share limited TF resources in the SRS channel. To mitigate the IUI, we propose a deep learning (DL)-based scheme using a UNet architecture, which effectively reduces interference and enhances the accuracy of sensing in multi-user scenarios.
  • Demonstrating the feasibility and effectiveness of the proposed method: Through extensive simulations, we validate the proposed method’s capability to deliver robust and reliable multi-user sensing and communications in realistic V2X environments. The results show significant improvements in the system performance, with reduced interference and enhanced sensing accuracy, making the proposed solution viable for next-generation autonomous vehicle networks.
The remainder of this paper is organized as follows: Section 2 introduces the considered system model and ISAC signal models. Section 3 describes the proposed DD-SRS-based framework and its design principles, as well as the 2D neural network scheme, emphasizing the role of pixel segmentation in extracting local environment information. Section 4 presents experimental results and performance evaluations, demonstrating the effectiveness of the proposed approach in multi-user ISAC scenarios. Finally, Section 5 concludes the paper with a summary of key findings and suggestions for future research.
Notations: j = 1 denotes the imaginary unit. A , a and a represent a matrix, a column vector and a scalar, respectively. Conjugate transpose and transpose operators are denoted by ( · ) H and ( · ) T , respectively. C M × N represents the set of all M × N complex-valued matrices. CN ( 0 , K ) denotes the circularly symmetric complex Gaussian distribution with zero mean and covariance matrix K .

2. System and Signal

In this paper, we investigate ISAC-assisted multi-user V2X networks with orthogonal frequency division multiplexing (OFDM) technology. A BS simultaneously serves K users indexed by k K { 0 , . . . , K 1 } within a cell, utilizing N OFDM subcarriers and M consecutive symbols for sensing purposes. To maintain compatibility with existing 4G/5G V2X communication systems, it is assumed that each vehicle is equipped with ISAC devices employing OFDM signals, enabling both sensing and communication functionalities concurrently. To ensure precise sensing in high-mobility environments, each user fully exploits the TF resources of the uplink SRS sent to the BS for sensing operations. Full-duplex transmission and reception are facilitated by physically separated transmitting and receiving antennas equipped by vehicles. While transmitting the uplink SRS to the BS to acquire channel state information (CSI), each user also leverages the reflected signals to sense the surrounding environment. However, the echoes are interfered by signals from other users within the cell, which can obscure targets of interest and thereby lead to missed detections, or cause an increase in false alarm probability due to the superposition of signals. As illustrated in Figure 1, our simulated ISAC V2X network environment features three randomly moving users, each with a distinct target of interest amidst a stationary clutter background. Thus, this setup highlights the dual role of communication and sensing in overcoming the challenge of IUI and enhancing the accuracy of environmental perception.
The baseband signal for the k-th user in the time domain is represented by
s k ( t ) = m = 0 M 1 s k , m ( t ) ,
where s k , m ( t ) represents the OFDM signal in the m-th symbol for the k-th user and is given by
s k , m ( t ) = 1 N n = 0 N 1 x k , n , m e j 2 π n Δ f t rect t m T s y m T s y m ,
where x k , n , m represents the symbol of the transmit SRS at the n-th subcarrier in the m-th symbol for the k-th user in the frequency domain with M , N denoting the number of symbols and subcarriers of SRS signals transmitted. Δ f denotes the subcarrier spacing and T s y m T s + T C P is the total OFDM symbol duration time, where T s , T C P denotes the effective OFDM symbol duration and the cyclic prefix (CP) duration, respectively.
After encountering the scattering from the surrounding environments, and considering the interference from other users, the baseband signal received by the k-th user in the time domain [17,22] is represented by
y k ( t ) = l = 0 L k 1 α k , l s k ( t τ k , l ) e j 2 π f c τ k , l e j 2 π ν k , l t + i = 0 , i k K 1 l = 0 L i 1 α i , l s i ( t τ i , l ) e j 2 π f c τ i , l e j 2 π ν i , l t + w k ( t ) ,
where L k is the total number of targets and clutter in the local environment of the k-th user, and α k , l , τ k , l , ν k , l is the attenuation coefficient, the time delay and the Doppler frequency offset of the l-th path for the k-th user, respectively. w k ( t ) CN ( 0 , σ k 2 ) denotes the additive white Gaussian noise with variance σ k 2 . Furthermore, by denoting τ k , max , ν k , max as the maximum round-trip delay and the maximum Doppler shift of targets and clutter in the local environment of the k-th user, respectively, it is assumed that T C P τ k , max [22,23] and that ν k , max T s y m 1 [22,24].
After the CP removal, the inverse Fast Fourier Transforming (IFFT) operation, and time-domain discrete sampling, the received signal within M symbols Y k C N × M of the k-th user [22] is given by
Y k = l = 0 L k 1 α k , l F N H X k b ( τ k , l ) c H ( ν k , l ) + i = 0 , i k K l = 0 L i 1 α i , l F N H X i b ( τ i , l ) c H ( ν i , l ) + W k ,
where X k [ n , m ] = x k , n , m and F N H C N × N denotes the inverse Discrete Fourier Transforming (IDFT) matrix. b τ , c ν are given by
b τ = 1 , e j 2 π Δ f τ , , e j 2 π ( N 1 ) Δ f τ T , c ν = 1 , e j 2 π ν T sym , , e j 2 π ( M 1 ) ν T sym T .
In this paper, we focus on the local sensing environment information (local SEI) in the frequency domain as the primary information of interest for each user within the ISAC V2X system. The local SEI of the k-th user is given by
H k = l = 0 L k 1 α k , l b ( τ k , l ) c H ( ν k , l ) .

3. Framework and Scheme

In this section, we introduce the DD-SRS-based ISAC-assisted multi-user framework and the DL-based interference cancellation scheme based on the system discussed in Section 2. In long-term evolution (LTE) systems, the BSs utilize perfect orthogonal sequences, such as Zadoff–Chu (ZC) sequences, as multi-user uplink SRS sequences based on their orthogonality in the delay domain [25,26]. As shown in Figure 2, where each colored peak represents an SRS sequence for a distinct user, multiple users sharing identical TF resource blocks are separated based on the orthogonality of SRS sequences in the delay domain. In Figure 2, τ ˜ k , k K is the introduced phase offset of the SRS sequence in the delay domain for the k-th user and Δ i k τ ˜ i τ ˜ k denotes the interval of phase shifts between the i-th user and the k-th user in the delay domain. It is noted that the delay depicted in Figure 2 does not represent the actual channel propagation delay, but rather the designed offset of the SRS sequence in the time or frequency domain.
In our paper, we exploit the orthogonality of SRS in the DD domain to expand the capacity of multiple access of ISAC V2X systems. However, the orthogonality can be contaminated in the DD domain due to the high mobility of users, introducing IUI to the RD maps. To mitigate the IUI, we propose the image-processing-based and DL-based interference cancellation scheme. The steps of our overall scheme are as follows: Firstly, we design the SRS in the DD domain for multiple users, and construct their respective SEI. Secondly, based on the randomly generated SRS and the received signal model in (4), we generate the original RD maps for each user that involve their local SEI and the IUI terms from other users. Thirdly, we train a deep neural network based on image segmentation to extract each user’s local SEI in the DD domain from the original RD maps. Finally, we utilize digital filtering and the IFFT operation to reconstruct the SEI for each user based on the information extracted. It is worth noting that since the local SEI can also serve as the communication CSI, the proposed multiple-access framework and interference mitigation scheme are designed for both channel estimation and vehicle sensing, indicating that the communication and sensing functionalities are aligned.

3.1. Multiple-Access ISAC Framework Based on DD-SRS

We first observe the conditions that the local SEI can be perfectly estimated with the traditional SRS sequences, which are orthogonal in the delay domain in LTE systems. The N-point SRS sequence for the k-th user in the m-th symbol in the frequency domain [26] is given by
x k , m n = x b , m n e j 2 π n 1 Δ f τ ˜ k ,
where x b , m is an SRS sequence in the m-th symbol, which serves as a base sequence. Based on the received signal matrix in the TF domain, the estimated local SEI for the k-th user is
H ^ k = ( F N Y k ) X k = l = 0 L k 1 α k , l b ( τ k , l ) c H ( ν k , l ) + i = 0 , i k K l = 0 L i 1 α i , l b ( τ i , l + Δ i k ) c H ( ν i , l ) + F N W k X k .
It can be seen that the desired local SEI of the k-th user l = 0 L k 1 α k , l b ( τ k , l ) c H ( ν k , l ) can be estimated perfectly through digital filtering, i.e., extracting the parts within 0 τ τ k , max in the delay domain, when Δ i k > τ k , max , i K . That is, as long as the delay interval between any two users exceeds the maximum multi-path delay spread, the IUI component can be perfectly mitigated, allowing the BS to accurately estimate the CSI for multiple users, as illustrated in Figure 3a. However, when time-domain resources are more severely constrained due to more users, the requirement Δ i k > τ k , max to maintain the SRS orthogonality is harder to satisfy, leading to strong IUI, as shown in Figure 3b. Therefore, this method of maintaining SRS orthogonality in the one-dimensional delay domain limits the capacity for multiple access.
Inspired by [17], we leverage the properties of signals in the DD domain to construct multi-user SRS, thereby facilitating the efficient separation of signals of different users and expanding the multi-user capacity. This DD-SRS matrix in the frequency domain for the k-th user is given by
X k n , m = x b , m n e j 2 π n 1 Δ f τ ˜ k e j 2 π m 1 ν ˜ k T sym ,
where ν ˜ k denotes the offset of the SRS in the Doppler domain for the k-th user. We adopt this SRS to satisfy the sensing needs of users sharing identical resource blocks. Similar to (8), the estimated local SEI with the DD-SRS in the frequency domain is given by
H ^ k = H k + H ˜ k + W ˜ k = l = 0 L k 1 α k , l b ( τ k , l ) c H ( ν k , l ) + i = 0 , i k K l = 0 L i 1 α i , l b ( τ i , l + Δ i k ) c H ( ν i , l + δ i , k ) + F N W k X k ,
where Δ i k = τ ˜ k τ ˜ i , δ i , k = ν ˜ k ν ˜ i represents the interval of phase of the utilized DD-SRS between the i-th user and the k-th user in the delay and the Doppler domain, respectively. For the simplicity of expression, H k denotes the desired local SEI as given in (8), and H ˜ k , W ˜ k denotes the IUI SEI and the noise term, respectively. Assuming the perfect time and frequency synchronization at the transceiver of user k, H ˜ k can only be eliminated when the intervals satisfy the requirement that
Δ i k > τ k , max or δ i k > ν k , max + ν i , max , i K , i k ,
where τ k , max , ν k , max denotes the maximum delay and the Doppler shift of multiple paths of the user k. The mathematical proof of the condition of orthogonality in (11) is given in Appendix A, where the importance of properly designing certain system parameters to ensure the orthogonality is also demonstrated. Compared to the one-dimensional SRS, the DD-SRS relaxes the orthogonality conditions for multiple users by introducing an additional dimension and enlarges the capacity of multiple access. By performing a 2D-FFT operation [22], i.e., an IFFT operation in the delay domain and an FFT operation in the Doppler domain, an RD map can be obtained for each user or at the BS. As illustrated in Figure 4a, when the assumptions hold true, the modulation in the DD domain on the SRS enables perfect separation of SEI of different users. It is evident that, compared to one-dimensional SRS, DD-SRS supports orthogonal access for a greater number of users, potentially increasing the multi-user capacity. The orthogonality of the SRS can be maintained easily in traditional LTE systems since the SRS transmission is managed by the BS. However, the orthogonality can be broken due to increased SRS bursts and potential resource collisions caused by more frequent and complex sensing requirements in the V2X ISAC system. Additionally, as illustrated in Figure 4b, the high mobility of users could disrupt pilot orthogonality, causing pilot contamination in the DD domain and thus the strong IUI in the RD maps. Moreover, the wide dynamic range of the delay and Doppler shifts in the V2X channels makes maintaining user orthogonality with non-adaptive phase shifts more difficult. To address these issues, we propose a DL scheme based on pixel segmentation at ISAC vehicles or BSs to mitigate the IUI SEI terms in H ^ k .
It is noted that the proposed DD-SRS framework can be compatible with existing 4/5G systems with some necessary modifications. For example, the DD-SRS framework can be implemented within the existing aperiodic SRS transmission triggered by BSs [27] for on-demand and high-precision sounding needs. Since the existing SRS transmission considering user multiplexing involves the BS allocating SRS sequences with different cyclic shifts, some modifications can be introduced into the phase shift configurations and the corresponding RRC protocol for the additional Doppler domain based on the existing mechanism. As for the user equipment (UE), it also requires software updates to generate the DD-SRS with user-specific offsets. Simultaneously, the receiver at the BS or the UE employs enhanced 2D matched filtering techniques for the CSI recovery. Considering the orthogonality contamination, the receiver may incorporate certain interference mitigation algorithms, such as the one based on image processing proposed in the following section. Therefore, increased computational capacity and efficiency based on updated software and hardware platforms for 2D processing may be necessary.

3.2. Interference Mitigation Scheme Based on Image-Pixel-Segmentation-Based Neural Network

With the interfered SEI H ^ k in (10), we first obtain the RD map Z ^ k in the DD domain through the 2D-FFT operation. With non-orthogonal multiple access, Z ^ k is given by Z ^ k = Z k + Z ˜ k + Z ˜ W , k , where Z k , Z ˜ k , Z ˜ W , k denotes the RD map obtained by performing a 2D-FFT operation over the local SEI H k , the IUI SEI H ˜ k , and the noise term W ˜ k , respectively. To recover the local SEI H k from Z ^ k , we then model the interference cancellation problem of multiple users as a two-label classification task and feed Z ^ k into a trained image segmentation network. Specifically, the first label is obtained with Z k and the second label is obtained with Z ˜ k . Additionally, the classification task is practically approached as two separate binary classification problems since some pixels may belong to both classes contemporarily. With the predicted probabilities of the network, we obtain a binary mask U ^ k , 1 which identifies the pixels belonging to the first label based on a probability threshold p th . Next, the estimated local SEI in the DD domain is given by Z ^ k = Z ^ k U ^ k , 1 . Z ^ k directly provides the intuitive information of the sensing environment in the DD domain. Finally, through executing an inverse transformation of the 2D-FFT operation on Z ^ k , we can recover the local SEI H k for the k-th user.
The basic network structure we employ for image segmentation tasks on the RD maps is the four-layer UNet++ (UNetPP) architecture introduced in [28], as illustrated in Figure 5a. UNetPP is an enhanced CNN architecture and an extended version of the classical UNet structure. It is characterized by nested and dense skip connections between the dual-convolution blocks (DCBs, denoted by Dconv i , j in Figure 5a), which are designed to improve feature reuse and multi-scale feature fusion capabilities. The key distinction of UNetPP from the traditional UNet architecture lies in its densely connected skip pathways in the decoder path. These pathways, built upon the original skip connections in the UNet, incorporate additional intermediate convolutional modules, enabling the fusion of features from various levels. With the dense skip connections, the network conducts multiple combinations and processes at different resolutions, capturing greater contextual information and fine details, and thus enhancing the boundary and detail handling in segmentation tasks and improving the segmentation accuracy.
As shown in Figure 5a, in our proposed models, the input size of the RD map is denoted by FMP 0 = [ C 0 , H 0 , W 0 ] where C 0 , H 0 , W 0 1 is the number of channels and the number of pixels in the horizontal and vertical dimensions, respectively. FMP q = C q , H q , W q denotes the size of the feature map after the q-th encoding stage.
In our work, we utilize different encoder blocks in the backbone of the UNetPP-architecture-based network. In addition to the original DCBs utilized in [28,29], we investigate exploiting the residual blocks (RSBs) in [30] and the swin-transformer blocks (STBs) in [31] as the backbone in the UNetPP-based network to enhance the performance, and the two models are named Swin-UNetPP and UNetPP-Res34, respectively. The RSB-based and STB-based architectures are illustrated in Figure 5b,c. It is worth noting that the backbone based on the STBs in the model Swin-UNetPP is different from the one based on the DCBs and the RSBs in the model UNetPP and UNetPP-Res34. The latter two models rely on convolutional operations and pooling layers (e.g., max pooling) to progressively extract image features and reduce the spatial dimensions of feature maps in the backbone. In contrast, Swin-UNetPP employs patch embedding and patch merging for downsampling in the backbone. In the first encoding stage, Swin-UNetPP divides the input RD map into fixed-size patches, with each patch being embedded into a high-dimensional feature space through a linear transformation, a process known as patch embedding. This approach transforms each local region of the RD map into a vector representation, facilitating subsequent processing by the transformer block. For downsampling, the model uses a patch merging operation, which reduces the spatial dimensions of the feature map by merging multiple adjacent patches, rather than relying on traditional pooling operations. Therefore, FMP 1 of Swin-UNetPP is given by FMP 1 = C 0 , H 0 / h p , W 0 / w p , where [ h p , w p ] is the patch size in the patch embedding operation.
Our loss function is formulated as a weighted sum of Binary Cross-Entropy (BCE) and Dice Loss. Dice Loss is a specialized loss function for image segmentation tasks, particularly effective in addressing class imbalance issues [32,33]. The calculation formula for the Dice Loss of a given class c is as follows:
L Dice , c = 1 2 i = 1 I p i t i i = 1 I p i 2 + i = 1 I t i 2 ,
where p i is the predicted probability and t i { 0 , 1 } is the ground truth of the pixel i. When the pixel i belongs to class c, t i = 1 . I is the total number of pixels of the image. The BCE loss is given by
L BCE , c = 1 I i = 1 I t i log ( p i ) + ( 1 t i ) log ( 1 p i ) .
By performing a weighted summation of these two loss functions and averaging over both classes, we obtain the formulation for the weighted sum loss function as follows:
L total = 1 2 c = 1 2 α × L Dice , c + β × L BCE , c .

4. Simulation and Results

4.1. Configuration

Based on the deterministic channel model considered in Section 2, we utilize MATLAB R2023b to generate a substantial amount of channel data. We randomly generate 2D coordinates and 2D velocity vectors based on a uniform distribution to simulate a complex vehicular network wireless transmission environment. Additionally, the distances and velocities of multiple users are generated within the range [ d min , d max ] and [ v min , v max ] , respectively. The radar cross-section (RCS) and the received SNR settings for the received signals are referenced from [17]. The range of the RCS for stationary clutter is between 5 and 20 dBsm, while the target’s RCS ranges from 15 to 25 dBsm. The amplitudes of the direct path are modeled using the Friis transmission equation [34], whereas the reflective paths are modeled using the radar range equation [35], with phases being randomly generated with a uniform distribution. In a single Monte Carlo simulation step, after randomly generating the channels and DD-SRS sequences as in (9) for K users, we obtained the RD maps of size [ H , W ] for K users, Z ^ k , k K , following the received signal models and processing steps introduced in Section 2 and Section 3. For each scenario, we use 5000 realizations of RD maps as training data, 2000 realizations as validation data, and 1000 as test data.
For the generation of two labels, we use an amplitude threshold α th to generate a binary-value label mask U j , c of size H , W for the c-th label of the j-th RD map sample. The pixels whose values higher than α th in the RD map are marked as 1, and the pixels whose values are lower than α th are marked as 0 in the generated label map. As for the training process, we employ the SGD optimizer for both networks, with an initial learning rate of 0.08 and a weight decay rate of 0.0001 . After obtaining the network’s predicted probability outputs of all pixels from the sigmoid layer, we use a probability threshold p th = 0.5 to determine whether a pixel belongs to a label and then obtain the binary mask U ^ j , c for the j-th RD map sample.
The simulation parameters considered are listed in Table 1. The maximum unambiguous range for vehicular sensing is given by R max = 312 m, and the maximum Doppler shift available for multiple access based on the DD-SRS can reach up to ± 60 kHz. We consider utilizing 10 % of this range, namely ± 6 kHz, to preliminarily validate the feasibility of our proposed ISAC V2X framework and the interference cancellation scheme. The scenario considered is the typical urban scenario where very-high-speed vehicles (e.g., high-speed trains) and flying objects (e.g., Unmanned Aerial Vehicles) are not considered. Additionally, the parameters of the OFDM system influence the system performance. For example, the subcarrier spacing Δ f considered is designed to be several times the maximum Doppler frequency shift to ensure that the inter-subcarrier interference can be neglected [22]. Meanwhile, the bandwidth and the size of 2D FFT operations are chosen to be large enough to ensure the resolution of the RD maps to recover the local SEI. Furthermore, the trade-off between the processing latency and the performance should be considered in practical implementation since some V2X services require ultra-low latency. In our simulations, we use the network UNet-Res34, which lacks multi-layer dense connections in the decoder, as the baseline for the network UNetPP, SwinUNetPP and UNetPP-Res34 where the decoder is built upon the UNetPP-architecture-based decoder. The performance of different models on the segmentation task for the j-th RD map sample is measured by the mean Intersection over Union (mIoU) of two labels, which is given by
mIoU j = 1 2 c = 1 2 i = 1 I u ^ c , i u c , i i = 1 I u ^ c , i + i = 1 I u c , i ,
where I is the total number of pixels, and u ^ c , i , u c , i is the i-th element of the binary mask U ^ j , c , U j , c . The performance metric for a model is the average mIoU over J samples in the dataset. With the output binary mask U ^ j , 1 , we can recover the local SEI H j . We also measure the performance of our proposed algorithm with the normalized mean square error (NMSE) between H j and H ^ j , which is given by
NMSE j = H j H ^ j 2 H j 2 .

4.2. mIoU Performance of Proposed Framework and Scheme

We first demonstrate in Figure 6a,b a sample of RD maps, Z ^ , generated for scenarios with K = 25 and K = 36 at a signal-to-noise power ratio (SNR) of 15 dB, where the local SEI of the user is represented by the region enclosed within the green rectangular box. Additionally, the zoomed-in version of the parts within the green rectangular box is shown in Figure 6c,d. It can be observed that when the number of users is relatively small, the channels can essentially remain orthogonal, allowing the local SEI of each user to be easily separated. However, in more congested user scenarios, maintaining channel orthogonality becomes challenging, and signals from other users act as interference, making it difficult for direct separation methods to accurately extract the local SEI.
Figure 7 and Figure 8 illustrate the comparison between the predicted mask U ^ of UNetPP-Res34 and the label masks U for scenarios with 25 and 30 users at an SNR of 15 dB, respectively. Specifically, Figure 7a and Figure 8a demonstrate the zoomed-in areas of the corresponding label masks U , where the red dots represent the pixels corresponding to the local SEI H , and the green dots represent the pixels corresponding to the IUI SEI. It can be observed that though the IUI is higher with the condition of more users, the SEI segmentation network based on UNetPP achieves commendable mIoU performance.
Figure 9 shows the predicted mask for the scenario with 36 users at a reduced SNR of 5 dB compared to Figure 8. It is shown that as the SNR decreases, the segmentation network exhibits poorer mIoU performance. Specifically, compared to the result in the scenario with a higher SNR in Figure 8b, a greater number of isolated pixels corresponding to the noise are predicted as positive samples belonging to the first and second labels.
Apart from the level of the IUI and the SNR, the performance of the proposed scheme is also influenced by the sizes of the feature maps in the models. Table 2 presents the performance of models on the test dataset with different sizes of the feature maps. In our work, FMP q of the last four encoding stages satisfies
FMP q = C q 1 2 , H q 1 / 2 , W q 1 / 2 , q = { 2 , . . . , 5 } .
We vary FMP 1 to change the sizes of feature maps in the proposed models. While [ H 1 , W 1 ] in the UNetPP and UNetPP-Res34 can be designed to be equal to the original input size, the original input size is too large for the transformer block to process. Therefore, we fix the patch size as [ 2 , 2 ] in the patch embedding operation in the first encoding stage for Swin-UNetPP, resulting in the fixed [ H 1 , W 1 ] as [ 384 , 144 ] . Additionally, the number of STBs in the other four encoding stages is [ 2 , 2 , 8 , 2 ] , with attention head counts of 3 , 6 , 12 , 24 and a window size of 7 for the windowed self-attention mechanism. In UNetPP, the parameters in the blocks DConv i , j are fixed as kernel size = 3 , stride = 1 , padding = 1 . As for UNetPP-Res34, we substitute the encoding stage based on the DCBs in UNetPP with the layers of the same number of input and output channels in ResNet34.
It can be observed from Table 2 that increasing the size of the feature maps can enhance segmentation performance due to more information learned by the models from the feature maps at the cost of higher computational complexity. Specifically, retaining more pixel information in the first stage significantly improves the mIoU performance. UNetPP and UNetPP-Res34 exhibit the best performance at an SNR of 15 dB when FMP 1 = [ 16 , 768 , 288 ] , achieving the mIoU values of approximately 0.85 and 0.87 , respectively. This suggests that, for the data and segmentation tasks considered, downsampling easily leads to the loss of spatial information learned by the model.
Moreover, UNetPP-Res34 improves the mIoU performance by approximately 2.5 % compared to UNetPP. This performance gain is attributed to both the deeper architecture of the backbone and the residual connections in the RSBs. On one hand, the numbers of RSBs in the second, third and fourth encoding stages of UNetPP-Res34 are set as 3 , 4 , 6 , respectively, which are greater than the numbers of DCBs in the encoding stages of UNetPP, therefore providing a larger receptive field. On the other hand, incorporating residual connections in the RSBs allows more effective propagation of the feature maps, enabling the network to more "aggressively" learn the information of small targets and update the weights more efficiently. This is especially effective since the number of positive labels is extremely small in our scenarios compared to the number of negative labels, i.e., the background information in the RD map, resulting in the numerator and denominator of the Dice Loss being close to zero simultaneously. Therefore, the gradient information during training steps becomes very weak sometimes and the network struggles to effectively learn the information and improve the performance. Even the BCE loss is considered in our loss function.
As for SwinUNetPP, it is also observed that increasing the number of feature channels can improve performance to a certain extent. Despite the loss of some spatial details due to downsampling, networks with a transformer architecture leverage the large receptive field introduced by the window attention mechanism. Consequently, they also achieve good performance with FMP 1 = [ 16 , 384 , 144 ] , reaching an mIoU of 0.8561 at an SNR of 15dB. It can be also observed that when the model’s forward pass size is approximately similar, the segmentation performance of Swin-UnetPP is inferior to that of UnetPP-Res34. This could be due to the fact that the STB-based model relies on window-based self-attention to tackle the large input data of size [ 768 , 288 ] , and therefore potentially loses the ability to capture and learn comprehensive channel information.

4.3. NMSE Performance of Proposed Framework and Scheme

In this subsection, we focus on the comparison between the NMSE performance of different image segmentation models. We first demonstrate the estimated range power spectrum (RPS) diagrams obtained through segmentation by the network UNetPP and UNetPP-Res34 with 25 users at an SNR of 15dB in Figure 10 since we usually put more emphasis on the exact locations of surrounding clutter and objects in realistic ISAC V2X scenarios. Specifically, Figure 10b provides a zoomed-in view of Figure 10a. The amplitude threshold α th for label generation is set at 0.1 here, with the corresponding energy threshold being 20 dB. It can be observed that the segmentation model UNetPP-Res34, which combines the UNetPP-based CNN with residual connections, facilitates a more precise perception of the surrounding environment compared to the standard UNetPP network.
Figure 11 illustrates the NMSE performance curves for class 1 under different SNR conditions for the test dataset, following image segmentation based on random access and frequency-domain digital filtering in a scenario with 25 users. It is observed that as the SNR increases, the average NMSE decreases. This is because when the noise power is comparable to signal power, more noise is likely to be mistaken as part of the local SEI. Additionally, the superimposed noise can also lead to attenuation of the useful signal amplitude, and thereby can impact the network’s segmentation capabilities.
Table 3 presents a comparative analysis of the results obtained from UnetPP-Res34 and the standard UnetPP across scenarios with different numbers of users. It is observed that the advantages of residual connections become more pronounced under conditions of low SNR and expanded capacity of multiple access.

5. Conclusions

In this paper, we introduced an innovative multi-user ISAC framework based on the DD-SRS to tackle the challenges of multiple access in ISAC-enabled V2X networks under limited TF resources and severe IUI. By maximizing the utilization of SRS sequences’ bandwidth and local sensing capabilities of ISAC users, the framework enhances the efficiency of resource usage, enabling more users to share the same TF resources and ensuring robust multi-user coexistence. Moreover, we proposed a pixel-segmentation- and DL-based approach to minimize the IUI in non-orthogonal ISAC scenarios, leveraging RD maps for improved performance. The UNetPP-Res34 model, which integrates residual connections with dense skip connections in the encoder–decoder stages, achieved commendable mIoU performance across various SNRs and feature map sizes. Although increasing the feature map sizes could enhance the performance by allowing the network to learn more information, it could also increase the memory and time required for network inference. The model’s ability to effectively learn and retain detailed localized information under diverse SNR conditions highlighted its practical application potential for enhancing the multi-access capacity in resource-restricted scenarios. Additionally, the NMSE performance showed that UNetPP-Res34 consistently outperforms the standard UNetPP model in various user scenarios and SNR conditions, underscoring the advantages of residual connections. This paper primarily focuses on the interference cancellation in ISAC V2X systems utilizing random multiple access based on the DD-SRS. In future research, we will explore optimizing the fixed SRS and corresponding DL-based interference mitigation algorithms for BSs to maximize multiple-access capacity under diverse conditions regarding the vehicular mobility. Furthermore, we will investigate the trade-off between real-time computational complexity and performances of the DL-based methods.

Author Contributions

Conceptualization, Y.T.; methodology, Y.T.; software, Y.T.; validation, Y.T.; formal analysis, Y.T.; investigation, Y.T.; resources, Y.Z.; writing—original draft preparation, Y.T.; writing—review and editing, Y.Z.; supervision, Y.Z.; project administration, Y.Z.; funding acquisition, Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Analysis of the Condition of Orthogonality for the DD-SRS in (11)

In this appendix, we first employ the continuous Fourier Transform (FT) to analyze the condition of orthogonality in (11) based on the procedures introduced in Section 3.2. Then, we move on to discuss how the orthogonality can be ensured with DFT operations considering the parameter design in practical implementation of the DD-SRS.

Appendix A.1. Orthogonality with FT Operations

Based on the estimated local SEI with the DD-SRS in (10), we have that
H ^ k = H k + H ˜ k + W ˜ k
where
H k = l = 0 L k 1 α k , l b ( τ k , l ) c H ( ν k , l ) ,
H ˜ k = i = 0 , i k K l = 0 L i 1 α i , l b ( τ i , l + Δ i k ) c H ( ν i , l + δ i k ) ,
b τ = 1 , e j 2 π Δ f τ , , e j 2 π ( N 1 ) Δ f τ T , c ν = 1 , e j 2 π ν T sym , , e j 2 π ( M 1 ) ν T sym T .
As described in Section 3.2, to estimate H k from H ^ k based on the DD-SRS, we firstly apply a 2D FFT operation to H ^ k to obtain its representation in the DD domain, and then use a digital low-pass filter (LPF) matrix which serves as a mask and adopt the IFFT operation to recover H k .
Denoting the FT operation as F 1 and the 2D FT operation as F 2 , we have that
F 2 { H ^ k } = F 2 { H k } + F 2 { H ˜ k } + F 2 { W k } .
Then, the LPF function G ( τ , ν ) given in (A6) in the DD domain is adopted to F 2 { H ^ k } , where g τ , g ν > 0 is the designed guard interval of the filter in the delay and Doppler domains, respectively.
G ( τ , ν ) = 1 , | τ | τ k , max + g τ and | ν | ν k , max + g ν 0 , otherwise ,
The filtered signal is thereby given by
F 2 { H ^ k } · G ( τ , ν ) = F 2 { H k } + F 2 { H ˜ k } · G ( τ , ν ) + F 2 { W k } · G ( τ , ν ) .
In the following steps, we focus on proving that the condition in (11) ensures that the IUI-SEI component F 2 { H ˜ k } · G ( τ , ν ) can be eliminated.
It is noted that b , c defined in (5) represents a sampled complex exponential function with a fundamental frequency of Δ f , T sym , respectively. Therefore, b ( τ i , l + Δ i k ) , c H ( ν i , l + δ i , k ) is a delayed version of b ( τ ) , c ( ν ) , respectively, and it follows that
F 1 { b ( τ i , l + Δ i k ) } τ = δ D ( τ ( τ i , l + Δ i k ) ) , F 1 { c H ( ν i , l + δ i , k ) } ν = δ D ( ν ( ν i , l + δ i , k ) ) ,
where δ D ( · ) is the Dirac delta function. Then, the FT of the product of the two vectors is
F 2 { b ( τ i , l + Δ i k ) c H ( v i , l + δ i , k ) } τ , ν = F 2 { b ( τ i , l + Δ i k ) } τ F 2 { c H ( ν i , l + δ i , k ) } ν = δ D ( τ ( τ i , l + Δ i k ) ) δ D ( ν ( ν i , l + δ i , k ) ) .
Therefore, F 2 { H ˜ k } ( τ , ν ) is given by
F 2 { H ˜ k } ( τ , ν ) = i = 0 , i k K l = 0 L i 1 α i , l δ ( τ ( τ i , l + Δ i k ) ) δ ( ν ( ν i , l + δ i , k ) ) .
When Δ i k > τ k , max or δ i , k > ν k , max + ν i , max holds with i K , i k , it follows that
τ i , l + Δ i k > τ i , l + τ k , max τ k , max ,
or
| ν i , l + δ i , k |   | δ i , k |     | ν i , l |   > ( ν k , max + ν i , max ) ν i , max = ν k , max .
Combining (A11) and (A12), it can be observed that the following equation holds for i K , i k when the condition in (11) is satisfied
δ ( τ ( τ i , l + Δ i k ) ) δ ( ν ( ν i , l + δ i , k ) ) = 0 .
Therefore, F 2 { H ˜ k } ( τ , ν ) is zero within the interested region | τ | τ k , max + g τ , | ν | ν k , max + g ν , indicating that the term F 2 { H ˜ k } · G ( τ , ν ) corresponding to the IUI SEI can be eliminated.
Finally, we can apply the inverse 2D FT to obtain the estimated H k as
H k est = F 1 { F 2 { H ^ k } · G ( τ , ν ) } H k + W k filtered ,
where the remaining noise term W k filtered is the filtered version of the original noise, which can be further mitigated through additional signal processing techniques.

Appendix A.2. Orthogonality with DFT Operations

With DFT operations in practical implementation, the orthogonality is influenced since the ideal Dirac delta function is not achievable. In the following steps, we further prove that the IUI-SEI component can be eliminated given the orthogonality condition in (11) and the signal models in (A1)–(A4) with a few parameters properly designed.
Let us denote the 2D DFT operation with the same size as the input matrix by F ˜ 2 { · } ; then, it is obtained that
F ˜ 2 { H ^ k } = F ˜ 2 { H k } + F ˜ 2 { H ˜ k } + F ˜ 2 { W k } ,
where the local SEI and the IUI-SEI components are given by
F ˜ 2 { H k } p , q + M 2 = 1 N M l = 0 L k 1 α k , l · n = 0 N 1 m = M M 1 b n ( τ k , l ) c m ( ν k , l ) e j 2 π ( p n N q m M ) , F ˜ 2 { H ˜ k } p , q + M 2 = 1 N M i = 0 , i k K l = 0 L i 1 α i , l · n = 0 N 1 m = 0 M 1 b n ( τ i , l + Δ i k ) c m ( ν i , l + δ i k ) e j 2 π ( p n N q m M ) , p { 0 , 1 . . . , N 1 } , q { M / 2 , , 0 , , M / 2 1 } ,
where F ˜ 2 { H k } p , q + M 2 denotes the [ p , q + M 2 ] -th element of F ˜ 2 { H k } , and b n ( τ ) , c m ( ν ) are the n-th and m-th elements of b ( τ ) and c ( ν ) , respectively. Substituting the definitions of b ( τ ) and c ( ν ) in (A4) into (A16), it follows that
F ˜ 2 { H k } p , q + M 2 = 1 N M l = 0 L k 1 α k , l · n = 0 N 1 e j γ k , l p n m = 0 M 1 e j γ k , l q m , F ˜ 2 { H ˜ k } p , q + M 2 = 1 N M i = 0 , i k K l = 0 L i 1 α i , l · n = 0 N 1 e j γ i , l p n m = 0 M 1 e j γ i , l q m ,
where γ i , l p 2 π ( Δ f ( τ i , l + Δ i , k ) p / N ) , γ i , l q 2 π ( T sym ( ν i , l + δ i k ) q / M ) , Δ i , i = δ i , i = 0 , i K . The inner sum of exponential terms can be written as
n = 0 N 1 e j γ i , l p n = 1 e j γ i , l p N 1 e j γ i , l p , p N Δ f ( τ i , l + Δ i , k ) , N , p = N Δ f ( τ i , l + Δ i , k ) . m = 0 M 1 e j γ i , l q m = 1 e j γ i , l q M 1 e j γ i , l q , q M T sym ( ν i , l + δ i k ) , M , q = M T sym ( ν i , l + δ i k ) .
Next, a digital LPF matrix G is applied to F ˜ 2 { H ^ k } and is given by
G p , q + M 2 = 1 , if | p | P filt and | q | Q filt , 0 , otherwise .
where x denotes the minimum integer no less than x and P filt P max + P g , Q filt Q max + Q g , P max N Δ f τ k , max , Q max M T sym ν k , max . P g , Q g > 0 denotes the designed guard interval of the filter in the two dimensions, respectively. For the analysis of the elimination of the interference, we focus on the power of the IUI-SEI component processed after the filter within the region | p | P filt , | q | Q filt , which is given by
F ˜ 2 { H ˜ k } · G p , q + M 2 2 = 1 N 2 M 2 i = 0 , i k K l = 0 L i 1 α i , l 2 · 1 e j γ i , l p N 1 e j γ i , l p 2 1 e j γ i , l q M 1 e j γ i , l q 2 .
Without loss of generality, we focus on the analysis with k = 0 , i = 1 , , K 1 . We assume that τ k , max = τ max , ν k , max = ν max , k . Additionally, the number of offsets between the user i and the user 0 is designed as follows based on the condition in Equation (11)
P i Δ = i P max + P ˜ g and Q i δ = 0 , i = 1 , , K 1 ,
or
Q i δ = 2 i Q max + Q ˜ g and P i Δ = 0 , i = 1 , , K 1 ,
where P ˜ g > P g , Q ˜ g > Q g is the designed guard interval of the offset in the two dimensions, respectively. For the following discussions, we first investigate the case with (A21).
To analyze the expression in (A20), we analyze the property of the function f ( γ ) 1 e j γ N 1 e j γ regarding γ [ 0 , . . . , 2 π p N , . . . , 2 π ] , p [ 0 , 1 , . . . N ] . Firstly, since it is shown in (A23) that f ( π + x ) = f ( π x ) for x [ 0 , π ] , f ( γ ) is symmetric about π .
f ( π + x ) f ( π x ) = 1 e j x N 1 + e j x 1 e j x N 1 + e j x = 0 .
Secondly, since sin ( γ N / 2 ) = sin ( π p ) and f ( γ ) = 1 e j γ N 1 e j γ = e j γ N / 2 ( e j γ N / 2 e j γ N / 2 ) e j γ / 2 ( e j γ / 2 e j γ / 2 ) = sin ( γ N / 2 ) sin ( γ / 2 ) , we can calculate that
f ( γ ( p + 1 ) ) f ( γ ( p ) ) = 1 sin ( π ( p + 1 ) N ) 1 sin ( π p N ) = sin ( π p N ) sin ( π ( p + 1 ) N ) sin ( π p N ) sin ( π ( p + 1 ) N ) .
For the numerator g ( p ) sin ( π p N ) sin ( π ( p + 1 ) N ) in (A24), it is obvious that g ( p ) < 0 , p ( 0 , π 2 ) and that g ( p ) > 0 , p ( π 2 , π ) .
Then, due to the symmetry about π , we can conclude that f ( γ ) is monotonically decreasing on ( 0 , π ) and monotonically increasing on [ π , 2 π ] . The power of f ( γ ) with regard to the γ i , l p in the delay domain under the simulation parameters in Table 1 in Section 4.1 is illustrated in Figure A1. It can be observed that the power decays by 40 dB with γ p 0.05 π , and decays by more than 50 dB with γ p 0.25 π . Therefore, with a proper design of N and Δ f , it can be ensured that | f ( 2 Δ f τ max ) | 2 is very small, indicating that the energy corresponding to a path of the user i in (A20) decays a lot from p N Δ f τ i , l to p N Δ f τ i , l ± P max with a shift of P max points in the discrete DD domain.
Figure A1. | f ( γ ) | 2 when N = 768 , Δ f = 120 kHz.
Figure A1. | f ( γ ) | 2 when N = 768 , Δ f = 120 kHz.
Sensors 25 01902 g0a1
Next, we come back to the analysis of the power given in (A20) under the condition in (A21). It indicates that within the region | p | P filt , | q | Q filt , we have that l { 0 , 1 , . . , L i }
2 π ( Δ f τ i , l + ( ( i 1 ) P max + P ˜ g P g ) / N ) γ i , l p 2 π ( Δ f τ i , l + ( i P max + P ˜ g ) / N ) , 2 π ( T sym ν i , l Q filt / M ) γ i , l q 2 π ( T sym ν i , l + Q filt / M ) .
Therefore, according to the properties of f ( γ ) analyzed above and the fact that α i , 0 > α i , 1 > > α i , L i 1 , we have that for | p | P filt , | q | Q filt ,
P leak max max F ˜ 2 { H ˜ k } · G p , q + M 2 2 = max F ˜ 2 { H ˜ k } · G P filt , Q 1 , 0 + M 2 2 , F ˜ 2 { H ˜ k } · G 0 , Q K 1 , L K 1 + M 2 2 ,
where Q i , l M T sym ν i , l . Therefore, if the guard interval of the offset and the filter in the delay dimension, i.e., P ˜ g , P g , are designed properly, then the power of the IUI SEI component in the region of interest, i.e., | p | P filt , | q | Q filt , for extracting the local SEI on the RD map can be ignored approximately under the condition in (A21). Likewise, since the properties of f ( γ ) still hold in the case with the Doppler domain, the same conclusion can be drawn and the proof is omitted here.
For example, for a 3-user multiple access, based on the simulation parameters given in Section 4.1 under a typical scenario, we can have that P max 200 , Q max 60 . To estimate the local SEI of user 0, the component of user 2 can be omitted since the power of the component corresponding to | f ( γ 2 , 0 P filt ) | 2 decays by more than 40 dB. Therefore, we can design that P ˜ g = 40 , P g = 20 , Q ˜ g = 20 , Q g = 10 to ensure that P leak max is small enough to be omitted.
In conclusion, under the orthogonality condition in Equation (11), the IUI-SEI component can be effectively eliminated in the DD domain within the region of interest as defined by the LPF with the parameters properly designed.

References

  1. SAAD, W.; Bennis, M.; Chen, M.Z. A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems. IEEE Netw. 2020, 34, 134–142. [Google Scholar] [CrossRef]
  2. Han, D.; So, J. Energy-Efficient Resource Allocation Based on Deep Q-Network in V2V Communications. Sensors 2023, 23, 1295. [Google Scholar] [CrossRef] [PubMed]
  3. Cheng, X.; Duan, D.; Gao, S.J.; Yang, L.Q. Integrated Sensing and Communications (ISAC) for Vehicular Communication Networks (VCN). IEEE Internet Things J. 2022, 9, 23441–23451. [Google Scholar] [CrossRef]
  4. Noor-A-Rahim, M.; Liu, Z.L.; Lee, H.Y.; Khyam, M.O.; He, J.H.; Pesch, D. 6G for Vehicle-to-Everything (V2X) Communications: Enabling Technologies, Challenges, and Opportunities. Proc. IEEE 2022, 110, 712–734. [Google Scholar] [CrossRef]
  5. Matricardi, E.; Favarelli, E.; Pucci, L.; Xu, W.; Paolini, E.; Giorgetti, A. Toward Intelligent Roads: Uniting Sensing and Communication in Mobile Networks. Sensors 2025, 25, 778. [Google Scholar] [CrossRef]
  6. Zhao, Q.M.; Li, S.Q.; Tang, A.M.; Wang, X.D. Energy-Efficient Reference Signal Optimization for 5G V2X Joint Communication and Sensing. In Proceedings of the ICC 2022—IEEE International Conference on Communications, Seoul, Republic of Korea, 16–20 May 2022; pp. 1040–1045. [Google Scholar]
  7. Wei, Z.Q.; Wang, Y.; Ma, L.; Yang, S.S.; Feng, Z.Y.; Pan, C.K. 5G PRS-Based Sensing: A Sensing Reference Signal Approach for Joint Sensing and Communication System. IEEE Trans. Veh. Technol. 2023, 72, 3250–3263. [Google Scholar] [CrossRef]
  8. Golzadeh, M.; Tiirola, E.; Talvitie, J.; Anttila, L.; Hooli, K.; Tervo, O. Joint Sensing and UE Positioning in 5G-6G: PRS Range Estimation with Suppressed Ambiguity. In Proceedings of the 2024 IEEE Radar Conference (RadarConf24), Denver, CO, USA, 6–10 May 2024; pp. 1–6. [Google Scholar]
  9. Bednarz, M.; Zielinski, T.P. Remote Radio Frequency Sensing Based on 5G New Radio Positioning Reference Signals. Sensors 2025, 25, 337. [Google Scholar] [CrossRef] [PubMed]
  10. Wang, S.Q.; Guo, J.; Wang, X.Y.; Yuan, W.J.; Fei, Z.S.; Pan, C.K. Pilot Design and Optimization for OTFS Modulation. IEEE Wirel. Commun. Lett. 2021, 10, 1742–1746. [Google Scholar] [CrossRef]
  11. Werf, I.V.D.; Heusdens, R.; Hendriks, C.R.; Leus, G. Optimal Pilot Design for OTFS in Linear Time-Varying Channels. arXiv 2024, arXiv:2403.19379. [Google Scholar]
  12. Miao, Q.; Shen, X.; Xie, C.; Gao, Y.; Chen, L. Integrated Sensing and Communication Target Detection Framework and Waveform Design Method Based on Information Theory. Sensors 2025, 25, 465. [Google Scholar] [CrossRef] [PubMed]
  13. Jiang, P.W.; Wen, C.K.; Jin, S.; Li, Y.G. Dual CNN-Based Channel Estimation for MIMO-OFDM Systems. IEEE Trans. Commun. 2021, 69, 5859–5872. [Google Scholar] [CrossRef]
  14. Guo, H.Y.; Lau, V.K.N. Robust Deep Learning for Uplink Channel Estimation in Cellular Network Under Inter-Cell Interference. IEEE J. Sel. Areas Commun. 2023, 41, 1873–1887. [Google Scholar] [CrossRef]
  15. Wang, Y.; Han, S.; Xue, Q.; Wang, X.Y. CNN Based OTFS Channel State Discrimination and Recognition. In Proceedings of the 2023 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), Beijing, China, 14–16 June 2023; pp. 1–6. [Google Scholar]
  16. Mattu, S.R.; Chockalingam, A. Learning in Time-Frequency Domain for Fractional Delay-Doppler Channel Estimation in OTFS. IEEE Wirel. Commun. Lett. 2024, 13, 1245–1249. [Google Scholar] [CrossRef]
  17. Sakhnini, A.; Bourdoux, A.; Pollin, S. Range-Doppler Division Multiple Access for Joint Radar and Communication. In Proceedings of the ICC 2023—IEEE International Conference on Communications, Rome, Italy, 28 May–1 June 2023; pp. 3534–3539. [Google Scholar]
  18. Hsu, H.W.; Lin, Y.C.; Lee, M.C.; Lin, C.H.; Lee, T.S. Deep Learning-Based Range-Doppler Map Reconstruction in Automotive Radar Systems. In Proceedings of the 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring), Helsinki, Finland, 25 April–19 May 2021; pp. 1–7. [Google Scholar]
  19. Jeong, T.; Lee, S. Resource-Efficient Range-Doppler Map Generation Using Deep Learning Network for Automotive Radar Systems. IEEE Access 2023, 11, 55965–55977. [Google Scholar] [CrossRef]
  20. Xu, Y.; Li, W.; Yang, Y.; Ji, H.; Li, B.; Lang, Y. Multiple Targets Echo Separation on Radar Range–Doppler Maps via Dual Decoupling Perception. IEEE Sensors J. 2022, 22, 20797–20804. [Google Scholar] [CrossRef]
  21. Xu, Y.; Li, W.; Yang, Y.; Ji, H.; Lang, Y. Superimposed Mask-Guided Contrastive Regularization for Multiple Targets Echo Separation on Range–Doppler Maps. IEEE Trans. Instrum. Meas. 2023, 72, 5028712. [Google Scholar] [CrossRef]
  22. Keskin, M.F.; Wymeersch, H.; Koivunen, V. Monostatic Sensing with OFDM Under Phase Noise: From Mitigation to Exploitation. IEEE Trans. Signal Process. 2023, 71, 1363–1378. [Google Scholar] [CrossRef]
  23. Tigrek, R.F.; De Heij, W.J.A.; Van Genderen, P. OFDM Signals as the Radar Waveform to Solve Doppler Ambiguity. IEEE Trans. Aerosp. Electron. Syst. 2012, 48, 130–143. [Google Scholar] [CrossRef]
  24. Keskin, M.F.; Koivunen, V.; Wymeersch, H. Limited Feedforward Waveform Design for OFDM Dual-Functional Radar-Communications. IEEE Trans. Signal Process. 2021, 69, 2955–2970. [Google Scholar] [CrossRef]
  25. 3GPP. TS 36.211: Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation. In Technical Specification; 3rd Generation Partnership Project: Valbonne, France, 2020; Volume V15.8.0. [Google Scholar]
  26. Sesia, S.; Toufik, I.; Baker, M. LTE—The UMTS Long Term Evolution: From Theory to Practice, 2nd ed.; John Wiley & Sons: Chichester, UK, 2011; pp. 145–146. [Google Scholar]
  27. 3GPP. TS 38.211: NR; Physical channels and modulation. In Technical Specification; 3rd Generation Partnership Project: Valbonne, France, 2020; Volume V16.4.0. [Google Scholar]
  28. Zhou, Z.W.; Siddiquee, M.M.R.; Tajbakhsh, N.; Liang, J.M. UNet++: A Nested U-Net Architecture for Medical Image Segmentation. In Proceedings of the Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support (DLMIA 2018, ML-CDS 2018), Granada, Spain, 20 September 2018; Volume 11045, pp. 3–11. [Google Scholar]
  29. Ronneberger, O.; Fischer, P.; Brox, T. U-Net: Convolutional Networks for Biomedical Image Segmentation. In Proceedings of the International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI), Munich, Germany, 5–9 October 2015; Volume 9351, pp. 234–241. [Google Scholar]
  30. He, K.M.; Zhang, X.Y.; Ren, S.Q.; Su, J. Deep Residual Learning for Image Recognition. In Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas, NV, USA, 26 June–1 July 2016; pp. 770–778. [Google Scholar]
  31. Liu, Z.; Lin, Y.T.; Cao, Y.; Hu, H.; Wei, Y.X.; Zhang, Z.; Lin, S.; Guo, B.N. Swin transformer: Hierarchical vision transformer using shifted windows. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), Montreal, QC, Canada, 11–17 October 2021; pp. 10012–10022. [Google Scholar]
  32. Milletari, F.; Navab, N.; Ahmadi, S.A. V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation. In Proceedings of the 2016 Fourth International Conference on 3D Vision (3DV 2016), Stanford, CA, USA, 25–28 October 2016; pp. 565–571. [Google Scholar]
  33. Sudre, C.H.; Li, W.; Vercauteren, T.; Ourselin, S.; Cardoso, M.J. Generalized Dice Overlap as a Deep Learning Loss Function for Highly Unbalanced Segmentations. In Proceedings of the Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support (DLMIA 2017), Quebec City, QC, Canada, 14 September 2017; pp. 240–248. [Google Scholar]
  34. Molisch, A. Wireless Communications, 4th ed.; John Wiley & Sons: Hoboken, NJ, USA, 2010; pp. 104–106. [Google Scholar]
  35. Richards, M.A. Fundamentals of Radar Signal Processing, 2nd ed.; McGraw-Hill Education: New York, NY, USA, 2014; pp. 238–239. [Google Scholar]
Figure 1. ISAC V2X scenario for 3 users.
Figure 1. ISAC V2X scenario for 3 users.
Sensors 25 01902 g001
Figure 2. Orthogonal SRS in delay domain.
Figure 2. Orthogonal SRS in delay domain.
Sensors 25 01902 g002
Figure 3. Multiple access based on one-dimensional SRS: (a) orthogonal multiple access; (b) non-orthogonal multiple access.
Figure 3. Multiple access based on one-dimensional SRS: (a) orthogonal multiple access; (b) non-orthogonal multiple access.
Sensors 25 01902 g003
Figure 4. RD map based on the DD-SRS: (a) orthogonal multiple access; (b) non-orthogonal multiple access.
Figure 4. RD map based on the DD-SRS: (a) orthogonal multiple access; (b) non-orthogonal multiple access.
Sensors 25 01902 g004
Figure 5. The model architecture: ( a ) the UNetPP architecture; ( b ) the RSB-based architecture; ( c ) the STB-based architecture.
Figure 5. The model architecture: ( a ) the UNetPP architecture; ( b ) the RSB-based architecture; ( c ) the STB-based architecture.
Sensors 25 01902 g005
Figure 6. RD Map samples: ( a )   K = 25 ; ( b ) K = 36 ; ( c ) the zoomed-in version with K = 25 ; ( d ) the zoomed-in version with K = 36 .
Figure 6. RD Map samples: ( a )   K = 25 ; ( b ) K = 36 ; ( c ) the zoomed-in version with K = 25 ; ( d ) the zoomed-in version with K = 36 .
Sensors 25 01902 g006
Figure 7. Results with K = 25 , mIoU = 0.89 : ( a ) binary label mask; ( b ) predicted mask of UNetPP-Res34.
Figure 7. Results with K = 25 , mIoU = 0.89 : ( a ) binary label mask; ( b ) predicted mask of UNetPP-Res34.
Sensors 25 01902 g007
Figure 8. Results with K = 36 , mIoU = 0.84 : ( a ) binary label mask; ( b ) predicted mask of UNetPP-Res34.
Figure 8. Results with K = 36 , mIoU = 0.84 : ( a ) binary label mask; ( b ) predicted mask of UNetPP-Res34.
Sensors 25 01902 g008
Figure 9. Predicted mask of UNetPP-Res34 with K = 36 , mIoU = 0.81 .
Figure 9. Predicted mask of UNetPP-Res34 with K = 36 , mIoU = 0.81 .
Sensors 25 01902 g009
Figure 10. RPS with K = 25 : ( a ) the full diagram; ( b ) the zoomed-in diagram.
Figure 10. RPS with K = 25 : ( a ) the full diagram; ( b ) the zoomed-in diagram.
Sensors 25 01902 g010
Figure 11. Average NMSE of local SEI H k with K = 25 versus S N R with different models.
Figure 11. Average NMSE of local SEI H k with K = 25 versus S N R with different models.
Sensors 25 01902 g011
Table 1. Simulation parameters.
Table 1. Simulation parameters.
Number of subcarriers N = 768
Number of symbols M = 256
Carrier frequency f c = 6 GHz
Subcarrier spacing Δ f = 120 kHz
Total bandwidth B = 102 MHz
OFDM effective symbol duration T s = 8.3 µs
OFDM CP duration T C P = 2 µs
OFDM symbol duration T s y m = 10.3 µs
Size of the RD Map H 0 , W 0 = 768 , 288
Number of users K = 25
[ d min , d max ] [ 5 , 300 ] m
[ v min , v max ] [ 2 , 25 ] m/s
Table 2. mIoU with different sizes of feature maps with K = 25 .
Table 2. mIoU with different sizes of feature maps with K = 25 .
Models FMP 1 SNR = 5 dBSNR = 15 dB
UNet-Res34 [ 8 , 768 , 288 ] 0.732 0.7487
[ 16 , 384 , 144 ] 0.744 0.771
[ 16 , 768 , 288 ] 0.75 0.783
[ 32 , 768 , 288 ] 0.753 0.787
UNetPP [ 8 , 768 , 288 ] 0.8136 0.8415
[ 16 , 384 , 144 ] 0.7794 0.8047
[ 16 , 768 , 288 ] 0.8268 0.8518
[ 32 , 768 , 288 ] 0.8269 0.8475
SwinUNetPP [ 8 , 384 , 144 ] 0.8025 0.8298
[ 16 , 384 , 144 ] 0.8335 0.8561
[ 32 , 384 , 144 ] 0.837 0.8592
UNetPP-Res34 [ 8 , 768 , 288 ] 0.8422 0.8691
[ 16 , 384 , 144 ] 0.8276 0.8403
[ 16 , 768 , 288 ] 0.851 0.8764
[ 32 , 768 , 288 ] 0.8504 0.8716
Table 3. NMSE with different models based on the UNetPP architecture with the unit of dB.
Table 3. NMSE with different models based on the UNetPP architecture with the unit of dB.
ModelsKSNR = 5 dBSNR = 10 dBSNR = 20 dB
UNetPP-Res3425−13.278−16.2−17.954
36−8.18047−11.2551−13.4811
UNetPP25−9.73−13.55−15.207
36−3.6609−7.7904−9.7965
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Tang, Y.; Zhu, Y. Interference Mitigation Using UNet for Integrated Sensing and Communicating Vehicle Networks via Delay–Doppler Sounding Reference Signal Approach. Sensors 2025, 25, 1902. https://doi.org/10.3390/s25061902

AMA Style

Tang Y, Zhu Y. Interference Mitigation Using UNet for Integrated Sensing and Communicating Vehicle Networks via Delay–Doppler Sounding Reference Signal Approach. Sensors. 2025; 25(6):1902. https://doi.org/10.3390/s25061902

Chicago/Turabian Style

Tang, Yuanqi, and Yu Zhu. 2025. "Interference Mitigation Using UNet for Integrated Sensing and Communicating Vehicle Networks via Delay–Doppler Sounding Reference Signal Approach" Sensors 25, no. 6: 1902. https://doi.org/10.3390/s25061902

APA Style

Tang, Y., & Zhu, Y. (2025). Interference Mitigation Using UNet for Integrated Sensing and Communicating Vehicle Networks via Delay–Doppler Sounding Reference Signal Approach. Sensors, 25(6), 1902. https://doi.org/10.3390/s25061902

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop