首页> 外文会议>European Signal Processing Conference >An alternating descent algorithm for the off-grid DOA estimation problem with sparsity constraints
【24h】

An alternating descent algorithm for the off-grid DOA estimation problem with sparsity constraints

机译:稀疏约束的离网DOA估计问题的交替序列算法

获取原文

摘要

In this paper, we present an iterative alternating descent algorithm for the problem of off-grid direction-of-arrival (DOA) estimation under the spatial sparsity assumption. Using a secondary dictionary we approximate the off-grid DOAs exploiting the method of Taylor expansion. In that way, we overcome the limitation of the conventional sparsity-based DOA estimation approaches that the unknown directions belong to a predefined discrete angular grid. The proposed method (SOMP-LS) alternates between a sparse recovery problem solved using the Simultaneous Orthogonal Matching Pursuit algorithm and a least squares problem. Experiments demonstrate the performance gain of the proposed method over the conventional sparsity approach and other existing off-grid DOA estimation algorithms.
机译:在本文中,我们在空间稀疏假设下呈现了一种迭代交替的下降算法,其用于空间稀疏假设下的越电网估计(DOA)估计。使用辅助词典我们近似开采泰勒扩展方法的离网DOA。以这种方式,我们克服了传统的基于稀疏性的DOA估计方法的限制,即未知方向属于预定的离散角网格。所提出的方法(SOMP-LS)在使用同时正交匹配追踪算法和最小二乘问题解决的稀疏恢复问题之间交替。实验证明了通过传统的稀疏方法和其他现有的离网DOA估计算法的提出方法的性能增益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号