Processing throughput estimation for radar intercept receivers

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 pa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on aerospace and electronic systems 1998-01, Vol.34 (1), p.84-92
Main Author: Maier, M.W.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Analytical models
Computational modeling
Computer architecture
Frequency
Radar antennas
Radar detection
Signal processing algorithms
Sorting
Throughput
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9251
1557-9603
DOI:10.1109/7.640265