By Topic

A least square algorithm with covariance weighting for computing the translational and rotational errors between two radar sites

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sudano, J.J. ; Gen. Electr. Co., Moorestown, NJ, USA

Sharing of radar track data between sites greatly enhances the radar coverage at very little cost in assets. By linking all the radars in a battlefield or a task force, a complete picture can be realized that supports faster response time and is robust against jamming, ECM, and DECM. In order for these benefits to be realized a good algorithm must transform tracks between sites without introducing large errors. This article describes a novel least square algorithm with covariance weighting (LSC) for computing translational and rotational (gridlock) errors between two radar sites that share common tracks. Simulations show that this technique reduces the gridlock errors by a factor of six over least squares algorithms with no covariance weighting

Published in:

Aerospace and Electronics Conference, 1993. NAECON 1993., Proceedings of the IEEE 1993 National

Date of Conference:

24-28 May 1993