arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.0674cs.ITmath.IT
收藏

部分相关噪声中基于低秩/稀疏矩阵分解的DOA估计

DOA Estimation in Partially Correlated Noise Using Low-Rank/Sparse Matrix Decomposition

Mohammadreza Malek-Mohammadi, Magnus Jansson, Arash Owrang, Ali Koochakzadeh, Massoud Babaie-Zadeh

摘要:

本文研究了部分相关噪声环境中噪声协方差矩阵稀疏的波达方向估计问题。稀疏噪声协方差矩阵是由多个相距甚远的子阵组成的稀疏阵列的一种常用模型。由于子阵列中的传感器之间的元件间间距很小,所以子阵列中的噪声一般是空间相关的,而由于子阵列之间的距离很大,它们之间的噪声是不相关的。因此,这样的阵列的噪声协方差矩阵具有块对角结构,其确实是稀疏的。此外,在一个普通的非稀疏阵列,由于相邻的传感器之间的距离很小,有相邻的传感器之间的噪声耦合,而人们可以假设,非相邻的传感器具有空间不相关的噪声,这使得阵列噪声协方差矩阵稀疏。利用低秩/稀疏矩阵分解、矩阵完备化和稀疏表示中的一些最近可用的工具,我们提出了一种新的方法,该方法可以在上述部分相关噪声中解决可能相关甚至相干的源。特别是,当源不相关时,我们的方法涉及求解二阶锥规划(SOCP),如果它们相关或相干,则需要求解计算上更难的凸规划。我们证明了该算法的有效性,通过数值模拟和比较的Cramer-Rao界(CRB)。

英文摘要:

We consider the problem of direction-of-arrival (DOA) estimation in unknown partially correlated noise environments where the noise covariance matrix is sparse. A sparse noise covariance matrix is a common model for a sparse array of sensors consisted of several widely separated subarrays. Since interelement spacing among sensors in a subarray is small, the noise in the subarray is in general spatially correlated, while, due to large distances between subarrays, the noise between them is uncorrelated. Consequently, the noise covariance matrix of such an array has a block diagonal structure which is indeed sparse. Moreover, in an ordinary nonsparse array, because of small distance between adjacent sensors, there is noise coupling between neighboring sensors, whereas one can assume that nonadjacent sensors have spatially uncorrelated noise which makes again the array noise covariance matrix sparse. Utilizing some recently available tools in low-rank/sparse matrix decomposition, matrix completion, and sparse representation, we propose a novel method which can resolve possibly correlated or even coherent sources in the aforementioned partly correlated noise. In particular, when the sources are uncorrelated, our approach involves solving a second-order cone programming (SOCP), and if they are correlated or coherent, one needs to solve a computationally harder convex program. We demonstrate the effectiveness of the proposed algorithm by numerical simulations and comparison to the Cramer-Rao bound (CRB).

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

↑