Frame-building algorithm for electronically scanned array radar

Benjamin J. Slocumb; Michael E. Klusman III

doi:10.1117/12.615279

Translator Disclaimer

16 September 2005 Frame-building algorithm for electronically scanned array radar

Benjamin J. Slocumb; Michael E. Klusman III

Author Affiliations +

Proceedings Volume 5913, Signal and Data Processing of Small Targets 2005; 59130H (2005) https://doi.org/10.1117/12.615279
Event: Optics and Photonics 2005, 2005, San Diego, California, United States

Abstract

Advanced tracking algorithms such as multiple frame assignment (MFA) and multiple hypothesis tracking (MHT) require the formation of a "frame of data" to input measurements into the tracking system. A "frame" is a collection of measurements in which a target should appear at most once. For some sensor types, the frame definition is straightforward: all measurements in "one scan" of the antenna across the surveillance area compose a frame of data. However, for electronically scanned array (ESA) radar, the beam pointing is agile and the radar may point the beam in a sequence of overlapping positions. If the data from the sequence of dwells are merged into one frame, duplicate measurements may result from targets in the overlap regions. But restricting each frame to be one dwell has negative consequences because it causes an incomplete representation of closely-spaced targets within each frame. This paper presents a new algorithm for the formation of frames of data for ESA radar systems. The algorithm uses a series of gating tests to determine which radar dwells may be merged together. For overlapping beams, a selection technique is developed that minimizes the number of redundant measurements that appear in any given frame. A summary of tracking performance results attained when using the algorithm is provided.

Citation Download Citation

Benjamin J. Slocumb and Michael E. Klusman III "Frame-building algorithm for electronically scanned array radar", Proc. SPIE 5913, Signal and Data Processing of Small Targets 2005, 59130H (16 September 2005); https://doi.org/10.1117/12.615279

ACCESS THE FULL ARTICLE