An approximate maximum likelihood algorithm for direction finding with diversely polarized arrays

R. Keizer, T. Bronez, J. Creekmore
{"title":"An approximate maximum likelihood algorithm for direction finding with diversely polarized arrays","authors":"R. Keizer, T. Bronez, J. Creekmore","doi":"10.1109/MILCOM.1993.408492","DOIUrl":null,"url":null,"abstract":"Improved direction-finding (DF) performance may be realized by employing a diversely polarized antenna array. However, maximum likelihood (ML) DF algorithms for such an array have greater computational complexity than those for a uniformly polarized array with the same number of antenna elements. In particular, the dimension of the nonlinear search embedded in ML estimation of azimuth and elevation is twice as large with a diversely polarized array as with a uniformly polarized array. While ML is a practical and powerful technique for small search dimensions, it rapidly becomes intractable as the dimension increases. The authors propose a new approximate maximul likelihood (AML) algorithm for reduced-complexity direction finding with diversely polarized arrays. The AML algorithm eliminates the polarization dimensions by incorporating a suboptimal but effective polarization estimate into the exact likelihood function. Optimization of the resulting approximate likelihood function requires half the search dimension of the exact likelihood function. To assess the performance of the AML algorithm, the authors develop an approach for measuring the sensitivity of the estimator to errors in the sensor covariance matrix; these errors may result from model mismatch, finite integration time, or other factors. The approach is applicable to a large class of parameter estimators that maximize a differentiable objective function of the parameters and the data. The authors derive numerically a sensitivity matrix that maps perturbations of the covariance matrix onto perturbations of the estimated directions. They analyze the sensitivity matrix to compare the performance of Schmidt's MUSIC method, the exact ML method, and the AML method for a simulated scenario with two sources of arbitrary correlation and polarization. The results show that the proposed AML algorithm typically performs as well as ML and, that both ML and AML often perform much better than MUSIC. The AML algorithm is an attractive alternative to ML, obtaining comparable DF performance from a diversely polarized array with reduced computational complexity.<<ETX>>","PeriodicalId":323612,"journal":{"name":"Proceedings of MILCOM '93 - IEEE Military Communications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of MILCOM '93 - IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1993.408492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Improved direction-finding (DF) performance may be realized by employing a diversely polarized antenna array. However, maximum likelihood (ML) DF algorithms for such an array have greater computational complexity than those for a uniformly polarized array with the same number of antenna elements. In particular, the dimension of the nonlinear search embedded in ML estimation of azimuth and elevation is twice as large with a diversely polarized array as with a uniformly polarized array. While ML is a practical and powerful technique for small search dimensions, it rapidly becomes intractable as the dimension increases. The authors propose a new approximate maximul likelihood (AML) algorithm for reduced-complexity direction finding with diversely polarized arrays. The AML algorithm eliminates the polarization dimensions by incorporating a suboptimal but effective polarization estimate into the exact likelihood function. Optimization of the resulting approximate likelihood function requires half the search dimension of the exact likelihood function. To assess the performance of the AML algorithm, the authors develop an approach for measuring the sensitivity of the estimator to errors in the sensor covariance matrix; these errors may result from model mismatch, finite integration time, or other factors. The approach is applicable to a large class of parameter estimators that maximize a differentiable objective function of the parameters and the data. The authors derive numerically a sensitivity matrix that maps perturbations of the covariance matrix onto perturbations of the estimated directions. They analyze the sensitivity matrix to compare the performance of Schmidt's MUSIC method, the exact ML method, and the AML method for a simulated scenario with two sources of arbitrary correlation and polarization. The results show that the proposed AML algorithm typically performs as well as ML and, that both ML and AML often perform much better than MUSIC. The AML algorithm is an attractive alternative to ML, obtaining comparable DF performance from a diversely polarized array with reduced computational complexity.<>
异极化阵列测向的近似最大似然算法
改进的测向性能可以通过采用不同极化的天线阵列来实现。然而,这种阵列的最大似然(ML) DF算法比具有相同天线单元数的均匀极化阵列具有更大的计算复杂度。特别是,在方位角和仰角的ML估计中嵌入的非线性搜索的维数,在异极化阵列中是均匀极化阵列的两倍大。虽然ML对于小的搜索维度是一种实用而强大的技术,但随着维度的增加,它很快变得难以处理。提出了一种新的近似最大似然(AML)算法,用于差分极化阵列的低复杂度测向。AML算法通过在精确似然函数中加入次优但有效的极化估计来消除极化维度。所得到的近似似然函数的优化只需要精确似然函数一半的搜索维数。为了评估AML算法的性能,作者开发了一种测量估计器对传感器协方差矩阵误差的灵敏度的方法;这些错误可能是由于模型不匹配、有限的积分时间或其他因素造成的。该方法适用于使参数和数据的可微目标函数最大化的大类参数估计。作者从数值上推导了一个灵敏度矩阵,它将协方差矩阵的扰动映射到估计方向的扰动上。他们分析了灵敏度矩阵,比较了Schmidt的MUSIC方法、精确ML方法和AML方法在具有任意相关和极化两个源的模拟场景中的性能。结果表明,所提出的AML算法的性能通常与ML一样好,并且ML和AML的性能通常都比MUSIC好得多。AML算法是ML的一个有吸引力的替代方案,从多样化极化阵列中获得相当的DF性能,同时降低了计算复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信