Median cascaded canceller for robust adaptive array processing

A median cascaded canceller (MCC) is introduced as a robust multichannel adaptive array processor. Compared with sample matrix inversion (SMI) methods, it is shown to significantly reduce the deleterious effects of impulsive noise spikes (outliers) on convergence performance of metrics; such as (normalized) output residue power and signal to interference-plus-noise ratio (SINR). For the case of no outliers, the MCC convergence performance remains commensurate with SMI methods for several practical interference scenarios. It is shown that the MCC offers natural protection against desired signal (target) cancellation when weight training data contains strong target components. In addition, results are shown for a high-fidelity, simulated, barrage jamming and nonhomogenous clutter environment. Here the MCC is used in a space-time adaptive processing (STAP) configuration for airborne radar interference mitigation. Results indicate the MCC produces a marked SINR performance improvement over SMI methods.     

Outlier resistant adaptive matched filtering

Robust adaptive matched filtering (AMF) whereby outlier data vectors are censored from the covariance matrix estimate is considered in a maximum likelihood estimation (MLE) setting. It is known that outlier data vectors whose steering vector is highly correlated with the desired steering vector, can significantly degrade the performance of AMF algorithms such as sample matrix inversion (SMI) or fast maximum likelihood (FML). Four new algorithms that censor outliers are presented which are derived via approximation to the MLE solution. Two algorithms each are related to using the SMI or the FML to estimate the unknown underlying covariance matrix. Results are presented using computer simulations which demonstrate the relative effectiveness of the four algorithms versus each other and also versus the SMI and FML algorithms in the presence of outliers and no outliers. It is shown that one of the censoring algorithms, called the reiterative censored fast maximum likelihood (CFML) technique is significantly superior to the other three censoring methods in stressful outlier scenarios.     

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.     

Framework and Taxonomy for Radar Space-Time Adaptive Processing (STAP) Methods

The goal of radar space-time adaptive processing (STAP) is to detect slow moving targets from a moving platform, typically airborne or spaceborne. STAP generally requires the estimation and the inversion of an interference-plus-noise (I+N) covariance matrix. To reduce both the number of samples involved in the estimation and the computational cost inherent to the matrix inversion, many suboptimum STAP methods have been proposed. We propose a new canonical framework that encompasses all suboptimum STAP methods we are aware of. The framework allows for both covariance-matrix (CM) estimation and range-dependence compensation (RDC); it also applies to monostatic and bistatic configurations. Finally, we discuss a taxonomy for classifying the methods described by the framework.     

Reduced-rank STAP for high PRF radar

Due to the range ambiguity of high pulse-repetition frequency (HPRF) radars, echoes from far-range fold over near-range returns. This effect may cause low Doppler targets to compete with near-range strong clutter. Another consequence of the range ambiguity is that the sample support for estimating the array covariance matrix is reduced, leading to degraded performance. It is shown that space-time adaptive processing (STAP) techniques are required to reject the clutter in HPRF radar. Four STAP methods are studied in the context of the HPRF radar problem: low rank approximation sample matrix inversion (SMI), diagonally loaded SMI, eigencanceler, and element-space post-Doppler. These three methods are evaluated in typical HPRF radar scenarios and for various training conditions, including when the target is present in the training data     

STAP中采样支持问题研究

在机载雷达空时二维自适应处理 (STAP)中 ,足够数量的IID采样数据才可以构成杂波相关矩阵的有效估计 ,而实际雷达工作环境中的采样数总是有限的 针对这一问题 ,提出了将前后平均 ,对角加载 ,与降维处理相结合来降低采样数目要求 ,解决采样支持问题的方案 ,并进行了理论分析与仿真。显然 ,通过采用适当的降维处理与前后平均及对角加载相结合 ,所需采样数最多可降低到仅用 3～ 5个     

Adaptive canceler and pulse compressor interactions

Performance results for the sidelobe level of a compressed pulse that has been preprocessed through an adaptive canceler are obtained. The adaptive canceler is implemented using the sampled matrix inversion algorithm. Because of finite sampling, the quiescent compressed pulse sidelobe levels are degraded due to the preprocessing of the main channel input data stream (the uncompressed pulse) through an adaptive canceler. It is shown that if N is the number of input canceler channels (main and auxiliaries) and K is the number of independent samples per channel, then K/N can be significantly greater than one in order to retain sidelobes that are close to the original quiescent sidelobe level (with no adaptive canceler). Also it is shown that the maximum level of degradation is independent of whether pulse compression occurs before or after the adaptive canceler if the uncompressed pulse is completely contained within the K samples that are used to calculate the canceler weights. This same analysis can be used to predict the canceler noise power level that is induced by having the desired signal present in the canceler weight calculation     

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.     

Rapid convergence by cascading Applebaum adaptive arrays

An adaptive array architecture is described which has improved convergence speed over the conventional Applebaum array when the eigenvalue spread of the input signal covariance matrix is large. The architecture uses N+1 Applebaum adaptive arrays in a two-layer cascaded configuration. The gain constants in the first layer are set so that large interfering sources are quickly nulled, but small interfering sources are suppressed more slowly. Since the first layer removes the large interfering signals, the gain constant for the second layer can be set to a large value to quickly null the smaller interferers. The adaptation time is examined for several combinations of signal levels and array sizes. It is shown that, in many signal environments, the computational requirements for the cascaded array compare favorably with those of conventional sample matrix inversion (SMI) methods for large arrays     

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.     

Convergence bounds of an SMI/Gram-Schmidt canceler in colored noise

The performance of the sampled matrix inversion (SMI) adaptive algorithm in colored noise is investigated using the Gram-Schmidt (GS) canceler as an analysis tool. Lower and upper bounds of average convergence are derived, indicating that average convergence slows as the input time samples become correlated. When the input samples are uncorrelated, the fastest SMI algorithm convergence occurs. When the input samples are correlated then the convergence bounds depend on the number of channels N, the number of samples per channels K , and the eigenvalues associated with K×K correlation matrix of the samples in a given channel. This matrix is assumed identical for all channels     

Asymptotic distribution of the conditional signal-to-noise ratio in an eigenanalysis-based adaptive array

The statistical characterization of the conditioned signal-to-noise ratio (SNR) of the sample matrix inversion (SMI) method has been known for some time. An eigenanalysis-based detection method, referred to as the eigencanceler, has been shown to be a useful alternative to SMI, when the interference has low rank. In this work, the density function of the conditioned SNR is developed for the eigencanceler. The development is based on the asymptotic expansion of the distribution of the principal components of the covariance matrix. It is shown that, unlike the SMI method, the eigencanceler yields a conditional SNR distribution that is dependent on the covariance matrix, It is further shown that simpler, covariance matrix-independent approximations can be found for the large interference-to-noise case. The new distribution is shown to be in good agreement with the numerical data obtained from simulations.     

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.     

Adaptive array transient sidelobe levels and remedies

The transient sidelobe level of a sidelobe canceler (SLC) is a function of the external noise environment, the number of adaptive auxiliary antennas, the adaptive algorithm used, auxiliary antenna gain margins, and the number of samples used to calculate the adaptive weights. An analytical result for the adaptive sidelobe level is formulated for the case when the adaptive algorithm is the open-loop, sampled matrix inversion (SMI) algorithm. The result is independent of whether concurrent or nonconcurrent data processing is used in the SMI algorithm's implementation. It is shown that the transient sidelobe level is eigenvalue dependent and increases proportionally to the gain margin of the auxiliary antenna elements with respect to the quiescent main antenna sidelobe level. Techniques that reduce this transient sidelobe level are discussed, and it is theoretically shown that injection independent noise into the auxiliary channels significantly reduces the transient sidelobe level. It is demonstrated that using this same technique reduces the SMI noise power residue settling time     

Improved clutter mitigation performance using knowledge-aided space-time adaptive processing

This paper presents a framework for incorporating knowledge sources directly in the space-time beamformer of airborne adaptive radars. The algorithm derivation follows the usual linearly-constrained minimum-variance (LCMV) space-time beamformer with additional constraints based on a model of the clutter covariance matrix that is computed using available knowledge about the operating environment. This technique has the desirable property of reducing sample support requirements by "blending" the information contained in the observed radar data and the a priori knowledge sources. Applications of the technique to both full degree of freedom (DoF) and reduced DoF beamformer algorithms are considered. The performance of the knowledge-aided beam forming techniques are demonstrated using high-fidelity simulated X-band radar data     

An Adaptive MTI for Weather Clutter Suppression

A digital realization of an adaptive clutter-locking loop is presented. The purpose of the loop is to estimate the mean Doppler frequency of the clutter. The clutter spectrum is then shifted toward the zero Doppler by this estimate. A fixed moving target indicator (MTI) canceler following the loop suppresses the shifted clutter. Experimental simulations illustrate the feasibility of the loop. Results indicate that the proposed canceler works significantly better than a fixed canceler, while not as well as the 10-pulse moving target detector (MTD) processor. However, the complexity of the MTD is significantly more than the relatively simple adaptive processor presented here.     

Robust adaptive filtering method for SINS/SAR integrated navigation system

This paper presents a new robust adaptive filtering method for SINS/SAR (Strap-down Inertial Navigation System/Synthetic Aperture Radar) integrated navigation system. This method adopts the principle of robust estimation to adaptive filtering of observational data. A robust adaptive filter is developed to adaptively determine the covariance matrix of observation noise, and adaptively adjust the covariance matrix of system state noise according to the adaptive factor constructed based on predicted residuals. Experimental results and comparison analysis demonstrate that the proposed method cannot only effectively resist disturbances due to system state noise and observation noise, but it can also achieve higher accuracy than the adaptive Kalman filtering method.     

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

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

Multistage partially adaptive STAP CFAR detection algorithm

A new method of partially adaptive constant false-alarm rate (CFAR) detection is introduced. The processor implements a novel sequence of orthogonal subspace projections to decompose the Wiener solution in terms of the cross-correlation observed at each stage. The performance is evaluated using the general framework of space-time adaptive processing (STAP) for the cases of both known and unknown covariance. It is demonstrated that this new approach to partially adaptive STAP outperforms the more complex eigen-analysis approaches using both simulated DARPA Mountain Top data and true pulse-Doppler radar data collected by the MCARM radar     

一种基于协方差矩阵加权的阵元误差补偿STAP处理

机载多通道阵列雷达天线在工程实践中不可避免地存在各类阵元误差,所产生的通道失配问题会对空时二维自适应处理的性能造成大的影响。对存在阵元误差时的阵列信号模型进行了分析,提出了一种基于协方差矩阵加权（CMT）的阵元误差补偿空时自适应处理（STAP）方法,在工程应用中该加权矩阵可通过地面天线定标及校飞过程确定,通过对总干扰协方差矩阵估计的加权预处理,可将实际阵元误差对STAP性能的影响控制在测量误差的影响范围,最后通过仿真验证了算法的有效性。