Stochastic-constraints method in nonstationary hot-cluttercancellation. I. Fundamentals and supervised training applications

This paper considers the use of spatio-temporal adaptive array processing in over-the-horizon radar (OTHR) and airborne radar applications in order to remove nonstationary multipath interference, known as “hot clutter”. Since the spatio-temporal properties of hot clutter cannot be assumed constant over the coherent processing interval (CPI), conventional adaptive techniques fail to provide effective hot-clutter mitigation without simultaneously degrading the properties of the backscattered radar signals, known as “cold clutter”. The approach presented incorporates multiple “stochastic” (data-dependent) constraints to achieve effective hot-clutter suppression, while maintaining distortionless output cold-clutter post-processing stationarity     

Optimal and adaptive reduced-rank STAP

This paper is concerned with issues and techniques associated with the development of both optimal and adaptive (data dependent) reduced-rank signal processing architectures. Adaptive algorithms for 1D beamforming, 2D space-time adaptive processing (STAP), and 3D STAP for joint hot and cold clutter mitigation are surveyed. The following concepts are then introduced for the first time (other than workshop and conference records) and evaluated in a signal-dependent versus signal independent context: (1) the adaptive processing “region-of-convergence” as a function of sample support and rank, (2) a new variant of the cross-spectral metric (CSM) that retains dominant mode estimation in the direct-form processor (DFP) structure, and (3) the robustness of the proposed methods to the subspace “leakage” problem arising in many real-world applications. A comprehensive performance comparison is conducted both analytically and via Monte Carlo simulation which clearly demonstrates the superior theoretical compression performance of signal-dependent rank-reduction, its broader region-of-convergence, and its inherent robustness to subspace leakage     

Improved adaptive clutter cancellation through data-adaptivetraining

Adaptive array algorithms based on sample matrix inversion (SMI) require the availability of a secondary data set to “train” the adaptive filter. Numerous data-independent rules have been proposed for selecting this training data. However, such rules often perform poorly in inhomogeneous environments. We present data-adaptive methodologies for selecting the training data. The techniques, called “Power Selected Training” and “Power Selected Deemphasis”, use measurements of the interference environment to select training data. This work describes these algorithms and their performance on recorded radar data     

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.     

CFAR integration processors in randomly arriving impulseinterference

Time diversity transmission is often used to circumvent the high probability of a deep fade on a single transmission which may result in loss of the signal. One way to combat deep fades is to postdetection integrate the received observations from each range resolution cell. The false alarm rate of the postdetection integrator (PI) is extremely sensitive to randomly arriving impulse interference. Such interfering pulses may be unintentionally generated by nearby radars or intentionally generated by pulse jammers seeking to destroy the visibility of the radar. The binary integrator (PI) which uses an M-out-of-L decision rule is insensitive to at most M-1 interfering pulses. We consider the adaptive implementation of the PI and BI detectors for constant false alarm rate (CFAR) operation. We show that the CFAR BI detector when the “AND” (L-out-of-L) decision rule is used exhibits more robust false alarm control properties in the presence of impulse interference at the expense of severe detection loss when no interference is present. The CFAR adaptive PI (API) detector is proposed to alleviate this problem. The CFAR API detector implements an adaptive censoring algorithm which determines and censors with high probability the interference samples thereby achieving robust false alarm control in the presence of interference and optimum detection performance in the absence of interference     

Performance bounds for hot and cold clutter mitigation

A new method is presented for describing the theoretical interference space-time covariance matrix that will be observed in an adaptive airborne radar system under specific topographical conditions. Both hot clutter that is induced by interfering sources and cold clutter that results from the radar transmitter are considered. This method incorporates phenomenology observed under site specific conditions as well as system effects such as array geometry, receiver filtering, and system bandwidth. Use of this formulation rather than sample data analyses that are generally employed enables one to infer performance bounds for site-specific, and thus generally, heterogeneous terrain that are tighter and therefore more meaningful than the thermal noise floor limit     

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.     

圆台阵列杂波模型及空时二维自适应处理

针对圆台共形阵列,建立了空时二维自适应处理(STAP)的杂波模型,给出了圆台阵列杂波抑制最优权值的计算方法。在此基础之上,为了实现可应用到实际环境中的自适应处理方法,进一步讨论了将局部联合域(JDL)降维算法推广至圆台阵列中的问题。得出了圆台阵列JDL算法降维变换矩阵的表达形式,研究了参考波束的数目选取、波束指向等因素对降维损失的影响。理论分析以及仿真结果表明,通过合理选择通道数、波束方位向指向间隔等参数,该算法能够减少自适应波束形成的计算量,而且可以用较少的训练样本获得较好的处理性能。     

The Word Storage Relay (WSR)

One of the more complex systems developed during the cold war was the BOMARC missile system developed by Boeing and the University of Michigan. The BO in the acronym stands for Boeing and the MARC Stands for Michigan Aeronautical Research Center. Boeing built two versions of the BOMARC, the first one designated “IM99A” and the second “IM99B”. The “A” version used a liquid propellant boost system with a range of about 250 miles and the “B” used a solid propellant for boost and had a range of at least 400 miles. The BOMARC was a pilotless aircraft vehicle, developed and deployed to counter the Soviet massed bomber threat     

Further results on adaptive filtering with embedded CFAR

Among the few known adaptive filtering algorithms which have an embedded (integrated) constant false alarm rate (CFAR) performance feature, the generalized likelihood ratio (GLR) test algorithm has been found to be robust in non-Gaussian clutter. This paper examines the detection performance of the GLR algorithm in nonhomogeneous/nonstationary clutter environments which lead to nonidentical distribution of secondary (training) data. For two common types of nonhomogeneity, i.e., the so-called “signal contamination” and “clutter edge”, the asymptotic detection performance is derived and compared with simulations. These asymptotic results are relatively simple to use and they predict the GLR performance in nonhomogeneous environments quite well. The GLR performance loss due to the nonhomogeneity is also evaluated. It is found that the “generalized angle” between the desired and contaminating signal plays an important role in the study of the effects of signal contamination. It is also found that the performance degradation due to the clutter edge depends largely on the width of the clutter spectrum and target-clutter Doppler separation     

基于功率特征分组的空时自适应脉冲干扰抑制方法CSCD

脉冲干扰是一种常见的导航干扰类型,具有高带宽、突发性等特点,针对脉冲干扰的抑制具有较大难度。常规空时自适应处理不对接收信号类型进行区分,而是统一进行协方差矩阵估计及权值计算,存在抗脉冲干扰性能下降或失效的可能。针对以上问题,提出了一种基于功率特征分组的空时自适应处理方法。首先对接收数据进行功率检测,将信号采样数据分为有干扰数据组和无干扰数据组,然后对分组后的数据分别进行权值计算和滤波处理,最后将滤波后的数据按照采样顺序进行合并。该方法通过数据分组,提高了干噪比的统计计算准确度,增加了干扰零陷深度,实现了抗干扰能力的提升。理论分析和仿真实验均证明了该方法的有效性。     

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     

机载相控阵雷达中抑制杂波的线性预测法

从一个多通道自回归过程拟合杂波信号的概念出发 ,提出了用线性预测法实现机载相控阵雷达的时空二维自适应信号处理。研究表明 ,杂波过程可以用一个低阶的多通道自回归过程很好地拟合 ,从而使用一个低阶的线性预测处理器以较低的代价实现准最优的处理。同时 ,这种低阶的线性预测处理器还具备冗余的自由度以对付除杂波外的其他有色噪声和干扰     

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).     

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.     

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     

Circular array STAP

Traditionally, space-time adaptive processing (STAP) for airborne early warning (AEW) radar has been applied to uniform linear arrays (ULAs). However, when considering the overall radar system, electronically scanned circular arrays have advantages: a better combination of even and continual angular and temporal coverage, and mechanical simplicity because it does not need to rotate. This paper answers the question “How well does STAP perform when applied to a circular array?” This paper shows that for the AEW mission, circular arrays are indeed STAP compatible. However, when conventional STAP algorithms are used there may be a small loss in performance when compared with a ULA. With some care in the choice and implementation of the STAP algorithm, the majority of the degradation is at close ranges, where the target returns are relatively strong. At long ranges performance is barely affected. A STAP algorithm which compensates for the circular array environment and provides better performance than existing algorithms is presented     

STAP for GPS receiver synchronization

A space-time adaptive processing (STAP) algorithm for delay tracking and acquisition of the GPS signature sequence with interference rejection capability is developed. The interference can consist of both broadband and narrowband jammers, and is mitigated in two steps. The narrowband jammers are modelled as vector autoregressive (VAR) processes and rejected by temporal whitening. The spatial ing is implicitly achieved by estimating a sample covariance matrix and feeding its inverse into the extended Kalman filter (EKF). The EKF estimates of the code delay and the fading channel are used for a t-test for acquisition detection. Computer simulations demonstrate robust performance of the algorithm in severe jamming, and also show that the algorithm outperforms the conventional delay-locked loop (DLL).     

Loran-C cycle identification in hard-limiting receivers

A new technique is presented for use in hard-limiting receivers. It is based on the widely used analogue “half-cycle peak ratio” (HCPR) technique, from which it differs by being entirely digital; no additional analogue signal processing or other hardware is required. Drawing on recent advances, the new method makes decisions based on a large number of sample points in each Loran-C pulse, thereby increasing the resilience of the identification process in the presence of noise. Performance of the algorithm in the face of continuous-wave interference is equal to or better than that of other cycle-identification techniques     

An anticipative adaptive array for frequency-hopping communications

To fully utilize the theoretical processing gain achievable when an adaptive array and frequency hopping are combined, frequency compensation is required. Improved versions of an anticipative adaptive array are examined that provide efficient compensation by adapting the complex weights at each antenna element to the appropriate values for a carrier frequency before that frequency is received. The underlying adaptive algorithm used is the maximum algorithm. Computer simulation results are used to compare the different versions of anticipative processing. These results show that an appropriate version ensures the rapid convergence of weights to values that provide wideband nulling of the interference and noise