8 research outputs found
Sparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors
While single measurement vector (SMV) models have been widely studied in
signal processing, there is a surging interest in addressing the multiple
measurement vectors (MMV) problem. In the MMV setting, more than one
measurement vector is available and the multiple signals to be recovered share
some commonalities such as a common support. Applications in which MMV is a
naturally occurring phenomenon include online streaming, medical imaging, and
video recovery. This work presents a stochastic iterative algorithm for the
support recovery of jointly sparse corrupted MMV. We present a variant of the
Sparse Randomized Kaczmarz algorithm for corrupted MMV and compare our proposed
method with an existing Kaczmarz type algorithm for MMV problems. We also
showcase the usefulness of our approach in the online (streaming) setting and
provide empirical evidence that suggests the robustness of the proposed method
to the distribution of the corruption and the number of corruptions occurring.Comment: 13 pages, 6 figure
Interference Removal for Radar/Communication Co-existence: the Random Scattering Case
In this paper we consider an un-cooperative spectrum sharing scenario,
wherein a radar system is to be overlaid to a pre-existing wireless
communication system. Given the order of magnitude of the transmitted powers in
play, we focus on the issue of interference mitigation at the communication
receiver. We explicitly account for the reverberation produced by the
(typically high-power) radar transmitter whose signal hits scattering centers
(whether targets or clutter) producing interference onto the communication
receiver, which is assumed to operate in an un-synchronized and un-coordinated
scenario. We first show that receiver design amounts to solving a non-convex
problem of joint interference removal and data demodulation: next, we introduce
two algorithms, both exploiting sparsity of a proper representation of the
interference and of the vector containing the errors of the data block. The
first algorithm is basically a relaxed constrained Atomic Norm minimization,
while the latter relies on a two-stage processing structure and is based on
alternating minimization. The merits of these algorithms are demonstrated
through extensive simulations: interestingly, the two-stage alternating
minimization algorithm turns out to achieve satisfactory performance with
moderate computational complexity