Abstract
Analytical expressions for the computational requirements of broad classes of radar pulse deinterleaving algorithms are developed. The analysis applies to block collection systems and is principally intended for systems with insufficient monopulse resolution to uniquely sort emitters on monopulse parameters alone. The analysis begins with triplet sequence search approaches and is confirmed by simulation. It is also shown that this approach generalizes to more complex deinterleaving schemes, including M-tuple search and time of arrival (TOA) difference histogramming. All cases exhibit the same basic functional form of quadratic dependence on the number of emitters, linear dependence on the collection time, and complex dependence on the pulse deletion (or dropping) probability.
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
