Airborne/spacebased radar STAP using a structured covariance matrix

It is shown that partial information about the airborne/spacebased (A/S) clutter covariance matrix (CCM) can be used effectively to significantly enhance the convergence performance of a block-processed space/time adaptive processor (STAP) in a clutter and jamming environment. The partial knowledge of the CCM is based upon the simplified general clutter model (GCM) which has been developed by the airborne radar community. A priori knowledge of parameters which should be readily measurable (but not necessarily accurate) by the radar platform associated with this model is assumed. The GCM generates an assumed CCM. The assumed CCM along with exact knowledge of the thermal noise covariance matrix is used to form a maximum likelihood estimate (MLE) of the unknown interference covariance matrix which is used by the STAP. The new algorithm that employs the a priori clutter and thermal noise covariance information is evaluated using two clutter models: 1) a mismatched GCM, and 2) the high-fidelity Research Laboratory STAP clutter model. For both clutter models, the new algorithm performed significantly better (i.e., converged faster) than the sample matrix inversion (SMI) and fast maximum likelihood (FML) STAP algorithms, the latter of which uses only information about the thermal noise covariance matrix.     

Spectral-domain covariance estimation with a priori knowledge

A knowledge-aided spectral-domain approach to estimating the interference covariance matrix used in space-time adaptive processing (STAP) is proposed. Prior knowledge of the range-Doppler clutter scene is used to identify geographic regions with homogeneous scattering statistics. Then, minimum-variance spectral estimation is used to arrive at a spectral-domain clutter estimate. Finally, space-time steering vectors are used to transform the spectral-domain estimate into a data-domain estimate of the clutter covariance matrix. The proposed technique is compared with ideal performance and to the fast maximum likelihood technique using simulated results. An investigation of the performance degradation that can occur due to various inaccurate knowledge assumptions is also presented     

Reiterative median cascaded canceler for robust adaptive array processing

A new robust adaptive processor based on reiterative application of the median cascaded canceler (MCC) is presented and called the reiterative median cascaded canceler (RMCC). It is shown that the RMCC processor is a robust replacement for the sample matrix inversion (SMI) adaptive processor and for its equivalent implementations. The MCC, though a robust adaptive processor, has a convergence rate that is dependent on the rank of the input interference-plus-noise covariance matrix for a given number of adaptive degrees of freedom (DOF), N. In contrast, the RMCC, using identical training data as the MCC, exhibits the highly desirable combination of: 1) convergence-robustness to outliers/targets in adaptive weight training data, like the MCC, and 2) fast convergence performance that is independent of the input interference-plus-noise covariance matrix, unlike the MCC. For a number of representative examples, the RMCC is shown to converge using ~ 2.8N samples for any interference rank value as compared with ~ 2N samples for the SMI algorithm. However, the SMI algorithm requires considerably more samples to converge in the presence of outliers/targets, whereas the RMCC does not. Both simulated data as well as measured airborne radar data from the multichannel airborne radar measurements (MCARM) space-time adaptive processing (STAP) database are used to illustrate performance improvements over SMI methods.     

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.     

Performance of MAX family of order-statistic CFAR detectors

The MAX family of constant-false-alarm-rate (CFAR) detectors is introduced as a generalization of the greatest of CFAR (GO-CFAR) or MX mean-level detector (MX-MLD). Members of the MAX family use local estimators based on order statistics and generate both a near-range and a far-range noise-level estimate. Local estimates are always combined through a maximum operation; this insures false-alarm control at clutter edges. At the same time, order-statistic-based estimators result in a high-resolution detector. A complete detection analysis is provided for SWII targets and a reference channel contaminated by large outliers. Results are presented for the MX censored MLD (MX-CMLD) operating in clutter. The MX order statistic detector (MX-OSD) based on only a single-order statistic per window, is analyzed, and curves showing the required threshold, CFAR loss, optimum censoring point, and signal-to-noise ratio (SNR) loss in the presence of outliers are given. Simulations are used to compare the dynamic responses of various MX-OSD detectors in a clutter and a multiple-target environment     

Performance Analysis of the Censored Mean-Level Detector

The censored mean-level detector (CMLD) is an alternative to the mean-level detector that achieves robust detection performance in a multiple-target environment by censoring several of the largest samples of the maximum likelihood estimate of the background noise level. Here we derive exact expressions for the probability of detection of the CMLD in a multiple-target environment when a fixed number of Swerling II targets are present. The primary target is modeled by Swerling case II, and only single-pulse processing is analyzed. Optimization of the CMLD parameters is considered, and a comparison to other detectors is presented.     

基于声波传播时间估计的气流速度测量方法

 为实现对亚声速和超声速气流速度的统一测量,提出了一种基于声传感器的新型测量方法。首先,根据声波在亚声速和超声速气流中的传播特性,利用特定的测量装置建立了声波传播时间与气流速度之间的数学模型,从而将气流速度的测量问题转化为声波传播时间的测量问题。然后,在此基础上,利用计时法和最大似然估计(MLE)方法来估计声波传播时间;其中,计时法在实时性上优势明显,而MLE方法则在可靠性上优于前者。最后,分别从阵元位置扰动性、计时误差和克拉美-罗界(CRB)3个方面对所提算法的性能进行了分析与仿真验证。结果表明,该算法能够实现对亚声速和超声速气流速度的精确测量。     

CFAR detection and estimation for STAP radar

The algorithm presented here provides both a constant false-alarm rate (CFAR) detection and a maximum likelihood (ML) Doppler-bearing estimator of a target in a background of unknown Gaussian noise. A target is detected, and its parameters estimated within each range gate by evaluating a statistical test for each Doppler-angle cell and by selecting the cell with maximum output and finally comparing it with a threshold. Its CFAR performance is analyzed by the use of the sample matrix inversion (SMI) method and is evaluated in the cases of a fully adaptive space-time adaptive processing (STAP) and two partially adaptive STAPs. The performances of these criteria show that the probability of detection is a function only of the sample size K used to estimate the covariance matrix and a generalized signal-to-noise ratio. The choice of the number K is a tradeoff between performance and computational complexity. The performance curves demonstrate that the finer the resolution is, the poorer the detection capability. That means that one can trade off the accuracy of ML estimation with the performance of the CFAR detection criterion     

Range, radial velocity, and acceleration MLE using radar LFM pulsetrain

An efficient implementation of the maximum likelihood estimator (MLE) is presented for the estimation of target range, radial velocity, and acceleration when the radar waveform consists of a wideband linear frequency modulated (LFM) pulse train. Analytic properties of the associated wideband ambiguity function are derived; in particular the ambiguity function, with acceleration set to zero, is derived in closed form. Convexity and symmetry properties of the ambiguity function over range, velocity, and acceleration are presented; these are useful for determining region and speed of convergence for recursive algorithms used to compute the MLE. In addition, the Cramer-Rao bound (CRB) is computed in closed form which shows that the velocity bound is decoupled from the corresponding bounds in range and acceleration. A fast MLE is then proposed which uses the Hough transform (HT) to initialize the MLE algorithm. Monte Carlo simulations show that the MLE attains the CRB for low to moderate signal-to-noise depending on the a priori estimates of range, velocity, and acceleration     

Covariance matrix estimation errors and diagonal loading inadaptive arrays

Simulations were used to investigate the effect of covariance matrix sample size on the system performance of adaptive arrays using the sample matrix inversion (SMI) algorithm. Inadequate estimation of the covariance matrix results in adapted antenna patterns with high sidelobes and distorted mainbeams. A technique to reduce these effects by modifying the covariance matrix estimate is described from the point of view of eigenvector decomposition. This diagonal loading technique reduces the system nulling capability against low-level interference, but parametric studies show that it is an effective approach in many situations     

基于新息异常检测的改进抗差自适应卡尔曼滤波算法

在工程应用中,量测异常及量测噪声统计特性的时变是引起标准卡尔曼滤波振荡甚至发散的主要原因。经典抗差Sage-Husa自适应滤波方案,对量测中的孤立型异常有所抵抗,并可在线估计量测噪声统计特性改善滤波效果,但当连续型异常值出现时,其滤波效果不佳。针对现有抗差Sage-Husa自适应滤波方案的不足,提出了新的改进滤波方法。在改进算法中,当检测到量测异常时采用模值更大的先验预测方差阵代替原算法中的后验估计方差阵,在估计量测噪声方差时起到放大作用,以降低异常量测权重,提高滤波精度;采用IGG方案构造了新的权函数,可在抑制异常影响的同时调节估计方差阵,以免连续异常时新息持续置零引起的滤波发散;采用标准卡尔曼滤波新息辅助异常检测的双重检测策略,避免了因量测噪声方差阵的调节引起检测阈值变化而导致的漏检率增高。仿真实验表明,与常规抗差自适应滤波算法相比,该方案可更加有效地抑制量测异常值的影响。     

竞争失效场合步进应力加速试验统计分析

竞争失效场合加速试验(AT)技术是加速试验由简单结构产品向复杂结构产品推广应用的基础.但目前的方法主要针对恒定应力加速试验.而对竞争失效场合步进应力加速试验缺乏相关研究.针对这一问题,对最一般形式(突发型失效和退化型失效并存)的竞争失效场合步进应力试验进行建模与分析.充分考虑了试验数据由于试验截尾和失效样本对应的失效模...     

Robust adaptive radar detection in the presence of steering vector mismatches

In this paper, we consider the problem of robust radar detection in the presence of Gaussian disturbance with unknown covariance matrix. We design and assess three new robust adaptive detectors, capable of operating in the presence of unknown discrepancies between the nominal and the actual steering vector. Remarkably the new decision rules exhibit a bounded constant false alarm rate (CFAR) behavior and allow, through the regulation of a design parameter, to trade off target sensitivity with sidelobes energy rejection. Finally, computer simulations show that the proposed detectors achieve a visible performance improvement, in many situations of practical interest, over the traditional adaptive detection algorithms, especially in the presence of severe steering vector mismatches.     

An Adaptive Detection Algorithm

A general problem of signal detection in a background of unknown Gaussian noise is addressed, using the techniques of statistical hypothesis testing. Signal presence is sought in one data vector, and another independent set of signal-free data vectors is available which share the unknown covariance matrix of the noise in the former vector. A likelihood ratio decision rule is derived and its performance evaluated in both the noise-only and signal-plus-noise cases.     

Fast converging adaptive processor or a structured covariance matrix

The use of adaptive linear techniques to solve signal processing problems is needed particularly when the interference environment external to the signal processor (such as for a radar or communication system) is not known a priori. Due to this lack of knowledge of an external environment, adaptive techniques require a certain amount of data to cancel the external interference. The number of statistically independent samples per input sensor required so that the performance of the adaptive processor is close (nominally within 3 dB) to the optimum is called the convergence measure of effectiveness (MOE) of the processor. The minimization of the convergence MOE is important since in many environments the external interference changes rapidly with time. Although there are heuristic techniques in the literature that provide fast convergence for particular problems, there is currently not a general solution for arbitrary interference that is derived via classical theory. A maximum likelihood (ML) solution (under the assumption that the input interference is Gaussian) is derived here for a structured covariance matrix that has the form of the identity matrix plus an unknown positive semi-definite Hermitian (PSDH) matrix. This covariance matrix form is often valid in realistic interference scenarios for radar and communication systems. Using this ML estimate, simulation results are given that show that the convergence is much faster than the often-used sample matrix inversion method. In addition, the ML solution for a structured covariance matrix that has the aforementioned form where the scale factor on the identity matrix is arbitrarily lower-bounded, is derived. Finally, an efficient implementation is presented.     

A new clutter rejection method using a robust polarimetricCFAR-detector

Two methods for constructing robust polarimetric constant-false-alarm-rate (CFAR) detectors that use elements of the scattering matrix are discussed. Both methods use robust estimators to recognize outliers and exclude them from further calculations. The first method weighs each sample of the surrounding vectors, and vectors that appear to be outliers are weighted with lower values than the others. The second method uses cluster algorithms to arrange the data in different clusters; some clusters contain the outliers, and others contain observations assumed to come from the main body of the data. The detectors are intended to be used in multitarget and nonhomogeneous-clutter environments     

异常值和未知观测噪声鲁棒的非线性滤波器

针对含异常观测值的非线性系统滤波问题,以Huber损失函数替代推导滤波器最大后验准则中观测误差的l₂范数,构造出了一种新的优化准则函数,从而给出了一种对异常值鲁棒的非线性后验线性化滤波器。分析表明：由于Huber损失函数兼具l₁和l₂范数的性质,从而使得由这个新准则推导出的滤波器,不仅具有l₂范数的低误差拟合性,也具备l₁范数对异常值的鲁棒性。而当观测噪声的分布未知时,通过引入箱线图法检测异常值,并对噪声统计分布的参数进行估计,进一步提出了对异常值和未知观测噪声分布鲁棒的非线性后验线性化滤波器。仿真实验验证了分析结果的有效性,并表明本文算法的性能优于现有文献报道的非线性滤波算法。     

Detection Loss of the Sample Matrix Inversion Technique

The sample matrix inversion (SMI) technique is used for Doppler and/or array processing. Previous analysis of the technique has been in terms of signal-to-interference plus noise ratio (SINR). For Gaussian statistics, this performance measure gives the same loss values as does a probability of detection analysis for linear-time invariant systems. It is often somewhat less valid for nonlinear or time variant systems. As SMI is a nonlinear technique, a probability of detection analysis has been performed. It is shown that the detection loss is larger than that computed by the SINR measure. It is also shown that though the loss predicted by the SINR measure only depends upon the number of measurements used to estimate the covariance matrix, the detection loss depends upon the false alarm probability and the number of adaptable elements in addition to the number of measurements.     

Fast alignment using rotation vector and adaptive Kalman filter

A fast and convenient alignment method is proposed. To improve the speed of convergence, we used rotation vectors instead of traditional Euler angles. Furthermore, we developed an algorithm to automatically tune the measurement noise covariance matrix using adaptive Kalman filtering. Finally, the developed algorithms were applied to an aerial imaging system to automatically geo-locate the centers of the images.     

Biparametric CFAR procedures for lognormal clutter

The authors consider procedures for constant false alarm rate in lognormal clutter, accounting for variations of both the scale and a shape parameter of the clutter. Adaptivity to both parameters is obtained through biparametric estimation based on a sliding window surrounding the radar cell under test. Some procedures exploiting best linear unbiased estimation (BLUE) are presented and compared to a previous procedure called Log-t, which uses maximum likelihood estimation (MLE). The comparison is carried on for both a homogeneous clutter environment and for instances of inhomogeneous environment (clutter edges and spurious targets). In the latter instances, some advantages of BLUE procedures which stem from the opportunity of censoring are highlighted