Robust space-time adaptive processing for airborne radar in nonhomogeneous clutter environments

Space-time adaptive processing (STAP) holds tremendous potential for the new generation airborne surveillance radar, in which the phased array antennas and pulse Doppler processing mode are adopted. A new STAP approach using the multiple-beam and multiple Doppler channels is presented here for airborne phased array radar. The approach with space-time multiple-beam (STMB) architecture is robust to array errors and has very low system degrees of freedom (DOFs). Hence, it has low sample support requirement and it is very suitable for the practical planar phased array radar under nonhomogeneous clutter environments. Meanwhile, a new nonhomogeneous detector (NHD) based on the correlation dimension (CD) is also proposed here, which is used as an effective method to screen tracing data prior to detection processing. It can further improve the performance of the STAP approach in the severely nonhomogeneous clutter environments. Therefore, a scheme that incorporates the correlation dimension nonhomogeneity detector (CD-NHD) with the STMB is recommended, which we term CD-NHD-STMB. The experimental simulation results indicate that: 1) the STMB processor is robust to array element error and has high performance under nonhomogeneous clutter environments; 2) the CD-NHD is also effective on the nonhomogeneous clutter. As a result, the CD-NHD-STMB scheme is robust to array element error and nonhomogeneous clutter, and therefore available for airborne phased array radar applications.     

Performance comparisons of modified SMI and GLR algorithms

Adaptive filtering for signal detection in colored interference of unknown statistics is addressed. The detection performance of a modified version of the well-known sample matrix inversion (SMI) algorithm, called the modified SMI (MSMI), is compared with that of the generalized likelihood ratio (GLR) algorithm in colored Gaussian interference. The performance sensitivity of the MSMI and GLR in colored Weibull and log-normal interference is studied via simulation. It is found that there is almost no need to use the more complicated GLR algorithm in Gaussian interference, while in Weibull or log-normal interference the GLR should be preferable to the MSMI     

A persymmetric multiband GLR algorithm

By exploring the covariance structure information to reduce the uncertainty in adaptive processing, a persymmetric generalized likelihood ratio algorithm (PGLR) is developed together with the closed-form expressions of probabilities of detection and false alarm. This multiband algorithm, which requires less computation, can significantly outperform the corresponding unstructured multiband GLR algorithm, especially in a severely nonstationary and/or nonhomogeneous interference environment. Simulation shows that the constant false alarm rate (CFAR) performance of the new algorithm is as insensitive as that of the unstructured multiband GLR to the departure of interference distribution from Gaussian     

A localized adaptive MTD processor

The problem of achieving the optimum moving target indicator (MTI) detection performance in strong clutter of unknown spectrum when the set of data available to the estimation of clutter statistics is small due to a severely nonhomogeneous environment is studied. A new adaptive implementation, called the Doppler domain localized generalized likelihood ratio processor (DDL-GLR), is proposed, and its detection performance is studied in detail. It is shown that the DDL-GLR is a data-efficient implementation of the high-order optimum detector and has several advantages of practical importance over the adaptive processors     

复合高斯杂波中距离扩展目标的迭代近似GLRT检测器

 研究了结构化的复合高斯杂波(CGC)背景中距离扩展目标自适应检测问题。针对异质杂波背景中的近似广义似然比检验(AGLRT-HTG)检测器应用于CGC背景中时存在一定的信杂比损失问题,结构化的复合高斯杂波采用自回归过程建模,结合近似广义似然比检验(AGLRT)方法和迭代估计思想,提出了CGC背景中距离扩展目标的迭代近似广义似然比检测器(RAGLRT-CGC)。从理论上分析了极限情况下RAGLRT-CGC虚警概率与检测门限关系的解析表达式。仿真结果表明,在CGC背景中,RAGLRT-CGC对不同多主散射点目标具有较好的鲁棒性,并且检测性能明显优于AGLRT-HTG。     

An adaptive array detector with mismatched signal rejection

An adaptive detection algorithm with a sensibility parameter for rejecting unwanted signals is presented. This algorithm is a simple modification of the generalized likelihood ratio (GLR) detector (or test) for detecting a signal in zero mean Gaussian noise with unknown correlation matrix. Specifically, the adaptive detection algorithm is obtained by introducing an arbitrary positive scalar, which is called the sensitivity parameter, into the GLR detector as a multiplier of an already existing quadratic term. The GLR detector then becomes a special case of this detector for the unity sensitivity parameter. It is shown that the sensitivity parameter controls the degree to which unwanted signals are rejected. From numerical examples, it is demonstrated how the sensitivity parameter can be chosen such that unwanted signals, can be rejected while maintaining acceptable detection loss for slightly mismatched signals. Further insight into previous work on adaptive detection is also given     

Data quantization effects in CFAR signal detection

In this paper, we investigate data quantization effects in constant false alarm rate (CFAR) signal detection. Exponential distribution for the input data and uniform quantization are assumed for the CFAR detector analysis. Such assumptions are valid in the case of radar for a Swerling I target in Gaussian clutter plus noise and a receiver with analog square-law detection followed by analog-to-digital (A/D) conversion. False alarm and detection probabilities of the cell averaging (CA) and order statistic (OS) CFAR detectors operating on quantized observations are analytically determined. In homogeneous backgrounds with 15 dB clutter power fluctuations, we show analytically that a 12-bit uniform quantizer is sufficient to achieve false alarm rate invariance. Detector performance characteristics in nonhomogeneous backgrounds, due to regions of clutter power transitions and multiple interfering targets, are also presented and detailed comparisons are given     

Performance of max-mean level detector with and without censoring

The maximum-mean-level detector (MX-MLD) is a constant false-alarm rate (CFAR) detector designed to eliminate the excessively high false-alarm rate seen with the MLD at the edges of contiguous clutter regions. The concomitant high target suppression effect led M. Weiss (1982) to suggest a censored modification. The authors analyze the detection performance of the maximum-censored-mean-level detector (MX-CMLD). A homogeneous Swerling II target and clutter environment are assumed, and only single-pulse detection is considered. Analytic results apply equally to the MX-MLD and extend previous analysis. Simulation results are presented that demonstrate the qualitative effects of various CFAR detectors in nonhomogeneous clutter environments     

Moving target detection via airborne HRR phased array radar

We study moving target detection in the presence of temporally and spatially correlated ground clutter for airborne high range resolution (HRR) phased array radar. We divide the HRR range profiles into large range segments to avoid the range migration problems that occur in the HRR radar data. Since each range segment contains a sequence of HRR range bins, no information is lost due to the division and hence no loss of resolution occurs. We show how to use a vector autoregressive (VAR) filtering technique to suppress the ground clutter. Then a moving target detector based on a generalized likelihood ratio test (GLRT) detection strategy is derived. The detection threshold is determined according to the desired false alarm rate, which is made possible via an asymptotic statistical analysis. After the target Doppler frequency and spatial signature vectors are estimated from the VAR-filtered data as if a target were present, a simple detection variable is computed and compared with the detection threshold to render a decision on the presence of a target. Numerical results are provided to demonstrate the performance of the proposed moving target detection algorithm     

基于先验门限优化准则的探测阈值自适应选择

针对 2维测量和 4 -sigma确认门 ,把先验检测门限优化准则和修正 Riccati方程的解析近似表示相结合 ,得到了在瑞利起伏环境下使跟踪性能优化的信号探测阈值解析表示式 ,从而使在线求解自适应信号探测阈值能比较容易地实现。通过研究和仿真发现 :在滤波稳定阶段 ,本文给出的自适应信号检测门限方法的跟踪性能优于固定虚警率方法的跟踪性能 ;基于先验检测门限优化准则实现检测 -跟踪的联合优化要求信噪比要大于一定的门限 ,在瑞利起伏环境下 ,对 2维测量和 4 -sigma确认门 ,该门限为 1 .57     

Detection by incoherent recombination with partial information

Matched filter (MF) detection in spread environments is often seriously degraded by the mismatch between the waveform replica and the composite signal formed by the spreading environment. Typically the spreading is caused by multiple delayed reflections due to scatter extent or multipath especially in shallow water sonar applications. It is possible to recover some detector performance by incoherent summation of weighted MF realizations in a process called incoherent recombining (IR). Several IR strategies for Gaussian data that assume varying amounts of prior scattering function (SF) information are examined, their receiver operating characteristics (ROCs) computed, and compared with those of the unrealizable “prescient” receiver (PR). They include optimally weighted and unweighted versions of the maximum likelihood estimator-correlator (EC), and variations of the “at-least-one” (ALO) detector that examines sequences of MF realizations declaring a detection if at least one threshold is crossed. As might be expected, performance improves with the accuracy of the prior information incorporated in the detector formulation     

Analysis of CFAR performance in Weibull clutter

Recent interest has focused on order statistic-based (OS-based) algorithms for calculating radar detection thresholds. Previous analyses of these algorithms are extended, to determine closed-form approximations for the signal-to-clutter ratio required to achieve a particular probability of detection in clutter environments whose amplitude statistics are modeled by the Weibull distribution, and where the clutter dominates receiver noise. Performance is evaluated in both homogeneous and inhomogenous clutter. The analysis shows that the OS-based algorithm is quite robust against both interference and clutter edges. A method is suggested for improving performance at clutter inhomogeneities for short-range targets     

An effect of range-heterogeneous clutter on adaptive Dopplerfilters

The practical implementation of adaptive Doppler filters requires estimates of clutter parameters to determine the adaptive weights. A method of deriving the estimate via the sample matrix inversion (SMI) algorithm using multiple data snapshots from adjacent range cells is presented. For homogeneous clutter environments, the results of this technique asymptotically approach the optimum (a priori known covariance matrix) as the number of snapshots approaches infinity; this asymptotic behavior does not occur for heterogeneous clutter environments. An equation for the decrease in improvement factor is derived. To promote understanding, the simplified special case of narrowband clutter is considered in detail. In almost all cases, the loss is small     

Distributed CFAR detection in homogeneous and nonhomogeneousbackgrounds

The performance of distributed constant false alarm rate (CFAR) detection with data fusion both in homogeneous and nonhomogeneous Gaussian backgrounds is analyzed. The ordered statistics (OS) CFAR detectors are employed as local detectors. With a Swerling type I target model, in the homogeneous background, the global probability of detection for a given fixed global probability of false alarm is maximized by optimizing both the threshold multipliers and the order numbers of the local OS-CFAR detectors. In the nonhomogeneous background with multiple targets or clutter edges, the performance of the detection system is analyzed and its performance is compared with the performance of the distributed cell-averaging (CA) CFAR detection system     

CFAR detection in clutter with unknown correlation properties

We develop a constant false-alarm rate (CFAR) approach for detecting a random N-dimensional complex vector in the presence of clutter or interference modeled as a zero mean complex Gaussian vector whose correlation properties are not known to the receiver. It is assumed that estimates of the correlation properties of the clutter/interference may be obtained independently by processing the received vectors from a set of reference cells. We characterize the detection performance of this algorithm when the signal to be detected is modeled as a zero-mean complex Gaussian random vector with unknown correlation matrix. Results show that for a prescribed false alarm probability and a given signal-to-clutter ratio (to be defined in the text), the detectability of Gaussian random signals depends on the eigenvalues of the matrix R_c^-1R_s. The nonsingular matrix R_c and the matrix R_s are the correlation matrices of clutter-plus-noise and signal vectors respectively. It is shown that the “effective” fluctuation statistics of the signal to be detected is determined completely by the eigenvalues of the matrix R_c^-1R_s. For example the signal to be detected has an effective Swerling II fluctuation statistics when all eigenvalues of the above matrix are equal. Swerling I fluctuation statistics results effectively when all eigenvalues except one are equal to zero. Eigenvalue distributions between these two limiting cases correspond to fluctuation statistics that lie between Swerling I and II models     

Tracking in clutter with nearest neighbor filters: analysis andperformance

The measurement that is “closest” to the predicted target measurement is known as the “nearest neighbor” (NN) measurement in tracking. A common method currently in wide use for tracking in clutter is the so-called NN filter, which uses only the NN measurement as if it were the true one. The purpose of this work is two fold. First, the following theoretical results are derived: the a priori probabilities of all three data association events (updates with correct measurement, with incorrect measurement, and no update), the probability density functions (pdfs) of the NN measurement conditioned on the association events, and the one-step-ahead prediction of the matrix mean square error (MSE) conditioned on the association events. Secondly, a technique for prediction without recourse to expensive Monte Carlo simulations of the performance of tracking in clutter with the NN filter is presented. It can quantify the dynamic process of tracking divergence as well as the steady-state performance. The technique is a new development along the line of the recently developed general approach to the performance prediction of algorithm with both continuous and discrete uncertainties     

Nonparametric rank detectors under K-distributed clutter in radar applications

This correspondence deals with a comparative analysis of parametric detectors versus rank ones for radar applications, under K-distributed clutter and nonfluctuating and Swerling II target models. We show that the locally optimum detectors (LODs) (optimum for very low signal-to-clutter ratio (SCR)) under K-distributed clutter are not practical detectors; on the contrary, asymptotically optimum detectors (optimum for high SCR) are the practical ones. The performance analysis of the parametric log-detector and the nonparametric (linear rank) detector is carried out for independent and identically distributed (IID) clutter samples, correlated clutter samples, and nonhomogeneous clutter samples. Some results of Monte Carlo simulations for detection probability (P/sub d/) versus SCR are presented in curves for different detector parameter values.     

Efficient robust AMF using the FRACTA algorithm

The FRACTA algorithm has been shown to be an effective space-time adaptive processing (STAP) methodology for the airborne radar configuration in which there exists nonhomogeneous clutter, jamming, and dense target clusters. Further developments of the FRACTA algorithm are presented here in which the focus is on the robust, efficient implementation of the FRACTA algorithm. Enhancements to the FRACTA algorithm include a censoring stopping mechanism, an alternative data blocking approach for adaptive power residue (APR) censoring, and a fast reiterative censoring (RC) procedure. Furthermore, a coherent processing interval (CPI) segmentation scheme for computing the adaptive weights is presented as an alternative approach to computing the adaptive matched filter (AMF) weight vector that allows for lower sample support and reduced computational complexity. The enhanced FRACTA algorithm, denoted as FRACTA.E, is applied to the KASSPER I challenge datacube which possesses dense ground target clusters that are known to have a significant deleterious effect on standard adaptive matched filtering (AMF) processors. It is shown that the FRACTA.E algorithm outperforms and is considerably more computationally efficient than both the original FRACTA algorithm and the standard sliding window processing (SWP) approach. Furthermore, using the KASSPER I datacube, the FRACTA.E algorithm is shown to have the same detection performance as the clairvoyant algorithm where the exact range-dependent clutter covariance matrices are known.     

Spatially distributed target detection in non-Gaussian clutter

Two detection schemes for the detection of a spatially distributed, Doppler-shifted target in non-Gaussian clutter are developed. The non-Gaussian clutter is modeled as a spherically invariant random vector (SIRV) distribution. For the first detector, called the non-scatterer density dependent generalized likelihood ratio test (NSDD-GLRT), the detector takes the form of a sum of logarithms of identical functions of data from each individual range cell. It is shown under the clutter only hypothesis, that the detection statistic has the chi-square distribution so that the detector threshold is easily calculated for a given probability of false alarm P_F. The detection probability P_D is shown to be only a function of the signal-to-clutter power ratio (S/C)_opt of the matched filter, the number of pulses N, the number of target range resolution cells J, the spikiness of the clutter determined by a parameter of an assumed underlying mixing distribution, and P_F. For representative examples, it is shown that as N, J, or the clutter spikiness increases, detection performance improves. A second detector is developed which incorporates a priori knowledge of the spatial scatterer density. This detector is called the scatterer density dependent GLRT (SDD-GLRT) and is shown for a representative case to improve significantly the detection performance of a sparsely distributed target relative to the performance of the NSDD-GLRT and to be robust for a moderate mismatch of the expected number of scatterers. For both the NSDD-GLRT and SDD-GLRT, the detectors have the constant false-alarm rate (CFAR) property that P_F is independent of the underlying mixing distribution of the clutter, the clutter covariance matrix, and the steering vector of the desired signal     

On adaptive multiband signal detection with GLR algorithm

An adaptive multiband detector based on the principle of the generalized likelihood ratio test (GLR) is presented. Its detection performance is studied and compared with that of the corresponding single-band GLR detector. The multiband detector is shown to significantly outperform the single-band under the chosen system constraint, especially when the amount of data available from a single frequency band is severely limited by the environment