Low-Complexity Algorithms for Low Rank Clutter Parameters Estimation in Radar Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Signal Processing Année : 2016

Low-Complexity Algorithms for Low Rank Clutter Parameters Estimation in Radar Systems

Résumé

This paper addresses the problem of the clutter subspace projector estimation in the context of a disturbance composed of a low rank heterogeneous (Compound Gaussian) clutter and white Gaussian noise. In such a context, adaptive processing based on an estimated orthogonal projector onto the clutter subspace (instead of an estimated covariance matrix) requires less samples than classical methods. The clutter subspace estimate is usually derived from the eigenvalue decomposition of a covariance matrix estimate. However, it has been previously shown that a direct maximum likelihood estimator of the clutter subspace projector can be obtained for the considered context. In this paper, we derive two algorithms based on the block majorization-minimization framework to reach this estimator. These algorithms are shown to be computationally faster than the state of the art, with guaranteed convergence. Finally, the performance of the related estimators is illustrated on realistic Space Time Adaptive Processing for airborne radar simulations.
Fichier principal
Vignette du fichier
low rank estimation_draft.pdf (464.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01377663 , version 1 (26-02-2020)

Identifiants

Citer

Ying Sun, Arnaud Breloy, Babu Prabhu, Daniel P. Palomar, Frédéric Pascal, et al.. Low-Complexity Algorithms for Low Rank Clutter Parameters Estimation in Radar Systems. IEEE Transactions on Signal Processing, 2016, 64 (8), pp.1986-1998. ⟨10.1109/TSP.2015.2512535⟩. ⟨hal-01377663⟩
325 Consultations
203 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More