.png){kind=icon}
.png){kind=icon}
Return
Coherent Source Enumeration With Compact ULAs
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2025.3593121.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Source enumeration typically relies on subspace-based techniques that require accurate separation of signal and noise subspaces. However, prior works do not address coherent sources in small uniform linear arrays, where ambiguities arise in the spatial spectrum. We address this by decomposing the forward-backward smoothed covariance matrix into a sum of a rank-constrained Toeplitz matrix and a diagonal matrix with non-negative entries representing the signal and noise subspaces, respectively. The resulting non-convex optimization problem is solved by proposing <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</i>oeplitz <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a</i>pproach for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</i>ank-based tar<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>et <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</i>s<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>imation (TARgEt) that employs the alternating direction method of multipliers. Numerical results on both synthetic and real-world datasets demonstrate the effectiveness and robustness of TARgEt over the state-of-the-art.
Keywords:
Elliptopes
rank constraint
smoothing
source enumeration
ULA
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W