Deinterleaving of Discrete Renewal Process Mixtures with Application to Electronic Support Measures

arXiv:2402.09166v1 Announce Type: new
Abstract: 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 …

abstract application arxiv cs.lg electronic exploits information likelihood markov paper process support type