离散更新过程混合的去交织及其在电子支援措施中的应用
Deinterleaving of Discrete Renewal Process Mixtures with Application to Electronic Support Measures
AI总结:
本文提出一种基于惩罚似然最大化的离散更新马尔可夫链混合去交织方法,利用符号序列与到达时间信息,理论证明大样本下可恢复真实划分,并在合成数据及RESM脉冲序列去交织中验证了其有效性。
摘要:
在本文中,我们提出了一种新的去交织方法,用于处理离散更新马尔可夫链的混合。该方法依赖于惩罚似然得分的最大化。它利用了关于不同符号序列及其到达时间的所有可用信息。我们进行了理论分析,证明在温和的条件下,最小化该得分能够在样本量趋于无穷时恢复符号的真实划分。随后,该理论分析通过在合成数据上的实验得到了验证。最后,该方法被应用于在RESM(雷达电子支援测量)背景下对不同发射机接收到的脉冲序列进行去交织,我们展示了所提出的方法在模拟战争数据集上能够与最先进的方法相媲美。
英文摘要:
In this paper, we propose a new deinterleaving method for mixtures of discrete renewal Markov chains. This method relies on the maximization of a penalized likelihood score. It exploits all available information about both the sequence of the different symbols and their arrival times. A theoretical analysis is carried out to prove that minimizing this score allows to recover the true partition of symbols in the large sample limit, under mild conditions on the component processes. This theoretical analysis is then validated by experiments on synthetic data. Finally, the method is applied to deinterleave pulse trains received from different emitters in a RESM (Radar Electronic Support Measurements) context and we show that the proposed method competes favorably with state-of-the-art methods on simulated warfare datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。