Complexity Analysis of Heuristic Pulse Interleaving Algorithms for Multi-Target Tracking with Multiple Simultaneous Receive Beams

TL;DR

This paper analyzes the complexity of heuristic pulse interleaving algorithms for multi-target radar tracking with multiple simultaneous receive beams, providing insights into their computational efficiency.

Contribution

It introduces heuristic algorithms for pulse scheduling in multi-beam radar systems and analyzes their asymptotic time complexities.

Findings

Algorithms formulated as integer programs

Asymptotic complexity analysis provided

Applicable to element and subarray level beamforming

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.