Abstract

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.

Highlights

  • Pulse deinterleaving plays an important role in electronic intelligence and electronic support measurement systems [1]

  • This paper concentrates on scenarios in which intersected pulse streams coming from different emitters have unavailable or indistinguishable directions, frequencies, and widths, and it proposes to realize online deinterleaving according to pulse repetitive intervals (PRIs) [7]–[9]

  • The two most widely cited methods are the cumulant difference histogram (CDIF) [10] and the sequential difference histogram (SDIF) [11]. They first analyze the distribution of differential time-of-arrival (DTOA) between pulses to estimate the repetitive period of the stream, and they use this period to deinterleave substreams with constant PRI

Read more

Summary

INTRODUCTION

Pulse deinterleaving plays an important role in electronic intelligence and electronic support measurement systems [1]. This paper concentrates on scenarios in which intersected pulse streams coming from different emitters have unavailable or indistinguishable directions, frequencies, and widths, and it proposes to realize online deinterleaving according to pulse repetitive intervals (PRIs) [7]–[9]. The two most widely cited methods are the cumulant difference histogram (CDIF) [10] and the sequential difference histogram (SDIF) [11] They first analyze the distribution of differential time-of-arrival (DTOA) between pulses to estimate the repetitive period of the stream (named frame PRI), and they use this period to deinterleave substreams with constant PRI. Frame PRIs are estimated in the first period, and the estimates can be exploited in the subsequent periods to realize sequential deinterleaving This is a straightforward extension of the existing CDIF [10] and SDIF [11] methods.

PULSE STREAM FORMULATION
AUTOMATA ESTABLISHING FOR PULSE STREAM RECOGNITION
Regular Grammars of Repetitive Pulse Streams
Finite Automata for Repetitive Pulse Stream Recognition
Start-up of Finite Automata
Sequential Updating of Finite Automata
PARALLEL DEINTERLEAVING OF INTERSECTED PULSE STREAMS
SIMULATION RESULTS AND ANALYSES
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call