THIRD
ANNUAL 
PRIME Polynomial

Gary F. Hatke and Keith W. Forsythe MIT Lincoln Laboratory 244 Wood Street Lexington, MA 021739108 email: hatke@ll.mit.edu , forsythe@ll.mit.edu Abstract Polynomial rooting techniques for efficient highresolution estimation of direction parameters from linear arrays are well documented in the literature. These techniques are limited, however, to cases of estimating a scalar direction parameter (say, either azimuth or elevation). This presentation introduces a methodology for extending the polynomial rooting philosophy to the case of multidimensional arrays, which will be used to estimate jointly both azimuth and elevation parameters of the signal directions. It is shown via simulation that the resolution capabilities of the Polynomial Root Intersection for Multidimensional Estimation (PRIME) class of algorithms is superior to the spectral algorithms they supplant, and that the variance of the direction estimates is equal to that of the corresponding spectral algorithms. It is shown analytically that the mean squared error of the PRIME estimates can be asymptotically equal to that of the spectral MUSIC estimates. Finally, some extensions are discussed. ^{1 }This work was sponsored by the Advanced Research Projects Agency and the Department of the Air Force under contract number F1962895C0002. 
Direct comments and questions to: webmaster@ll.mit.edu
© MIT Lincoln Laboratory. All rights reserved.