{"title":"一种新的基于PSO-Gauss-Newton的DOA估计算法","authors":"Xuerong Cui, Rongrong Zhou, Haihua Chen, Yucheng Zhang, Shibao Li, Jingyao Zhang","doi":"10.1109/icicn52636.2021.9673931","DOIUrl":null,"url":null,"abstract":"Direction-of-Arrival (DOA) estimation is a basic and important problem in sensor array signal processing. In order to solve this problem, many algorithms have been proposed. Among them, the Stochastic Maximum Likelihood (SML) algorithm has become one of the most concerned algorithms because of its high DOA accuracy. However, the computational complexity of SML algorithm is very high, so Gauss-Newton algorithm is used as the analytical algorithm of SML in this paper. The traditional Gauss-Newton algorithm used in DOA estimation has some defects: (1) over reliance on the choice of initial values (2) fall into local optimum easily. In order to solve these defects and further reduce the computational complexity, this paper proposes a new DOA estimation algorithm based on PSO-Gauss-Newton. First of all, a limited solution space is proposed based on the precondition that the estimated signal must be non-negative definite. Then, according to the idea of PSO(Particle Swarm Optimization) algorithm, multiple scattering points are randomly distributed in the limited solution space. Each initial particle performs Gauss-Newton algorithm iteration separately. Finally, the global optimal solution is determined by comparison of all the convergence values. Simulation results the computational complexity of this algorithm is almost comparable to that of MUSIC algorithm.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New DOA Estimation Algorithm Based on PSO-Gauss-Newton\",\"authors\":\"Xuerong Cui, Rongrong Zhou, Haihua Chen, Yucheng Zhang, Shibao Li, Jingyao Zhang\",\"doi\":\"10.1109/icicn52636.2021.9673931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Direction-of-Arrival (DOA) estimation is a basic and important problem in sensor array signal processing. In order to solve this problem, many algorithms have been proposed. Among them, the Stochastic Maximum Likelihood (SML) algorithm has become one of the most concerned algorithms because of its high DOA accuracy. However, the computational complexity of SML algorithm is very high, so Gauss-Newton algorithm is used as the analytical algorithm of SML in this paper. The traditional Gauss-Newton algorithm used in DOA estimation has some defects: (1) over reliance on the choice of initial values (2) fall into local optimum easily. In order to solve these defects and further reduce the computational complexity, this paper proposes a new DOA estimation algorithm based on PSO-Gauss-Newton. First of all, a limited solution space is proposed based on the precondition that the estimated signal must be non-negative definite. Then, according to the idea of PSO(Particle Swarm Optimization) algorithm, multiple scattering points are randomly distributed in the limited solution space. Each initial particle performs Gauss-Newton algorithm iteration separately. Finally, the global optimal solution is determined by comparison of all the convergence values. Simulation results the computational complexity of this algorithm is almost comparable to that of MUSIC algorithm.\",\"PeriodicalId\":231379,\"journal\":{\"name\":\"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icicn52636.2021.9673931\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icicn52636.2021.9673931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New DOA Estimation Algorithm Based on PSO-Gauss-Newton
Direction-of-Arrival (DOA) estimation is a basic and important problem in sensor array signal processing. In order to solve this problem, many algorithms have been proposed. Among them, the Stochastic Maximum Likelihood (SML) algorithm has become one of the most concerned algorithms because of its high DOA accuracy. However, the computational complexity of SML algorithm is very high, so Gauss-Newton algorithm is used as the analytical algorithm of SML in this paper. The traditional Gauss-Newton algorithm used in DOA estimation has some defects: (1) over reliance on the choice of initial values (2) fall into local optimum easily. In order to solve these defects and further reduce the computational complexity, this paper proposes a new DOA estimation algorithm based on PSO-Gauss-Newton. First of all, a limited solution space is proposed based on the precondition that the estimated signal must be non-negative definite. Then, according to the idea of PSO(Particle Swarm Optimization) algorithm, multiple scattering points are randomly distributed in the limited solution space. Each initial particle performs Gauss-Newton algorithm iteration separately. Finally, the global optimal solution is determined by comparison of all the convergence values. Simulation results the computational complexity of this algorithm is almost comparable to that of MUSIC algorithm.