Stap using knowledge-aided covariance estimation and the fracta algorithm

In the airborne space-time adaptive processing (STAP) setting, a priori information via knowledge-aided covariance estimation (KACE) is employed in order to reduce the required sample support for application to heterogeneous clutter scenarios. The enhanced FRACTA (FRACTA.E) algorithm with KACE as well as Doppler-sensitive adaptive coherence estimation (DS-ACE) is applied to the KASSPER I & II data sets where it is shown via simulation that near-clairvoyant detection performance is maintained with as little as 1/3 of the normally required number of training data samples. The KASSPER I & II data sets are simulated high-fidelity heterogeneous clutter scenarios which possess several groups of dense targets. KACE provides a priori information about the clutter covariance matrix by exploiting approximately known operating parameters about the radar platform such as pulse repetition frequency (PRF), crab angle, and platform velocity. In addition, the DS-ACE detector is presented which provides greater robustness for low sample support by mitigating false alarms from undernulled clutter near the clutter ridge while maintaining sufficient sensitivity away from the clutter ridge to enable effective target detection performance     

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.     

The effects of IF bandpass mismatch errors on adaptive cancellation

The effects of IF bandpass mismatch errors on adaptive cancellers are investigated. Frequency mismatch errors occur because of errors in the synthesis process of the bandpass filters which are designed to be identical and are in each input channel. Tapped-delay line transversal filters can be used to compensate for these frequency mismatches and thus improve cancellation performance. A pole/zero error model of the filters is developed whereby closed-form solutions of the maximum achievable average cancellation are obtained. This cancellation is a function of the order of the ideally matched frequency filters, the number of time-delay taps in the compensating transversal filter, the bandwidth-tapped time-delay product, and the constraints on these parameters. A design procedure is outlined for optimizing the canceller with respect to these parameters and their constraints; specifically, results are presented for Butterworth-type input filters. It is shown that an arbitrarily low output noise residue cannot be achieved by arbitrarily increasing the number of time-delay taps     

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     

Convergence properties of Gram-Schmidt and SMI adaptive algorithms.II

For pt.I see ibid., vol.26, no.1, p.44-56, Jan. 1990. Theorems and relationships associated with the convergence rate of the Gram-Schmidt (GS) and sampled matrix inversion (SMI) algorithms are presented. Two forms of the GS canceler are discussed: concurrent block processing and sliding window processing. It is shown (as has been stated by other researchers) that the concurrent block processed GS canceler converges rapidly to its optimal signal-to-noise ratio. However, it is also shown that the result is deceptive in that the output residue samples may be highly correlated, which would significantly degrade postdetection processing. It is demonstrated that a specific form of a sliding window GS canceler has the same convergence properties as the concurrent block processed GS canceler     

Coherent detection of radar targets in a non-gaussian background

The problem of detecting radar targets against a background of coherent, correlated, non-Gaussian clutter is studied with a two-step procedure. In the first step, the structure of the amplitude and the multivariate probability density functions (pdfs) describing the statistical properties of the clutter is derived. The starting point for this derivation is the basic scattering problem, and the statistics are obtained from an extension of the central limit theorem (CLT). This extension leads to modeling the clutter amplitude statistics by a mixture of Rayleigh distributions. The end product of the first step is a multidimensional pdf in the form of a Gaussian mixture, which is then used in step 2. The aim of step 2 is to derive both the optimal and a suboptimal detection structure for detecting radar targets in this type of clutter. Some performance results for the new detection processor are also given     

The Cassini Magnetic Field Investigation

The dual technique magnetometer system onboard the Cassini orbiter is described. This instrument consists of vector helium and fluxgate magnetometers with the capability to operate the helium device in a scalar mode. This special mode is used near the planet in order to determine with very high accuracy the interior field of the planet. The orbital mission will lead to a detailed understanding of the Saturn/Titan system including measurements of the planetary magnetosphere, and the interactions of Saturn with the solar wind, of Titan with its environments, and of the icy satellites within the magnetosphere.This revised version was published online in July 2005 with a corrected cover date.     

HRR Detector for Slow-Moving Targets in Sea Clutter

The radar detection of targets in the presence of sea clutter has historically relied upon the radial velocity of targets with respect to the radar platform either by exploiting the relative target Dopplers (for targets with sufficient radial velocity) or by discerning the paths targets traverse from scan to scan. For targets with little to no radial velocity component, though, it can become quite difficult to differentiate targets from the surrounding sea clutter. This paper addresses the detection of slow-moving targets in sea clutter using a high resolution radar (HRR) such that the target has perceptible extent in range. Under the assumption of completely random sea clutter spikes based on an epsiv-contaminated mixture model with the signal and clutter powers known, optimal detection performance results from using the likelihood ratio test (LRT). However, for realistic sea clutter, the clutter spikes tend to be a localized phenomenon. Based upon observations from real radar data measurements, a heuristic approach exploiting a salient aspect of the idealized LRT is developed which is shown to perform well when applied to real measured sea clutter.