Online Pulse Deinterleaving With Finite Automata

被引：32

作者：

Liu, Zhang-Meng ^{[1
]}

机构：

[1] Natl Univ Def Technol, State Key Lab Complex Electromagnet Environm Effe, Changsha 410073, Peoples R China

来源：

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS | 2020年 / 56卷 / 02期

基金：

美国国家科学基金会;

关键词：

Automata; Grammar; Histograms; Harmonic analysis; Radar; Task analysis; Electronic intelligence (ELINT); electronic support measurement (ESM); finite automaton (FA); pulse deinterleaving; regular grammar; IMPROVED ALGORITHM; TRAINS;

D O I：

10.1109/TAES.2019.2925447

中图分类号：

V [航空、航天];

学科分类号：

08 ; 0825 ;

摘要：

Most of the existing deinterleaving methods work offline; they deinterleave pulse streams in a recursive way via multipass searching. Such methods do not fit online processing applications, and they have very low deinterleaving efficiency. In this paper, I address the deinterleaving problem of streams with repetitive periods, such as streams with constant or stagger pulse repetition intervals. Transitions between the pulses of different states are illustrated with regular grammars, and finite automata are established accordingly to realize online pulse deinterleaving. The states of pulse streams being deinterleaved are stored and continuously updated in the automata, and newly received pulses are judged by the associated finite state controls to determine whether they come from a certain emitter, so as to realize online deinterleaving. In the automaton-based method, multiple automata can be started to work parallel on the same stream, and they deinterleave intersected streams via one-pass (instead of recursive) searching. Simulation results also demonstrate the superiority of the proposed method in pulse-deinterleaving performances.

引用

页码：1139 / 1147

页数：9

共 21 条

[1]

[Anonymous], 2008, Introduction to automata theory, languages, and computation

[2]

Arslan H, 2007, SIGNALS COMMUN TECHN, P1, DOI 10.1007/978-1-4020-5542-3

[3] Deinterleaving of radar signals and PRF identification algorithms [J].