Iterative Sparse Recovery based Passive Localization in Perceptive Mobile Networks
Perceptive mobile networks (PMNs) were proposed to integrate sensing capability into current cellular networks where multiple sensing nodes (SNs) can collaboratively sense the same targets. Besides the active sensing in traditional radar systems, passive sensing based on the uplink communication signals from mobile user equipment may play a more important role in PMNs, especially for targets with weak electromagnetic wave reflection, e.g., pedestrians. However, without the properly designed active sensing waveform, passive sensing normally suffers from low signal to noise power ratio (SNR). As a result, most existing methods require a large number of data samples to achieve an accurate estimate of the covariance matrix for the received signals, based on which a power spectrum is constructed for localization purposes. Such a requirement will create heavy communication workload for PMNs because the data samples need to be transferred over the network for collaborative sensing. To tackle this issue, in this paper we leverage the sparse structure of the localization problem to reduce the searching space and propose an iterative sparse recovery (ISR) algorithm that estimates the covariance matrix and the power spectrum in an iterative manner. Experiment results show that, with very few samples in the low SNR regime, the ISR algorithm can achieve much better localization performance than existing methods.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Multidimensional orthogonal matching pursuit: theory and application to high accuracy joint localization and communication at mmWave
Greedy approaches in general, and orthogonal matching pursuit in particular, are the most commonly used sparse recovery techniques in a wide range of applications. The complexity of these approaches is highly dependent o…
Multichannel sparse recovery of complex-valued signals using Huber's criterion
In this paper, we generalize Huber's criterion to multichannel sparse recovery problem of complex-valued measurements where the objective is to find good recovery of jointly sparse unknown signal vectors from the given m…
regressionIterative Regularization with k-support Norm: An Important Complement to Sparse Recovery
Sparse recovery is ubiquitous in machine learning and signal processing. Due to the NP-hard nature of sparse recovery, existing methods are known to suffer either from restrictive (or even unknown) applicability conditio…
Efffcient Sensing Parameter Estimation with Direct Clutter Mitigation in Perceptive Mobile Networks
In this work, we investigate sensing parameter estimation in the presence of clutter in perceptive mobile networks (PMNs) that integrate radar sensing into mobile communications. Performing clutter suppression before sen…
parameter estimationSelf-STORM: Deep Unrolled Self-Supervised Learning for Super-Resolution Microscopy
The use of fluorescent molecules to create long sequences of low-density, diffraction-limited images enables highly-precise molecule localization. However, this methodology requires lengthy imaging times, which limits th…
Self-Supervised LearningSuper-Resolution