The monopulse angle measuring technique is widely adopted in radar systems due to its simplicity and speed in accurately acquiring a target’s angle. However, in a spatial adaptive array, beam distortion, due to adaptive beamforming, can result in serious deterioration of monopulse performance. In this paper, a novel constrained monopulse angle measuring algorithm is proposed for spatial adaptive arrays. This algorithm maintains the ability to suppress the unwanted signals without suffering from beam distortion. Compared with conventional adaptive monopulse methods, the proposed algorithm adopts a new form of constraint in forming the difference beam with the merit that it is more robust in most practical situations. At the same time, it also exhibits the simplicity of one-dimension monopulse, helping to make this algorithm even more appealing to use in adaptive planar arrays. The theoretical mean and variance of the proposed monopulse estimator is derived for theoretical analysis. Mathematical simulations are formulated to demonstrate the effectiveness and advantages of the proposed algorithm. Both theoretical analysis and simulation results show that the proposed algorithm can outperform the conventional adaptive monopulse methods in the presence of severe interference near the mainlobe.

Distributed array radar can improve radar detection capability and measurement accuracy. However, it will suffer cyclic ambiguity in its angle estimates according to the spatial Nyquist sampling theorem since the large sparse array is undersampling. Consequently, the state estimation accuracy and track validity probability degrades when the ambiguous angles are directly used for target tracking. This paper proposes a second probability data association filter (SePDAF)-based tracking method for distributed array radar. Firstly, the target motion model and radar measurement model is built. Secondly, the fusion result of each radar’s estimation is employed to the extended Kalman filter (EKF) to finish the first filtering. Thirdly, taking this result as prior knowledge, and associating with the array-processed ambiguous angles, the SePDAF is applied to accomplish the second filtering, and then achieving a high accuracy and stable trajectory with relatively low computational complexity. Moreover, the azimuth filtering accuracy will be promoted dramatically and the position filtering accuracy will also improve. Finally, simulations illustrate the effectiveness of the proposed method.

Feature aided tracking can often yield improved tracking performance over the standard multiple target tracking (MTT) algorithms with only kinematic measurements. However, in many applications, the feature signal of the targets consists of sparse Fourier-domain signals. It changes quickly and nonlinearly in the time domain, and the feature measurements are corrupted by missed detections and mis-associations. These two factors make it hard to extract the feature information to be used in MTT. In this paper, we develop a feature-aided nearest neighbour joint probabilistic data association filter (NN-JPDAF) for joint MTT and feature extraction in dense target environments. To estimate the rapidly varying feature signal from incomplete and corrupted measurements, we use the atomic norm constraint to formulate the sparsity of feature signal and use the $\ell_1$-norm to formulate the sparsity of the corruption induced by mis-associations. Based on the sparse representation, the feature signal are estimated by solving a semidefinite program (SDP) which is convex. We also provide an iterative method for solving this SDP via the alternating direction method of multipliers (ADMM) where each iteration involves closed-form computation. With the estimated feature signal, re-filtering is performed to estimate the kinematic states of the targets, where the association makes use of both kinematic and feature information. Simulation results are presented to illustrate the performance of the proposed algorithm in a radar application.