Separation of Interleaved Pulse Stream based on Directed Acyclic Graphs

In pulse deinterleaving, the search procedure may fail because of missing pulses and pulse repetition interval (PRI) jitter. This study proposes a search method based on the directed acyclic graph (DAG). In this graph, pulses are vertices and the extracted pulse pairs are arcs. The greater the length of the "path", the higher is the confidence level of the corresponding pulse sequence. Therefore, this problem is transformed into a problem associated with the extraction of the longest "path" from DAG. Since pulse segments have more confidence than individual pulses, the proposed method may have important implications and broad application prospects.