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.
Processing throughput estimation for radar intercept receivers
IEEE Transactions on Aerospace and Electronic Systems ; 34 , 1 ; 84-92
01.01.1998
900052 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Processing Throughput Estimation for Radar Intercept Receivers
Online Contents | 1998
|Radio Altimeters and Intercept Radar
NTIS | 1968
|The Microelectronic Radar Intercept Calculator
IEEE | 1966
|Some considerations for low probability of intercept radar
Tema Archiv | 1983
|