This paper proposes a new approximation of the theoretical signal to interference plus noise ratio (SINR) loss of the low-rank (LR) adaptive filter built on the eigenvalue decomposition of the sample covariance matrix. This new result is based on an analysis in the large dimensional regime, i.e., when the size and the number of data tend to infinity at the same rate. Compared to previous works, this new derivation allows us to measure the quality of the adaptive filter near the LR contribution. Moreover, we propose a new LR adaptive filter and we also derive its SINR loss approximation in a large dimensional regime. We validate these results on a jamming application and test their robustness in a multiple input multiple output space time adaptive processing application where the data size is large.

When a possible target is embedded in a low-rank (LR) Gaussian clutter (which is contained in a low-dimensional subspace) plus a white Gaussian noise, the detection process can be performed by applying the LR adaptive normalized matched filter (LR-ANMF), which is a function of the estimated projector. In a recent work, we derived an approximate distribution of the LR-ANMF under the H-0 hypothesis by using a restrictive hypothesis (the target has to be orthogonal to the clutter subspace). In this paper, we propose to determine new approximations of the Pfa and the Pd of the LR-ANMF by relaxing this restrictive hypothesis. This new derivation is based on results concerning the convergence in a large dimension regime of quadratic forms. Simulations validate our result, in particular, when the tested signal is close to the clutter subspace.

Partant du constat que dans plus en plus d'applications, la taille des données à traiter augmente, il semble pertinent d'utiliser des outils appropriés tels que la théorie des matrices aléatoires dans le régime en grandes dimensions. Plus particulièrement, dans les applications de traitement d'antenne et radar spécifiques STAP et MIMO-STAP, nous nous sommes intéressés au traitement d'un signal d'intérêt corrompu par un bruit additif composé d'une partie dite rang faible et d'un bruit blanc gaussien. Ainsi l'objet de cette thèse est d'étudier dans le régime en grandes dimensions la détection et le filtrage dit rang faible (fonction de projecteurs) pour le traitement d'antenne en utilisant la théorie des matrices aléatoires.La thèse propose alors trois contributions principales, dans le cadre de l'analyse asymptotique de fonctionnelles de projecteurs. Ainsi, premièrement, le régime en grandes dimensions permet ici de déterminer une approximation/prédiction des performances théoriques non asymptotiques, plus précise que ce qui existe actuellement en régime asymptotique classique (le nombre de données d'estimation tends vers l'infini à taille des données fixe). Deuxièmement, deux nouveaux filtres et deux nouveaux détecteurs adaptatifs rang faible ont été proposés et il a été montré qu'ils présentaient de meilleures performances en fonction des paramètres du système en terme de perte en RSB, probabilité de fausse alarme et probabilité de détection. Enfin, les résultats ont été validés sur une application de brouillage, puis appliqués aux traitements radar STAP et MIMO-STAP sparse. L'étude a alors mis en évidence une différence notable avec l'application de brouillage liée aux modèles de matrice de covariance traités dans cette thèse.

The paper addresses the problem of approximating the detector distribution used in target detection embedded in a disturbance composed of a low rank Gaussian noise and a white Gaussian noise. In this context, it is interesting to use an adaptive version of the Low Rank Normalized Matched Filter (LR-ANMF) detector, which is a function of the estimated projector onto the low rank noise subspace. We will show that the traditional approximation of the LR-ANMF detector distribution is not always the better one. In this paper, we propose to perform its limits when the number of secondary data K and the data dimension m both tend to infinity at the same rate m/K → c∈2 (0;∞). Then, we give the theoretical distributions of these limits in the large dimensional regime and approximate the LR-ANMF detector distribution by them. The comparison of empirical and theoretical distributions on a jamming application shows the interest of our approach.

This paper addresses the problem of deriving the asymptotic performance of adaptive Low Rank (LR) filters used in target detection embedded in a disturbance composed of a LR Gaussian noise plus a white Gaussian noise. In this context, we use the Signal to Interference to Noise Ratio (SINR) loss as performance measure which is a function of the estimated projector onto the LR noise subspace. However, although the SINR loss can be determined through Monte-Carlo simulations or real data, this process remains quite time consuming. Thus, this paper proposes to predict the SINR loss behavior in order to not depend on the data anymore and be quicker. To derive this theoretical result, previous works used a restrictive hypothesis assuming that the target is orthogonal to the LR noise. In this paper, we propose to derive this theoretical performance by relaxing this hypothesis and using Random Matrix Theory (RMT) tools. These tools will be used to present the convergences of simple quadratic forms and perform new RMT convergences of structured quadratic forms and SINR loss in the large dimensional regime, i.e. the size and the number of the data tend to infinity at the same rate. We show through simulations the interest of our approach compared to the previous works when the restrictive hypothesis is no longer verified.

The paper addresses the problem of target detection embedded in a disturbance composed of a low rank Gaussian clutter and a white Gaussian noise. In this context, it is interesting to use an adaptive version of the Low Rank Normalized Matched Filter detector, denoted LR-ANMF, which is a function of the estimation of the projector onto the clutter subspace. In this paper, we show that the LR-ANMF detector based on the sample covariance matrix is consistent when the number of secondary data K tends to infinity for a fixed data dimension m but not consistent when m and K both tend to infinity at the same rate, i.e. m/K → c ∈ (0, 1). Using the results of random matrix theory, we then propose a new version of the LR-ANMF which is consistent in both cases and compare it to a previous version, the LR-GSCM detector. The application of the detectors from random matrix theory on STAP (Space Time Adaptive Processing) data shows the interest of our approach.

The paper addresses the problem of target detection embedded in a disturbance composed of a low rank Gaussian clutter and a white Gaussian noise. In this context, it is interesting to use an adaptive version of the Low Rank Normalized Matched Filter detector, denoted LR-ANMF, which is a function of the estimation of the projector onto the clutter subspace. In this paper, we show that the LR-ANMF detector based on the sample covariance matrix is consistent when the number of secondary data K tends to infinity for a fixed data dimension m but not consistent when m and K both tend to infinity at the same rate, i.e. m/K → c ∈ (0, ∞). Using the results of random matrix theory, we then propose a new version of the LR-ANMF which is consistent in both cases. The application of our new detector on STAP (Space Time Adaptive Processing) data shows the interest of our approach.