Super-resolution radar

DOI10.1093/IMAIAI/IAW001MaRDI QIDQ4603731zbMATH OpenOpenAlexFDO

Authors Reinhard Heckel, Veniamin I. Morgenshtern, Mahdi Soltanolkotabi

Publication date 19 February 2018

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.6272

zbMATH Keywords

sparsityradarcompressed sensingconvex programmingsuper-resolutionlinear time-varying systemline spectral estimation

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Linear systems in control theory (93C05)

Abstract: In this paper we study the identification of a time-varying linear system from its response to a known input signal. More specifically, we consider systems whose response to the input signal is given by a weighted superposition of delayed and Doppler shifted versions of the input. This problem arises in a multitude of applications such as wireless communications and radar imaging. Due to practical constraints, the input signal has finite bandwidth B, and the received signal is observed over a finite time interval of length T only. This gives rise to a delay and Doppler resolution of 1/B and 1/T. We show that this resolution limit can be overcome, i.e., we can exactly recover the continuous delay-Doppler pairs and the corresponding attenuation factors, by solving a convex optimization problem. This result holds provided that the distance between the delay-Doppler pairs is at least 2.37/B in time or 2.37/T in frequency. Furthermore, this result allows the total number of delay-Doppler pairs to be linear up to a log-factor in BT, the dimensionality of the response of the system, and thereby the limit for identifiability. Stated differently, we show that we can estimate the time-frequency components of a signal that is S-sparse in the continuous dictionary of time-frequency shifts of a random window function, from a number of measurements, that is linear up to a log-factor in S.

Recommendations

• Towards a Mathematical Theory of Super‐resolution
• Super-resolution from noisy data
• A theory of super-resolution from short-time Fourier transform measurements
• Super-resolution of positive sources: the discrete setup
• Superresolution without separation

Cites work

• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 889757 (Why is no real title available?)
• A Foundation in Digital Communication
• Atomic Norm Denoising With Applications to Line Spectral Estimation
• Compressed Sensing Off the Grid
• Hanson-Wright inequality and sub-Gaussian concentration
• High-Resolution Radar via Compressed Sensing
• Identification of Matrices Having a Sparse Representation
• Identification of Operators with Bandlimited Symbols
• Identification of Parametric Underspread Linear Systems and Super-Resolution Radar
• Identification of Sparse Linear Operators
• MUSIC for single-snapshot spectral estimation: stability and super-resolution
• Measurement of Time-Variant Linear Channels
• Measurement of random time-variant linear channels
• On the Sensitivity of Continuous-Time Noncoherent Fading Channel Capacity
• Positive trigonometric polynomials and signal processing applications
• Probing the Pareto frontier for basis pursuit solutions
• Pseudodifferential operators and Banach algebras in mobile communications
• Review of 'Theory of Random Functions and its Application to Problems of Automatic Control' (Pugachev, V. S.; 1957)
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Spectral analysis of signals. The missing data case.
• Superresolution via Sparsity Constraints
• Suprema of chaos processes and the restricted isometry property
• Templates for convex cone problems with applications to sparse signal recovery
• The MUSIC algorithm for sparse objects: a compressed sensing analysis
• The collected works of Arne Beurling. Volume 1: Complex analysis. Volume 2: Harmonic analysis. Ed. by Lennart Carleson, Paul Malliavin, John Neuberger, John Wermer
• The convex geometry of linear inverse problems
• Towards a Mathematical Theory of Super‐resolution

Cited in

(12)

• Sector imaging radar for enhanced vision
• Accuracy of reconstruction of spike-trains with two near-colliding nodes
• Bayesian approach with extended support estimation for sparse linear regression
• Super-Resolution Delay-Doppler Estimation for OFDM Passive Radar
• Beurling-type density criteria for system identification
• Direct superbubble detection
• Super-resolution for doubly-dispersive channel estimation
• Finite-Rate-of-Innovation-Sampling-Based Super-Resolution Radar Imaging
• A diffusion + wavelet-window method for recovery of super-resolution point-masses with application to single-molecule microscopy and beyond
• Refined analysis of sparse MIMO radar
• Generalized notions of sparsity and restricted isometry property. II: Applications
• Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients

Describes a project that uses

Uses Software

• SPGL1
• TFOCS

This page was built for publication: Super-resolution radar

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603731)