We study the Cramer-Rao bounds of parameter estimation and coherence performance for the next generation radar (NGR). In order to enhance the performance of NGR, the signal model of NGR with master-slave architecture based on a single pulse is extended to the case of pulse trains, in which multiple pulses are emitted from all sensors and then integrated spatially and temporally in a unique master sensor. For the MIMO mode of NGR where orthogonal waveforms are emitted, we derive the closed-form Cramer-Rao bound (CRB) for the estimates of generalized coherence parameters (GCPs), including the time delay differences, total phase differences and Doppler frequencies with respect to different sensors. For the coherent mode of NGR where the coherent waveforms are emitted after pre-compensation using the estimates of GCPs, we develop a performance bound of signal-to-noise ratio (SNR) gain for NGR based on the aforementioned CRBs, taking all the estimation errors into consideration. It is shown that greatly improved estimation accuracy and coherence performance can be obtained with pulse trains employed in NGR. Numerical examples demonstrate the validity of the theoretical results.
17 July 2009 in Science China Information Sciences
In this paper, we focus on the problem of two-dimensional direction of arrival (2D-DOA) estimation for monostatic MIMO Radar with electromagnetic vector received sensors (MIMO-EMVSs) under the condition of gain and phase uncertainties (GPU) and mutual coupling (MC). GPU would spoil the invariance property of the EMVSs in MIMO-EMVSs, thus the effective ESPRIT algorithm unable to be used directly. Then we put forward a C-SPD ESPRIT-like algorithm. It estimates the 2D-DOA and polarization station angle (PSA) based on the instrumental sensors method (ISM). The C-SPD ESPRIT-like algorithm can obtain good angle estimation accuracy without knowing the GPU. Furthermore, it can be applied to arbitrary array configuration and has low complexity for avoiding the angle searching procedure. When MC and GPU exist together between the elements of EMVSs, in order to make our algorithm feasible, we derive a class of separated electromagnetic vector receiver and give the S-SPD ESPRIT-like algorithm. It can solve the problem of GPU and MC efficiently. And the array configuration can be arbitrary. The effectiveness of our proposed algorithms is verified by the simulation result.
In adaptive processing applications, the design of the adaptive filter requires estimation of the unknown interference‐plus‐noise covariance matrix from secondary training data. The presence of outliers in the training data can severely degrade the performance of adaptive processing. By exploiting the sparse prior of the outliers, a Bayesian framework to develop a computationally efficient outlier‐resistant adaptive filter based on sparse Bayesian learning (SBL) is proposed. The expectation–maximisation (EM) algorithm is used therein to obtain a maximum a posteriori (MAP) estimate of the interference‐plus‐noise covariance matrix. Numerical simulations demonstrate the superiority of the proposed method over existing methods.
8 August 2009 in Science China Information Sciences
Space–time adaptive processing (STAP) is usually adopted in airborne and spaceborne radars for clutter suppression and slow moving target detection. However, for traditional sample covariance matrix inversion algorithm, there are usually not enough independent and identically distributed secondary samples to achieve a satisfactory performance. The diagonal loading methods are usually utilised to solve this finite sample problem. Nevertheless, the performance of diagonal loading STAP can be further improved by directly estimating the precision matrix and non‐linearly shrinking the eigenvalues of the samples covariance matrix. This study proposes a non‐linear shrinkage‐based precision matrix estimation algorithm for STAP. Also, a noise power estimation method is provided so that the proposed algorithm still works well even if the noise power is not known previously. The proposed algorithm has much better performance than the diagonal loading methods whether the sample size is smaller or larger than the dimension of the covariance matrix. Besides, in the condition that the clutter‐to‐noise ratio is large, which is often encountered in practice, the proposed algorithm also shows a comparatively good performance. Simulations are performed to validate the proposed algorithm.