Registration-based compensation using sparse representation in conformal-array STAP

DOI10.1016/J.SIGPRO.2011.04.008MaRDI QIDQ635051zbMATH OpenOpenAlexFDO

Authors Ke Sun, Huadong Meng, Fabian D. Lapierre, Xiqin Wang

Publication date 19 August 2011

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.4416

zbMATH Keywords

conformal arrayiterative reweighted least squaresparse representationSTAP

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Space-time adaptive processing (STAP) is a well-known technique in detecting slow-moving targets in the presence of a clutter-spreading environment. When considering the STAP system deployed with conformal radar array (CFA), the training data are range-dependent, which results in poor detection performance of traditional statistical-based algorithms. Current registration-based compensation (RBC) is implemented based on a sub-snapshot spectrum using temporal smoothing. In this case, the estimation accuracy of the configuration parameters and the clutter power distribution is limited. In this paper, the technique of sparse representation is introduced into the spectral estimation, and a new compensation method is proposed, namely RBC with sparse representation (SR-RBC). This method first converts the clutter spectral estimation into an ill-posed problem with the constraint of sparsity. Then, the technique of sparse representation, like iterative reweighted least squares (IRLS), is utilized to solve this problem. Then, the transform matrix is designed so that the processed training data behaves nearly stationary with the test cell. Because the configuration parameters and the clutter spectral response are obtained with full-snapshot using sparse representation, SR-RBC provides more accurate clutter spectral estimation, and the transformed training data are more stationary so that better signal-clutter-ratio (SCR) improvement is expected.

Recommendations

• Registration-based range-dependence compensation for bistatic STAP radars
• Direct data domain STAP using sparse representation of clutter spectrum
• Clutter suppression for airborne phased radar with conformal arrays by least squares estimation
• Gridless super-resolution sparse recovery for non-sidelooking STAP using reweighted atomic norm minimization
• Range dependent clutter rejection using range-recursive space-time adaptive processing (STAP) algorithms

Cites work

• A sparse signal reconstruction perspective for source localization with sensor arrays
• Clutter-limited detection performance of multi-channel conformal arrays
• EMBEDDING DIAGRAMS OF THE N=2 SUPERCONFORMAL ALGEBRA UNDER SPECTRAL FLOW
• Just relax: convex programming methods for identifying sparse signals in noise
• Minimizing Nonconvex Functions for Sparse Vector Reconstruction
• Registration-based range-dependence compensation for bistatic STAP radars
• Stable recovery of sparse overcomplete representations in the presence of noise

Cited in

(2)

• Registration-based range-dependence compensation for bistatic STAP radars
• Direct data domain STAP using sparse representation of clutter spectrum

This page was built for publication: Registration-based compensation using sparse representation in conformal-array STAP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635051)