A New DOA Estimation Algorithm Based on PSO-Gauss-Newton

Xuerong Cui, Rongrong Zhou, Haihua Chen, Yucheng Zhang, Shibao Li, Jingyao Zhang
{"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}
引用次数: 1

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.
一种新的基于PSO-Gauss-Newton的DOA估计算法
到达方向估计是传感器阵列信号处理中的一个基本而重要的问题。为了解决这个问题,已经提出了许多算法。其中,随机极大似然(SML)算法因其较高的DOA精度而成为人们最关注的算法之一。然而,SML算法的计算复杂度很高,因此本文采用高斯-牛顿算法作为SML的解析算法。用于DOA估计的传统高斯-牛顿算法存在以下缺陷:(1)过于依赖初始值的选择;(2)容易陷入局部最优。为了解决这些缺陷,进一步降低计算复杂度,本文提出了一种新的基于PSO-Gauss-Newton的DOA估计算法。首先,在估计信号必须是非负确定的前提下,提出了有限解空间;然后,根据粒子群算法(PSO)的思想,在有限的解空间中随机分布多个散射点;每个初始粒子分别进行高斯-牛顿算法迭代。最后,通过比较各收敛值确定全局最优解。仿真结果表明,该算法的计算复杂度与MUSIC算法基本相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信