到达角估计的随机优化方法

H. Hoang, T. Koklu, B. W. Kwan, Ming Yu
{"title":"到达角估计的随机优化方法","authors":"H. Hoang, T. Koklu, B. W. Kwan, Ming Yu","doi":"10.1109/SARNOF.2007.4567312","DOIUrl":null,"url":null,"abstract":"The difficulty for accurate determination of the angles of arrival (AOA) of signals arises from the optimization of likelihood functions of high dimension. Usually, a gradient-based technique is employed to find the optimum of the function. However, this method requires heavy computational work and the differentiability of the likelihood function. This paper presents two gradient-free methods: One is based on the Markov Chain Monte Carlo (MCMC) method and the other applies particle swarm optimization (PSO) to estimate the AOA. The main difference between the two methods is that the PSO-based method exploits multiple random search paths, while the MCMC-based method only employs undirected random search along a single path. A practical search space is also proposed for the case of symmetric objective functions to reduce the computational work in a manner that the traditional PSO stopping criteria is still applicable. To illustrate these techniques, a uniform linear antenna array is considered under the influence of additive complex Gaussian noise.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Stochastic optimization methods for angle of arrival estimation\",\"authors\":\"H. Hoang, T. Koklu, B. W. Kwan, Ming Yu\",\"doi\":\"10.1109/SARNOF.2007.4567312\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The difficulty for accurate determination of the angles of arrival (AOA) of signals arises from the optimization of likelihood functions of high dimension. Usually, a gradient-based technique is employed to find the optimum of the function. However, this method requires heavy computational work and the differentiability of the likelihood function. This paper presents two gradient-free methods: One is based on the Markov Chain Monte Carlo (MCMC) method and the other applies particle swarm optimization (PSO) to estimate the AOA. The main difference between the two methods is that the PSO-based method exploits multiple random search paths, while the MCMC-based method only employs undirected random search along a single path. A practical search space is also proposed for the case of symmetric objective functions to reduce the computational work in a manner that the traditional PSO stopping criteria is still applicable. To illustrate these techniques, a uniform linear antenna array is considered under the influence of additive complex Gaussian noise.\",\"PeriodicalId\":293243,\"journal\":{\"name\":\"2007 IEEE Sarnoff Symposium\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2007.4567312\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2007.4567312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

高维似然函数的优化是确定信号到达角的难点。通常采用基于梯度的方法来求函数的最优值。然而,这种方法需要大量的计算量和似然函数的可微性。本文提出了两种无梯度的方法:一种是基于马尔可夫链蒙特卡罗(MCMC)方法,另一种是应用粒子群优化(PSO)方法来估计AOA。两种方法的主要区别在于基于pso的方法利用了多个随机搜索路径,而基于mcmc的方法只采用了沿着单个路径的无向随机搜索。针对对称目标函数的情况,提出了一种实用的搜索空间,在传统粒子群停止准则仍然适用的情况下减少计算量。为了说明这些技术,考虑了加性复高斯噪声影响下的均匀线性天线阵列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic optimization methods for angle of arrival estimation
The difficulty for accurate determination of the angles of arrival (AOA) of signals arises from the optimization of likelihood functions of high dimension. Usually, a gradient-based technique is employed to find the optimum of the function. However, this method requires heavy computational work and the differentiability of the likelihood function. This paper presents two gradient-free methods: One is based on the Markov Chain Monte Carlo (MCMC) method and the other applies particle swarm optimization (PSO) to estimate the AOA. The main difference between the two methods is that the PSO-based method exploits multiple random search paths, while the MCMC-based method only employs undirected random search along a single path. A practical search space is also proposed for the case of symmetric objective functions to reduce the computational work in a manner that the traditional PSO stopping criteria is still applicable. To illustrate these techniques, a uniform linear antenna array is considered under the influence of additive complex Gaussian noise.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信