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.     

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.     

Computational Precision Requirements for Optimal Weights in Adaptive Processing

The required accuracy for computing the estimated optimum weights of an adaptive processor has been analyzed by investigating the effects of errors in computing the inverse matrix. It is shown that the required precision depends upon the matrix. An equation for the general case is derived. Several special cases are considered in detail. It is shown that the case of a single interference source requires the highest precision. The least stressing case is identifi'ed and compared to the worst case. The requirements for a "typical" case are also considered. A comparison of the requirements for the covariance matrix estimation technique and for adaptive weight implementation using gradient descent techniques is given. It is shown that there is a dichotomy in that cases that do not stress one technique tend to stress the other.     

Rapid Convergence Rate in Adaptive Arrays

In many applications, the practical usefulness of adaptive arrays is limited by their convergence rate. The adaptively controlled weights in these systems must change at a rate equal to or greater than the rate of change of the external noise field (e.g., due to scanning in a radar if step scan is not used). This convergence rate problem is most severe in adaptive systems with a large number of degrees of adaptivity and in situations where the eigenvalues of the noise covariance matrix are widely different. A direct method of adaptive weight computation, based on a sample covariance matrix of the noise field, has been found to provide very rapid convergence in all cases, i.e., independent of the eigenvalue distribution. A theory has been developed, based on earlier work by Goodman, which predicts the achievable convergence rate with this technique, and has been verified by simulation.     

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.     

Multiband coherent radar detection against compound-Gaussianclutter

A Multiband GLRT-LQ (Generalized Likelihood Ratio Test-Linear Quadratic), MBGLRT-LQ, detector is derived for the coherent radar target detection against a compound-Gaussian clutter background. This scheme is an extension to the multiband case of the Asymptotically Optimum Detector (AOD), also derived under the name of GLRT-LQ in. The proposed multiband version of the algorithm shows two main advantages with respect to the original single-band algorithm. 1) For the adaptive implementation, it requires a much smaller area of homogeneous clutter echoes to estimate the covariance matrix of the interference; 2) it provides an optimum processing of the radar echoes when the radar operates in frequency agility, as electronic counter-countermeasure (ECCM) strategy. A closed form performance analysis is provided for the MBGLRT-LQ detector, which is used to compare it with the single-band version. An application to live recorded data is also presented to validate the obtained results     

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     

基于先验知识及其定量评估的自适应杂波抑制研究

 为了改善训练样本数受限的非均匀杂波环境中的系统检测性能,研究了基于先验知识及其定量评估的自适应杂波抑制算法。提出了使用经真实杂波信息白化后的先验杂波协方差矩阵与单位矩阵之差的谱范数,来定量评估杂波先验知识的准确程度,并给出了真实杂波协方差矩阵未知时的矩阵谱范数估计方法。结合先验知识定量评估结果,获得了具有先验知识约束时的杂波协方差矩阵最大似然估计方法。分别基于多脉冲相参雷达以及空时自适应雷达进行了杂波建模,在此基础之上分析了算法性能。仿真结果证实了该算法优于使用样本协方差矩阵及先验杂波信息形成杂波抑制权值的性能。     

Eigenanalysis-based space-time adaptive radar: performance analysis

The space-time radar problem is well suited to the application of techniques that take advantage of the low rank property of the space-time covariance matrix. The performance of an eigenanalysis-based detector with respect to convergence rate and robustness to calibration errors is analyzed. Analytical expressions are developed for receiver operating curves when the clutter signal environment is assumed to be Gaussian. The curves are derived from the asymptotic expansion of the distribution of the principal components of the covariance matrix. Simulation results are provided to corroborate the theoretical analysis. Examples from the Mountain-Top dataset are used to illustrate the higher convergence rate and increased robustness of the eigenanalysis method.     

Robust adaptive beamforming for HF surface wave over-the-horizon radar

Adaptive beamforming is used to enhance the detection of target echoes received by high frequency (HF) surface wave (HFSW) over-the-horizon (OTH) radars in the presence of spatially structured interference. External interference from natural and man-made sources typically masks the entire range-Doppler search space and is characterized by a spatial covariance matrix that is time-varying or nonstationary over the coherent processing interval (CPI). Adaptive beamformers that update the spatial filtering weight vector within the CPI are likely to suppress such interference most effectively, but the intra-CPI antenna pattern fluctuations result in temporal decorrelation of the clutter which severely degrades subclutter visibility after Doppler processing. A robust adaptive beamformer that effectively suppresses spatially nonstationary interference without degrading subclutter visibility is proposed here. The proposed algorithm is computationally efficient and suitable for practical implementation. Its operational performance is evaluated using experimental data recorded by the Iluka HFSW OTH radar, located near Darwin in far north Australia.     

Covariance matrix estimation for adaptive CFAR detection incompound-Gaussian clutter

We address the estimation of the structure of the covariance matrix and its application to adaptive radar detection of coherent pulse trains in clutter-dominated disturbance modeled as a compound-Gaussian process. For estimation purposes we resort to range cells in spatial proximity with that under test and assume that these cells, free of signal components, can be clustered into groups of data with one and the same value of the texture. We prove that, plugging the proposed estimator of the structure of the covariance matrix into a previously derived detector, based upon the generalized likelihood ratio test (GLRT), leads to an adaptive detector which ensures the constant false alarm rate (CFAR) property with respect to the clutter covariance matrix as well as the statistics of the texture. Finally, we show that this adaptive receiver has an acceptable loss with respect to its nonadaptive counterpart in cases of relevant interest for radar applications     

Partially Adaptive STAP using the FRACTA Algorithm

A partially adaptive space-time adaptive processor (STAP) utilizing the recently developed FRACTA algorithm is presented which significantly reduces the high computational complexity and large sample support requirements of fully adaptive STAP. Multi-window post-Doppler dimensionality reduction techniques are employed to transform the data prior to application of the FRACTA algorithm. The FRACTA algorithm is a reiterative censoring (RC) and detection algorithm which has been shown to provide excellent detection performance in nonhomogeneous interference environments. Two multi-window post-Doppler dimensionality reduction techniques are considered: PRI-staggered and adjacent-bin. The partially adaptive FRACTA algorithm is applied to the KASSPER I (Knowledge-Aided Sensor Signal Processing & Expert Reasoning) challenge datacube. The pulse repetition interval (PRI)-staggered approach with D=6 filters per Doppler bin is found to provide the best detection performance, outperforming the fully adaptive case while simultaneously reducing the runtime by a factor of ten. Using this implementation, partially adaptive FRACTA detects 197 out of 268 targets with one false alarm. The clairvoyant processor (the covariance matrix for each range cell is known) detects 198 targets with one false alarm. In addition, the partially adaptive FRACTA algorithm is shown to be resilient to jamming, and performs well for reduced sample support situations. When compared with partially adaptive STAP using traditional sliding window processing (SWP), the runtime of partially adaptive FRACTA is 14 times faster, and the detection performance is significantly increased (SWP detects 46 out of 268 targets with one false alarm).     

两种自适应方向图峰值副瓣控制方法比较

自适应阵列（或称自适应波束形成）目前已广泛应用到雷达、声纳和通信领域中用来抑制各种干扰（有意的干扰，杂波干扰和多用户干扰等）。在雷达应用中，为了减轻脉冲欺骗式干扰或旁瓣目标并利用单脉冲雷达来准确测量目标波达方向．要求自适应方向图具有低副瓣和稳定的主瓣形状。在实际应用中，各种失配误差将降低自适应阵列的性能．这些误差包括由于目标的波达方向不精确引起的信号指向误差，由通道失配和位置扰动引起的阵列校准误差和由小样本教引起的协方差矩阵估计误差。在此情况下，自适应波束形成的性能大大下降（干扰抑制性能变差。主瓣失真和高的副瓣）。已提出了一种基于二次约束的集成峰值副瓣控制（integrated peak sidelobe control，简称IPSC）方法。该方法可以精确地控制峰值副瓣电平并产生具有稳定的主瓣形状的自适应方向图。研究IPSC中目标信号的影响和信号消除方案以进一步提高IPSC的性能。并将IPSC方法和最新提出的基于二阶锥规划（second-order cone programming，简称SOCP）的分布式峰值副瓣控制（distfibuted peak sidelobe control，简称为DPSC）新方法在性能上进行了比较。仿真结果表明。在干扰抑制性能和方向图控制质量方面IPSC比DPSC性能优越。此外IPSC比DPSC计算高效。     

Control-Loop Noise in Adaptive Array Antennas

Adaptive array receiving antennas can be designed to sense the external noise field and to optimize the array illumination function. A substantial improvement in signal-to-noise ratio can be obtained with adaptive arrays when the external noise field is nonuniformly distributed in angle. The external noise process may be time varying and contain both discrete sources and continuously distributed sources. Two adaptive array implementations which maximize the signal-to-noise ratio are described in this paper. Expressions are derived for control-loop noise, i.e., the variance of the array element weights, and for the additional noise in the array output due to this element weight noise. It is shown that both the element weight noise and the array convergence rate are determined by the eigenvalues of the noise covariance matrix.     

Equivalent transformation for a partially adaptive array

A partially adaptive array is one in which elements of a phased array are controlled or adaptively weighted in groups or in which certain elements, called auxiliary elements, are made controllable. Mathematically, this type of array is formed by transforming all of the elements of an array by a nonsquare matrix such that the resulting output vector has a length less than the number of array elements. It is shown that there is an equivalent matrix transform that can effectively be utilized in analyzing the partially adaptive array's performance when a small number of external jammers are present. Processor implementation and convergence rate considerations lead to the desirability of reducing the dimensionality of the cancellation processor while maintaining good sidelobe interference protection. A meaningful measure of canceller performance is to compute the optimal output signal-to-noise ratio. This expression is a function of the jammer, direction-of-arrival vectors (DOAVs), jammer powers, the array steering vector, and internal noise. It is shown that if this expression is computed for the fully adaptive array then it is easily computed for the partially adaptive array by transforming the jammer DOAVs and the steering vector by the orthogonal projection matrix defined by the rows of the subarray transformation matrix and substituting these vectors back into the original expression for the fully adaptive array     

Estimation of the covariance matrix for dependent signal samples:polarization diversity systems

The problem of the estimation of covariance matrices in multichannel radar system when signal samples are statistically dependent is addressed. An optimal maximum likelihood (ML) estimate is derived. Probability characteristics and sensitivity to signal models of the estimate are evaluated for a polarization diversity system     

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     

Principal components, covariance matrix tapers, and the subspaceleakage problem

A new class of robust space-time adaptive beamforming techniques is introduced to address a broad range of subspace leakage phenomena that arise in many sensor array applications. When present, these leakage phenomena can significantly increase the effective rank of the dominant colored noise interference spectrum, thereby reducing the appeal of techniques that exploit low-rank dominant interference (such as principal components (PC) or diagonal loading) to reduce sample support (training) requirements. By combining the covariance matrix taper (CMT) approach with either PC or diagonal loading, the minimal sample support properties of these techniques can be preserved     

Performance Compparison of Optimum and Conventional MTI and Doppler Processors

The performance of an optimum radar signal processor and more conventional techniques (such as MTI, adaptive MTI, and cqherent integration) are compared. A mathematical method is suggested and applied to several cases of practical interest. A number of operative conditions are discovered in which the conventional processing techniques give very poor performance and the optimum radar processor becomes necessary.