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.     

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.     

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     

Low sidelobe radar waveforms derived from orthogonal matrices

Novel waveforms are described that have low sidelobes when individual or multiple waveforms are approximately processed. They are related to orthogonal matrices that may be associated with complementary sequences and also with periodic waveforms having autocorrelation functions with constant zero-amplitude sidelobes. Also described are sets of sequences whose cross-correlation functions sum to zero everywhere. A potential application is the elimination of ambiguous range stationary clutter     

Convergence properties of Gram-Schmidt and SMI adaptive algorithms

The open-loop Gram-Schmidt (GS) canceler is shown to be numerically identical to the sampled matrix inversion (SMI) algorithm in the transient state if infinite numerical accuracy is assumed. Two forms of the GS canceler are discussed and analyzed: concurrent and nonconcurrent processing. Results for concurrent and nonconcurrent SMI cancelers have been obtained in the past by I.S. Reed, J.D. Mallet, and E. Brennan (see ibid., AES-10, p.853-63, 1974) under the assumption that the inputs are Gaussian. Many of those results are reproduced here using the GS structures as an analysis tool. In addition, new results are obtained when the input noises are not Gaussian. The deleterious effect of overmatching the degrees of freedom is discussed