.png){kind=icon}
.png){kind=icon}
Return
Clutter suppression algorithm based on fast converging sparse Bayesian learning for airborne radar
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2016.06.023.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Adapting the space-time adaptive processing (STAP) filter with finite number of secondary data is of particular interest for airborne phased-array radar clutter suppression. Sparse representation (SR) technique has been introduced into the STAP framework for the benefit of drastically reduced training requirement. However, most SR algorithms need the fine tuning of one or more user parameters, which affect the final results significantly. Sparse Bayesian learning (SBL) and multiple sparse Bayesian learning (M-SBL) are robust and user parameter free approaches, but they converge quite slowly. To remedy this limitation, a fast converging SBL (FCSBL) approach is proposed based on Bayesian inference along with a simple approximation term, then, it is extended to the multiple measurement vector case, and the resulting approach is termed as M-FCSBL. To improve the performance of STAP in finite secondary data situation, the M-FCSBL is utilized to estimate the clutter plus noise covariance matrix (CCM) from a limited number of secondary data, and then the resulting CCM is adopted to devise the STAP filter and suppress the clutter. Numerical experiments with both simulated and Mountain-Top data are carried out. It is shown that the proposed algorithm has superior clutter suppression performance in finite secondary data situation. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Space-time adaptive processing
Clutter suppression
Sparse representation
Bayesian inference
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W