【24h】

A JPSO algorithm for SML estimation of DOA

机译:用于DOA的SML估计的JPSO算法

获取原文

摘要

The estimation of DOA is an important problem in sensor array signal processing and its industrial applications. Among all the solving techniques for DOA, the Stochastic Maximum Likelihood (SML) algorithm is well-known for its high accuracy of DOA estimation. However, its computational complexity is very high because a multi-dimensional nonlinear optimization problem is involved. The Particle Swarm Optimization (PSO) algorithm is considered as a rather efficient way for multi-dimensional non-linear optimization problems in DOA estimation. However Conventional PSO algorithm usually needs a large number of particles and the iteration number is also a litter high when all the particles converge. As a result, the computational complexity is still a litter high. This paper proposes a low complexity Joint-PSO (JPSO) algorithm for SML estimation. It uses the solution of Estimation of Signal Parameters via Rotational Invariance Techniques (ESPRIT) and stochastic Cramer-Rao bound (CRB) to determine a novel initialization space. In this case, smaller number of particles and less iteration number are required. Therefore, the computational complexity can be greatly reduced. Simulation results are also shown to demonstrate the validity of proposed JPSO algorithm.
机译:DOA的估计是传感器阵列信号处理及其工业应用中的重要问题。在所有DOA求解技术中,随机最大似然(SML)算法以其DOA估计的高精度而闻名。但是,由于涉及多维非线性优化问题,因此其计算复杂度很高。对于DOA估计中的多维非线性优化问题,粒子群优化(PSO)算法被认为是一种相当有效的方法。但是,传统的PSO算法通常需要大量的粒子,并且当所有粒子都收敛时,迭代次数也很高。结果,计算复杂度仍然很高。本文提出了一种用于SML估计的低复杂度联合PSO(JPSO)算法。它使用通过旋转不变技术(ESPRIT)和随机Cramer-Rao界(CRB)估计信号参数的解决方案来确定一种新颖的初始化空间。在这种情况下,需要较少的粒子数和较少的迭代数。因此,可以大大降低计算复杂度。仿真结果也证明了所提出的JPSO算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号