2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDSAM-9.2
Paper Title SPARSE FACTORIZATION-BASED DETECTION OF OFF-THE-GRID MOVING TARGETS USING FMCW RADARS
Authors Gilles Monnoyer de Galland, Thomas Feuillen, Luc Vandendorpe, Laurent Jacques, Université catholique de Louvain, Belgium
SessionSAM-9: Detection and Classification
LocationGather.Town
Session Time:Thursday, 10 June, 16:30 - 17:15
Presentation Time:Thursday, 10 June, 16:30 - 17:15
Presentation Poster
Topic Sensor Array and Multichannel Signal Processing: [SAM-CSSM] Compressed sensing and sparse modeling
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract In this paper, we investigate the application of continuous sparse signal reconstruction algorithms for the estimation of the ranges and speeds of multiple moving targets using an FMCW radar. Conventionally, to be reconstructed, continuous sparse signals are approximated by a discrete representation. This discretization of the signal's parameter domain leads to mismatches with the actual signal. While increasing the grid density mitigates these errors, it dramatically increases the algorithmic complexity of the reconstruction. To overcome this issue, we propose a fast greedy algorithm for off-the-grid detection of multiple moving targets. This algorithm extends existing continuous greedy algorithms to the framework of factorized sparse representations of the signals. This factorized representation is obtained from simplifications of the radar signal model which, up to a model mismatch, strongly reduces the dimensionality of the problem. Monte-Carlo simulations of a K-band radar system validate the ability of our method to produce more accurate estimations with less computation time than the on-the-grid methods and than methods based on non-factorized representations.