Due to the shortage of independent and identically distributed (i.i.d.) training samples, space−time adaptive processing (STAP) often suffers remarkable performance degradation in the heterogeneous clutter environment. Sparse recovery (SR) techniques have been introduced into STAP for the benefit of the drastically reduced training requirement, but they are incompletely robust for involving the tricky selection of hyper−parameters or the undesirable point estimation for parameters. Given this issue, we incorporate the M
ariational relevance vector machines (MCV) to model the space−time echoes and provide a Gibbs−sampling−based method to estimate posterior distributions of parameters accurately. However, the Gibbs sampler require quantities of iterations, as unattractive as traditional Bayesian type SR−STAP algorithms when the real−time processing is desired. To address this problem, we further develop the B
utoencoding MCV for STAP (BAMCV−STAP), which builds the generative model according to MCV and approximates posterior distributions of parameters with an inference network pre−trained off−line, to realize fast reconstruction of measurements. Experimental results on simulated and measured data demonstrate that BAMCV−STAP can achieve suboptimal clutter suppression in terms of the output signal to interference plus noise ratio (SINR) loss, as well as the attractive real−time processing property in terms of the convergence rate and computational loads.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.