{"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}
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.