系统工程与电子技术 ›› 2026, Vol. 48 ›› Issue (11): 3792-3798.doi: 10.12305/j.issn.1001-506X.2026.11.11

• 传感器与信号处理 • 上一篇    下一篇

射频掩护脉冲对抗场景下的分选技术

董阳阳(), 尹卓新(), 王贤铧(), 常诚()   

  1. 西安电子科技大学电子工程学院,陕西 西安 710071
  • 收稿日期:2025-08-27 修回日期:2025-11-11 接受日期:2025-11-27 出版日期:2026-10-25 发布日期:2026-01-19
  • 通讯作者: 董阳阳 E-mail:yydong@xidian.edu.cn;yinzhuoxin@stu.xidian.edu.cn;wangxianhua@xidian.edu.cn;2215070954@qq.com
  • 作者简介:董阳阳(1991—),男,副教授,博士,主要研究方向为电磁频谱感知、辐射源智能对抗
    尹卓新(2001—),女,硕士研究生,主要研究方向为电子侦察、雷达干扰
    王贤铧(1986—),男,助理研究员,硕士,主要研究方向为电子对抗信号处理与仿真
    常 诚(1999—),男,硕士研究生,主要研究方向为侦察信号处理、干扰优化

Sorting technology in radio frequency-masking pulses confrontations scene

Yangyang Dong(), Zhuoxin Yin(), Xianhua Wang(), Cheng Chang()   

  1. School of Electronic Engineering,Xidian University,Xi’an 710071,China
  • Received:2025-08-27 Revised:2025-11-11 Accepted:2025-11-27 Online:2026-10-25 Published:2026-01-19
  • Contact: Yangyang Dong E-mail:yydong@xidian.edu.cn;yinzhuoxin@stu.xidian.edu.cn;wangxianhua@xidian.edu.cn;2215070954@qq.com

摘要:

射频掩护脉冲分选反侦察手段的应用显著增加了雷达信号分选的难度。针对此问题,提出一种双阶段聚类分选算法。利用自组织映射(self-organizing map, SOM)神经网络对含射频掩护脉冲背景数据初聚类,滤除射频掩护脉冲,得到真实雷达信号聚类中心数量和质心位置,作为K-Means聚类的关键特征参数。通过引入K维树解决K-Means算法处理高密度数据和大量最邻近计算时间复杂度较高的问题。实验结果表明,所提聚类算法不仅将分选结果准确率提升至96.09%,还可降低K-Means聚类算法的时间复杂度,使雷达侦察系统在射频掩护脉冲对抗场景下能更高效准确地完成信号分选任务。

关键词: 雷达信号分选, 对抗场景, 射频掩护脉冲, 双阶段聚类, K维树

Abstract:

The application of radio frequency-masking pulses sorting anti-reconnaissance measures significantly increased the difficulty of radar signals sorting. To solve this problem, a two-stage clustering sorting algorithm is proposed. Self-organizing map (SOM) is used to preliminarily cluster the background data containing radio frequency-masking pulses, filter the radio frequency-masking pulses, and obtain the number of cluster centers and centroid positions of real radar signals, which are used as the key feature parameters of K-Means clustering. The problem of high time complexity of the K-Means algorithm when processing high-density data and a large number of nearest neighbor computations is solved by introducing the K-dimensional tree. The experimental results show that the accuracy rate of the sorting results of the proposed clustering algorithm is increased to 96.09%, the time complexity of K-Means clustering algorithm is reduced, so that the radar reconnaissance system can complete the signal sorting task more efficiently and accurately in the radio frequency-masking pulses confrontation scene.

Key words: radar signals sorting, confrontation scene, radio frequency-masking pulse, two-stage clustering, K-dimensional (K-D) tree

中图分类号: