348 research outputs found
Localization of DOA trajectories -- Beyond the grid
The direction of arrival (DOA) estimation algorithms are crucial in
localizing acoustic sources. Traditional localization methods rely on
block-level processing to extract the directional information from multiple
measurements processed together. However, these methods assume that DOA remains
constant throughout the block, which may not be true in practical scenarios.
Also, the performance of localization methods is limited when the true
parameters do not lie on the parameter search grid. In this paper we propose
two trajectory models, namely the polynomial and bandlimited trajectory models,
to capture the DOA dynamics. To estimate trajectory parameters, we adopt two
gridless algorithms: i) Sliding Frank-Wolfe (SFW), which solves the Beurling
LASSO problem and ii) Newtonized Orthogonal Matching Pursuit (NOMP), which
improves over OMP using cyclic refinement. Furthermore, we extend our analysis
to include wideband processing. The simulation results indicate that the
proposed trajectory localization algorithms exhibit improved performance
compared to grid-based methods in terms of resolution, robustness to noise, and
computational efficiency
OMP-type Algorithm with Structured Sparsity Patterns for Multipath Radar Signals
A transmitted, unknown radar signal is observed at the receiver through more
than one path in additive noise. The aim is to recover the waveform of the
intercepted signal and to simultaneously estimate the direction of arrival
(DOA). We propose an approach exploiting the parsimonious time-frequency
representation of the signal by applying a new OMP-type algorithm for
structured sparsity patterns. An important issue is the scalability of the
proposed algorithm since high-dimensional models shall be used for radar
signals. Monte-Carlo simulations for modulated signals illustrate the good
performance of the method even for low signal-to-noise ratios and a gain of 20
dB for the DOA estimation compared to some elementary method
Subspace Methods for Joint Sparse Recovery
We propose robust and efficient algorithms for the joint sparse recovery
problem in compressed sensing, which simultaneously recover the supports of
jointly sparse signals from their multiple measurement vectors obtained through
a common sensing matrix. In a favorable situation, the unknown matrix, which
consists of the jointly sparse signals, has linearly independent nonzero rows.
In this case, the MUSIC (MUltiple SIgnal Classification) algorithm, originally
proposed by Schmidt for the direction of arrival problem in sensor array
processing and later proposed and analyzed for joint sparse recovery by Feng
and Bresler, provides a guarantee with the minimum number of measurements. We
focus instead on the unfavorable but practically significant case of
rank-defect or ill-conditioning. This situation arises with limited number of
measurement vectors, or with highly correlated signal components. In this case
MUSIC fails, and in practice none of the existing methods can consistently
approach the fundamental limit. We propose subspace-augmented MUSIC (SA-MUSIC),
which improves on MUSIC so that the support is reliably recovered under such
unfavorable conditions. Combined with subspace-based greedy algorithms also
proposed and analyzed in this paper, SA-MUSIC provides a computationally
efficient algorithm with a performance guarantee. The performance guarantees
are given in terms of a version of restricted isometry property. In particular,
we also present a non-asymptotic perturbation analysis of the signal subspace
estimation that has been missing in the previous study of MUSIC.Comment: submitted to IEEE transactions on Information Theory, revised versio
- …