arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1704.01515cs.ITmath.IT
收藏

OMP和CoSaMP算法在DOA估计问题中的应用

On application of OMP and CoSaMP algorithms for DOA estimation problem

Abhishek Aich, P. Palanisamy

摘要:

压缩感知(CS)的显着特性使研究人员将其用于需要解欠定线性方程组的各种其他领域。一个这样的应用是在阵列信号处理的领域中,例如在信号去噪和到达方向(DOA)估计中。本文从CS恢复算法的两大类,即凸优化算法和贪婪稀疏近似算法出发,研究了贪婪稀疏近似算法在均匀线阵环境下的DOA估计问题。我们进行实证调查的行为的两个国家的最先进的贪心算法:OMP和CoSaMP。这项调查考虑到各种情况,如不同程度的噪音水平和源之间的相干性。我们进行模拟,以证明这些算法的性能,并给出了简要的分析结果。

英文摘要:

Remarkable properties of Compressed sensing (CS) has led researchers to utilize it in various other fields where a solution to an underdetermined system of linear equations is needed. One such application is in the area of array signal processing e.g. in signal denoising and Direction of Arrival (DOA) estimation. From the two prominent categories of CS recovery algorithms, namely convex optimization algorithms and greedy sparse approximation algorithms, we investigate the application of greedy sparse approximation algorithms to estimate DOA in the uniform linear array (ULA) environment. We conduct an empirical investigation into the behavior of the two state-of-the-art greedy algorithms: OMP and CoSaMP. This investigation takes into account the various scenarios such as varying degrees of noise level and coherency between the sources. We perform simulations to demonstrate the performances of these algorithms and give a brief analysis of the results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑