The main aim of the airborne early warning (AEW) system is to search the potential targets in a large surveillance area. The underlying assumption is that the desired target signals only exist in a few range cells for space-time adaptive processing (STAP), i.e., targets (with certain look direction and Doppler) are sparsely distributed in the entire range cells and most of the range cells are target-free. By utilizing the sparsity of the target distribution, we propose a new STAP method by minimizing the l1-norm of the output magnitude. Unlike conventional STAP methods, which exclude the cell under test from the training samples to avoid target self-nulling, our method processes the cell under test (CUT) and the training samples simultaneously without sample selection. Moreover, to achieve robustness against target steering vector mismatch, we constrain the l1-modulus of the response of any steering vector within a rhombus uncertainty set to exceed unity. Additionally, based on a new definition of the l1-norm of a complex-valued vector, the original nonlinear programming problem can be transformed into a linear programming problem. On the other hand, unlike the slide window processor (SWP) whose weights need to be updated for each range cell, the adaptive weight of our method for a block of samples requires no updating. Consequently, the computational complexity of the proposed method is much lower than that of conventional STAP methods. Finally, since the CUT is used to compute the STAP weights, our method can also suppress the discrete interference. The robustness, computational effectiveness and superiority of the proposed STAP method are verified based on simulated data and the MCARM data.

This paper investigates the three-dimensional target localization problem in satellite–ground bistatic radar. In conventional bistatic radar systems, passive receivers struggle to directly acquire the altitude information of the target, making it difficult to achieve effective three-dimensional target localization. This paper uses the bistatic distance data obtained after signal processing to construct ellipsoidal constraints, thereafter combining azimuth data to compress the position solution space into a three-dimensional elliptical line. Introducing the assumption of short-term linear uniform motion of the target, the target trajectory and elliptical line constraints are projected onto a two-dimensional plane, establishing an optimization model to determine the target trajectory parameters, ultimately yielding the target’s three-dimensional coordinates and completing the positioning process. The simulation results demonstrate the efficacy and performance of the proposed method.