Iterative roubust sparse recoery method based on focuss for space-time adaptive processing

Conventional Space-time adaptive processing (STAP) requires large numbers of independent and identically distributed (i.i.d.) training samples to ensure the clutter suppression performance, which is hard to be achieved in nonhomogeneous environment. In order to obtain improved clutter suppression with small training support, an iterative sparse recovery STAP algorithm is proposed in this paper. In the proposed method, the clutter spectrum sparse recovery and the calibration of space-time over-complete dictionary are implemented iteratively, modified focal underdetermined system solution (FOCUSS) with recursive calculation is used to alleviate the recovery error and reduce the computational cost, meanwhile the mismatch of space-time overcomplete dictionary is calibrated by minimized the cost function. Based on the simulated and the actual data, it is verified that the proposed method can not only converge with much smaller training samples compared with conventional STAP methods, but also provide improved performance compared with existing sparsity-based STAP methods.