Robust and fast iterative sparse recovery method for space-time adaptive processing

Abstract

Conventional space-time adaptive processing (STAP) requires large numbers of independent and identically distributed (i.i.d) training samples to ensure the performance of clutter suppression, which is hard to be achieved in practical complex nonhomogeneous environment. In order to improve the performance of clutter suppression with small training sample support, a robust and fast iterative sparse recovery method for STAP is proposed in this paper. In the proposed method, the sparse recovery of clutter spatial-temporal spectrum and the calibration of space-time overcomplete dictionary are achieved iteratively. Firstly, the robust solution of sparse recovery is derived by regularized processing, which can be calculated recursively based on the block Hermitian matrix property, afterwards the mismatch of space-time overcomplete dictionary is calibrated by minimizing the cost function. The proposed method can not only alleviate the effect of noise and dictionary mismatch, but also reduce the computational cost caused by direct matrix inversion. Finally, the proposed method is verified based on the simulated and the actual airborne phased array radar data, which shows that the proposed method is suitable for practical complex nonhomogeneous environment and provides better performance compared with conventional STAP methods.

This is a preview of subscription content, access via your institution.

References

  1. 1

    Reed I S, Mallet J D, Brennan L E. Rapid convergence rate in adaptive arrays. IEEE Trans Aerosp Electron Syst, 1974, 10: 853–863

    Article  Google Scholar 

  2. 2

    Wang Y L, Peng Y N, Bao Z. Space-time adaptive processing for airborne radar with various array orientation. IET Radar Sonar Navig, 1997, 144: 330–340

    Article  Google Scholar 

  3. 3

    Zhang W, He Z, Li J. A method for finding best channels in beam-space post-Doppler reduced-dimension STAP. IEEE Trans Aerosp Electron Syst, 2013, 50: 254–264

    Article  Google Scholar 

  4. 4

    Wang H, Cai L. On adaptive spatial-temporal processing for airborne surveillance radar systems. IEEE Trans Aerosp Electron Syst, 1994, 30: 660–670

    Article  Google Scholar 

  5. 5

    Long T, Liu Y X, Yang X P. Improved eigenanalysis canceler based on data-independent clutter subspace estimation for space-time adaptive processing. Sci China Inf Sci, 2013, 56: 102301

    MathSciNet  Google Scholar 

  6. 6

    Fa R, de Lamare R C. Reduced rank STAP algorithms using joint iterative optimization of filters. IEEE Trans Aerosp Electron Syst, 2011, 47: 1668–1684

    Article  Google Scholar 

  7. 7

    Wang Y L, Liu W J, Xie W C. Reduced-rank space-time adaptive detector for airborne radar. Sci China Inf Sci, 2014, 57: 082310

    Google Scholar 

  8. 8

    Liu W J, Xie W C, Wang Y L. Adaptive detectors in the Krylov subspace. Sci China Inf Sci, 2014, 57: 102310

    MathSciNet  Google Scholar 

  9. 9

    Selesnick I W, Pillai S U, Li K Y, et al. Angle-Doppler processing using sparse regularization. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, Dallas, 2010. 2750–2753

    Google Scholar 

  10. 10

    Wang W W, Liao G S, Zhu S Q. Compressive sensing-based ground moving target indication for dual-channel synthetic aperture radar. IET Radar Sonar Navig, 2013, 7: 858–866

    MathSciNet  Article  Google Scholar 

  11. 11

    Sun K, Meng H D, Wang Y L, et al. Direct data domain STAP using sparse representation of clutter spectrum. Signal Process, 2011, 91: 2222–2236

    Article  MATH  Google Scholar 

  12. 12

    Yang Z C, Li X, Wang H Q, et al. Sparsity-based space-time adaptive processing using complex-valued homotopy technique for airborne radar. IET Signal Process, 2014, 8: 552–564

    Article  Google Scholar 

  13. 13

    Donoho D L, Elad M, Temlyakov V N. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans Inf Theory, 2006, 52: 6–18

    MathSciNet  Article  MATH  Google Scholar 

  14. 14

    Candes E, Romberg J, Tao T. Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math, 2006, 59: 1207–1223

    MathSciNet  Article  MATH  Google Scholar 

  15. 15

    Jia Q Q, Wu R B. Space time adaptive parameter estimation of moving target based on compressed sensing. J Electron Inf Technol, 2013, 35: 2714–2720

    Article  Google Scholar 

  16. 16

    Rao B D, Engan K, Cotter S F, et al. Subset selection in noise based on diversity measure minimization. IEEE Trans Signal Process, 2003, 51: 760–770

    Article  Google Scholar 

  17. 17

    Gao F, Wang Y L, Chen H. Study on matrix inversion for STAP. Radar Sci Technol, 2008, 6: 215–218

    MathSciNet  Google Scholar 

  18. 18

    Yang X P, Liu Y X, Long T. A pulse-order recursive method for inverse covariance matrix computation applied to space-time adaptive processing. Sci China Inf Sci, 2013, 56: 042312

    MathSciNet  Google Scholar 

  19. 19

    Yang X P, Sun Y Z, Liu Y X, et al. Fast inverse covariance matrix computation based on element-order recursive method for space-time adaptive processing. Sci China Inf Sci, 2015, 58: 022304

    Google Scholar 

  20. 20

    Babu B N S, Torres J A, Melvin W L. Processing and evaluation of multichannel airborne radar measurements (MCARM) measured data. In: Proceedings of IEEE International Symposium on Phased Array Systems and Technology, Boston, 1996. 395–399

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Xiaopeng Yang.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Yang, X., Sun, Y., Zeng, T. et al. Robust and fast iterative sparse recovery method for space-time adaptive processing. Sci. China Inf. Sci. 59, 062308 (2016). https://doi.org/10.1007/s11432-016-5533-9

Download citation

Keywords

  • space-time adaptive processing (STAP)
  • sparse recovery
  • robust
  • iteration
  • computational complexity