Complexity Analysis of Heuristic Pulse Interleaving Algorithms for Multi-Target Tracking with Multiple Simultaneous Receive Beams
classification
💻 cs.SY
cs.SY
keywords
pulsealgorithmsbeamsheuristicinterleavedmulti-targetmultipleproblems
read the original abstract
This paper presents heuristic algorithms for interleaved pulse scheduling problems on multi-target tracking in pulse Doppler phased array radars that can process multiple simultaneous received beams. The interleaved pulse scheduling problems for element and subarray level digital beamforming architectures are formulated as the same integer program and the asymptotic time complexities of the algorithms are analyzed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.