鲁棒l_1惩罚DOA估计
A robust l_1 penalized DOA estimator
摘要:
SPS-LASSO最近被引入作为复值LASSO问题中正则化参数选择问题的解决方案。然而,由于凸优化算法对网格大小的依赖性和每次迭代所需的多项式时间,以及在低噪声条件下的不足,限制了其在波达方向(DOA)估计中的性能。这项工作提出了应用LASSO的方法,没有网格大小限制且复杂性较低。正如我们所示的模拟,所提出的方法松散的最大似然比(ML)估计,这需要一个组合搜索相比,可以忽略不计的性能。我们还表明,模拟相比,ML的实际实现,所提出的技术是不太敏感的源功率差。
英文摘要:
The SPS-LASSO has recently been introduced as a solution to the problem of regularization parameter selection in the complex-valued LASSO problem. Still, the dependence on the grid size and the polynomial time of performing convex optimization technique in each iteration, in addition to the deficiencies in the low noise regime, confines its performance for Direction of Arrival (DOA) estimation. This work presents methods to apply LASSO without grid size limitation and with less complexity. As we show by simulations, the proposed methods loose a negligible performance compared to the Maximum Likelihood (ML) estimator, which needs a combinatorial search We also show by simulations that compared to practical implementations of ML, the proposed techniques are less sensitive to the source power difference.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。