Abstract

The accuracy of the prior knowledge of the clutter environments is critical to the clutter suppression performance of knowledge-aided space–time adaptive processing (KA-STAP) algorithms in airborne radar applications. In this paper, we propose an enhanced KA-STAP algorithm to estimate the clutter covariance matrix considering inaccurate prior knowledge of the array manifold for airborne radar systems. The core idea of this algorithm is to incorporate prior knowledge about the range of the measured platform velocity and the crab angle, and other radar parameters into the assumed clutter model to obtain increased robustness against inaccuracies of the data. It first over-samples the space–time subspace using prior knowledge about the range values of parameters and the inaccurate array manifold. By selecting the important clutter space–time steering vectors from the over-sampled candidates and computing the corresponding eigenvectors and eigenvalues of the assumed clutter model, we can obtain a more accurate clutter covariance matrix estimate than directly using the prior knowledge of the array manifold. Some extensions of the proposed algorithm with existing techniques are presented and a complexity analysis is conducted. Simulation results illustrate that the proposed algorithms can obtain good clutter suppression performance, even using just one snapshot, and outperform existing KA-STAP algorithms in presence of the errors in the prior knowledge of the array manifold.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.