Clutter nulling space‐time adaptive processing algorithm based on sparse representation for airborne radar

Abstract

Traditional clutter subspace estimation algorithms try to solve the problem by estimating the clutter subspace eigenvectors from training samples, which are inevitably contaminated by noise. Actually, this can never be the best estimate, especially when the size of the training set is small. Furthermore, the omnipresent noise precludes the seeking of a pure clutter subspace. To cope with above drawbacks, the authors appeal to the sparse representation/recovery technique. From a mathematical viewpoint, the pure clutter subspace is spanned by the space-time steering vectors corresponding to the clutter component, and it can be constructed by a suitable set of space-time steering vectors selected from an overcomplete space-time steering dictionary. A criterion for selecting these space-time steering vectors is devised. Moreover, a clutter nulling type space-time adaptive processing algorithm is derived based on the proposed criterion. The resulting algorithm only needs the knowledge of the noise power rather than the clutter rank, which is quite troublesome to estimate in practice. Numerical results with both simulated and the Mountain-Top data demonstrate that the proposed algorithm has superior clutter suppression performance even with limited training samples.