@inproceedings{884aaf54d5b54ad889b79cb63d789955,
title = "Pulse deinterleaving using isomorphic subsequences",
abstract = "The estimation of PRIs (Pulse Repetition Interval) is the core of pulse sorting. Conventional pulse sorting algorithms, based on accumulation (such as FFT), have two shortcomings: one is its difficulty in extracting short pulse segments that are dispersed in massive pulse streams; the other is the heavy computation burden for real-time processing. Accounted for interleaving and missing of multiple pulse groups, the presented algorithm consists of two main parts: repetitive substrings searching and TOA difference matrix processing. Compared with other pulse deinterleaving methods, our algorithm is robust to jitter noise and missing pulses. The computation complexity of the presented algorithm is approximately O(N).",
keywords = "Isomorphic subsequence, Longest common prefix, Pulse deinterleaving, Search algorithm, Suffix array",
author = "J. Cao and F. Li and Yang, {F. W.} and Ren, {L. X.}",
year = "2015",
doi = "10.1049/cp.2015.1341",
language = "English",
isbn = "9781785610387",
series = "IET Conference Publications",
publisher = "Institution of Engineering and Technology",
number = "CP677",
booktitle = "IET Conference Publications",
address = "United Kingdom",
edition = "CP677",
note = "IET International Radar Conference 2015 ; Conference date: 14-10-2015 Through 16-10-2015",
}