Journal Article10.1109/TSP.2018.2878545
High Resolution Compressed Sensing Radar Using Difference Set Codes
13
TL;DR: In this article, a sub-Nyquist sampling method based on difference sets (DS) was proposed to create dictionaries with highly incoherent atoms, and the coherence of the dictionary reached the Welch minimum bound.
read more
Abstract: In this paper, we consider compressive sensing (CS)-based recovery of delays and Doppler frequencies of targets in high resolution radars. We propose a novel sub-Nyquist sampling method in the Fourier domain based on difference sets (DS), called DS-sampling, to create dictionaries with highly incoherent atoms. The coherence of the dictionary reaches the Welch minimum bound if the DS-sampling is employed. This property let us to implement sub-Nyquist high resolution radars with minimum number of samples.1 Two low-complexity recovery methods are developed and sufficient condition of target recovery with specific resolution obtained theoretically for noisy and noiseless conditions. We also propose a new waveform, called DS-frequency coded modulated waveform, to boost the recovery performance of the sub-Nyquist radar in noisy environments. The proposed method solves some of the common problems in many CS-based radars and overcome disadvantages of the conventional Nyquist processing (i.e., matched filtering) in high resolution radar systems. The proposed method allows us to design sub-Nyquist radars, which require less than $\text{2}{\%}$ of Nyquist samples and recover targets without resolution degradation in comparison to the conventional Nyquist processing.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Communication-Efficient Federated Learning Based on Compressed Sensing
TL;DR: Two new FL algorithms based on compressed sensing referred to as the CS-FL algorithm and the 1-bit CS- FL algorithm are proposed, both of which compress the upstream and downstream data while communicating between the clients and the central server.
80
Compressed-Domain Detection and Estimation for Colocated MIMO Radar
Ehsan Tohidi,Alireza Hariri,Hamid Behroozi,Mohammad Mahdi Nayebi,Geert Leus,Athina P. Petropulu +5 more
TL;DR: The proposed approach enables an eightfold reduction of the sample complexity in some settings as compared to a conventional compressed sensing (CS) MIMO radar, thus enabling faster target detection.
Temperature Field Reconstruction Method for Acoustic Tomography Based on Multi-Dictionary Learning
Yuan Wei,Hua Yan,Ying Gang Zhou +2 more
TL;DR: In this paper , a reconstruction algorithm based on multi-dictionary learning (MDL) was proposed to improve the reconstruction quality of acoustic tomography for complex temperature fields, which improved the under-determination of the inverse problem by the sparse representation of the sound slowness signal (i.e., reciprocal of sound velocity).
A two-stage classification algorithm for radar targets based on compressive detection
TL;DR: Algorithms are proposed to address the radar target detection problem of compressed sensing under the conditions of a low signal-to-noise ratio (SNR) and a low noise ratio (SCR) echo signal with a two-stage classification for radar targets based on compressive detection without signal reconstruction and a support vector data description one-class classifier.
•Posted Content
Compressed-Domain Detection and Estimation for Colocated MIMO Radar.
Ehsan Tohidi,Alireza Hariri,Hamid Behroozi,Mohammad Mahdi Nayebi,Geert Leus,Athina P. Petropulu +5 more
TL;DR: In this article, the authors proposed a compressed domain signal processing (CSP) multiple input multiple output (MIMO) radar, a MIMO radar approach that achieves substantial sample complexity reduction by exploiting the idea of CSP.
References
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
•Book
Introduction to Radar Systems
Merrill I. Skolnik
- 01 Jan 1962
TL;DR: This chapter discusses Radar Equation, MTI and Pulse Doppler Radar, and Information from Radar Signals, as well as Radar Antenna, Radar Transmitters and Radar Receiver.
7.5K
Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case
Joel A. Tropp,Anna C. Gilbert +1 more
- 01 Aug 2007
TL;DR: In this paper, a greedy algorithm called Orthogonal Matching Pursuit (OMP) was proposed to recover a signal with m nonzero entries in dimension 1 given O(m n d) random linear measurements of that signal.
Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition
Y.C. Pati,R. Rezaiifar,Perinkulam S. Krishnaprasad +2 more
- 01 Nov 1993
TL;DR: A modification to the matching pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual at every step and thereby leads to improved convergence is proposed.
Greed is good: algorithmic results for sparse approximation
TL;DR: This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries and develops a sufficient condition under which OMP can identify atoms from an optimal approximation of a nonsparse signal.