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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Processing throughput estimation for radar intercept receivers


    Contributors:
    Maier, M.W. (author)


    Publication date :

    1998-01-01


    Size :

    900052 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Radio Altimeters and Intercept Radar

    G. I. Ermolaev / A. G. Gamulin / I. L. Prager et al. | NTIS | 1968