Subspace SNR Maximization: The Constrained Stochastic Matched Filter - Aix-Marseille Université Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2011

Subspace SNR Maximization: The Constrained Stochastic Matched Filter


In this paper, we propose a novel approach to perform detection of stochastic signals embedded in an additive random noise. Both signal and noise are considered to be real-izations of zero mean random processes whose only second-order statistics are known (their covariance matrices). The method proposed, called Constrained Stochastic Matched Filter (CSMF), is an extension of the Stochastic Matched Filter itself derived from the Matched Filter. The CSMF is optimal in the sense that it maximizes the Signal-to-Noise Ratio in a subspace whose dimension is fixed a priori. In this paper, after giving the reasons of our approach, we show that there is neither obvious nor analytic solution to the problem expressed. Then an algorithm, which is proved to converge, is proposed to obtain the optimal solution. The evaluation of the performance is completed through estimation of Receiver Operating Characteristic curves. Experiments on real signals show the improvement brought by this method and thus its significance.
Fichier principal
Vignette du fichier
IEEE-2010-2 colonnes.pdf (375.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01823637 , version 1 (26-06-2018)



Bruno Borloz, Bernard Xerri. Subspace SNR Maximization: The Constrained Stochastic Matched Filter. IEEE Transactions on Signal Processing, 2011, 59 (4), pp.1346 - 1355. ⟨10.1109/TSP.2010.2102755⟩. ⟨hal-01823637⟩
57 View
1257 Download



Gmail Facebook X LinkedIn More