WVEmbs with its Masking: A Method For Radar Signal Sorting
Xianan Hu, Fu Li, Kairui Niu, Peihan Qi, Zhiyong Liang
TL;DR
This work tackles radar signal sorting (RSS) under high-density interleaving and non-ideal conditions where prior DL approaches struggle. It introduces Wide-Value-Embeddings (WVEmbs) to map PDWs into normalized, multi-periodic embeddings and a value-dimension masking strategy for hard sample mining, enabling a one-step end-to-end RSS pipeline. With a CNN-backed ModernTCN backbone, the method achieves high-accuracy, sample-level deinterleaving, notably reaching $88.680\%$ RSS accuracy and robust performance across three scenarios, while ablations show improvements over standard embeddings and enhanced training stability. The approach reduces reliance on manual preprocessing and clustering, offering an efficient, robust solution for dense interleaved radar environments and suggesting avenues for theoretical analysis and broader time-series applications.
Abstract
Our study proposes a novel embedding method, Wide-Value-Embeddings (WVEmbs), for processing Pulse Descriptor Words (PDWs) as normalized inputs to neural networks. This method adapts to the distribution of interleaved radar signals, ranking original signal features from trivial to useful and stabilizing the learning process. To address the imbalance in radar signal interleaving, we introduce a value dimension masking method on WVEmbs, which automatically and efficiently generates challenging samples, and constructs interleaving scenarios, thereby compelling the model to learn robust features. Experimental results demonstrate that our method is an efficient end-to-end approach, achieving high-granularity, sample-level pulse sorting for high-density interleaved radar pulse sequences in complex and non-ideal environments.
