Adaptive Clutter Suppression via Convex Optimization

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: He, Yifan, Kearney, Griffin, Fardad, Makan
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917178292305920
author He, Yifan
Kearney, Griffin
Fardad, Makan
author_facet He, Yifan
Kearney, Griffin
Fardad, Makan
contents Passive and bistatic radar systems are often limited by strong clutter and direct-path interference that mask weak moving targets. Conventional cancellation methods such as the extensive cancellation algorithm require careful tuning and can distort the delay-Doppler response. This paper introduces a convex optimization framework that adaptively synthesizes per-cell delay-Doppler filters to suppress clutter while preserving the canonical cross-ambiguity function (CAF). The approach formulates a quadratic program that minimizes distortion of the CAF surface subject to linear clutter-suppression constraints, eliminating the need for a separate cancellation stage. Monte Carlo simulations using common communication waveforms demonstrate strong clutter suppression, accurate CFAR calibration, and major detection-rate gains over the classical CAF. The results highlight a scalable, CAF-faithful method for adaptive clutter mitigation in passive radar.
format Preprint
id arxiv_https___arxiv_org_abs_2512_24889
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Adaptive Clutter Suppression via Convex Optimization
He, Yifan
Kearney, Griffin
Fardad, Makan
Optimization and Control
Passive and bistatic radar systems are often limited by strong clutter and direct-path interference that mask weak moving targets. Conventional cancellation methods such as the extensive cancellation algorithm require careful tuning and can distort the delay-Doppler response. This paper introduces a convex optimization framework that adaptively synthesizes per-cell delay-Doppler filters to suppress clutter while preserving the canonical cross-ambiguity function (CAF). The approach formulates a quadratic program that minimizes distortion of the CAF surface subject to linear clutter-suppression constraints, eliminating the need for a separate cancellation stage. Monte Carlo simulations using common communication waveforms demonstrate strong clutter suppression, accurate CFAR calibration, and major detection-rate gains over the classical CAF. The results highlight a scalable, CAF-faithful method for adaptive clutter mitigation in passive radar.
title Adaptive Clutter Suppression via Convex Optimization
topic Optimization and Control
url https://arxiv.org/abs/2512.24889