Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sparsity-Driven Moving Target Detection in Distributed Multistatic FMCW Radars (2001.00458v1)

Published 2 Jan 2020 in eess.SP

Abstract: We investigate the problem of sparse target detection from widely distributed multistatic \textit{Frequency Modulated Continuous Wave} (FMCW) radar systems (using chirp modulation). Unlike previous strategies (\emph{e.g.}, developed for FMCW or distributed multistatic radars), we propose a generic framework that scales well in terms of computational complexity for high-resolution space-velocity grid. Our approach assumes that \emph{(i)} the target signal is sparse in a discrete space-velocity domain, hence allowing for non-static target detection, and \emph{(ii)} the resulting multiple baseband radar signals share a common support. By simplifying the representation of the FMCW radar signals, we propose a versatile scheme balancing complexity and detection accuracy. In particular, we design a low-complexity, factorized alternative for the Matching Pursuit algorithm leveraging this simplified model, as well as an iterative methodology to compensate for the errors caused by the model simplifications. Extensive Monte-Carlo simulations of a K-band radar system show that our method achieves a fast estimation of moving target's parameters on dense grids, with controllable accuracy, and reaching state-of-the-art performances compared to previous sparsity-driven approaches.

Citations (2)

Summary

We haven't generated a summary for this paper yet.