Decentralized CFAR signal detection

The authors develop the theory of CA-CFAR (cell-averaging constant false-alarm rate) detection using multiple sensors and data fusion, where detection decisions are transmitted from each CA-CFAR detector to the data fusion center. The overall decision is obtained at the data fusion center based on some k out of n fusion rule. For a Swerling target model I embedded in white Gaussian noise of unknown level, the authors obtain the optimum threshold multipliers of the individual detectors. At the data fusion center, they derive an expression for the overall probability of detection while the overall probability of false alarm is maintained at the desired value for the given fusion rules. An example is presented showing numerical results     

Optimal CFAR detection in Weibull clutter

Optimal, in the maximum likelihood sense, constant false-alarm rate (CFAR) detection for Weibull clutter statistics, is investigated. The proposed OW (optimal Weibull) estimator is proved to be an asymptotically efficient estimator of the mean power of the Weibull clutter. Theoretical analysis of the OW-CFAR detector is provided, while detection performance analysis is carried out using the Monte Carlo simulation method. The operation of the median and morphological (MEMO)-CFAR detector in Weibull clutter statistics is also explained. It performs almost optimally in uniform clutter and, simultaneously, it is robust in multitarget situations. The performance of the proposed OW-CFAR detector in uniformal Weibull clutter is used as a yardstick in the analysis of the MEMO cell-averager (CA) and ordered statistic (OS) CFAR detectors. Nonfluctuating and fluctuating (Swerling II) targets are considered in detection analysis. The performance of the detectors is also examined at clutter edges     

Adaptive cell-averaging CFAR detection in distributed sensornetworks

The problem of adaptive cell-averaging constant false-alarm rate (CFAR) detection is considered for two distributed sensor network topologies, namely the parallel and the tandem topologies. The compressed data transmitted amongst the detectors is assumed to be in the form of decisions. The overall systems are optimized to yield the maximum probability of detection for a fixed probability of false alarm. The performance of the systems is also analyzed     

Data quantization effects in CFAR signal detection

In this paper, we investigate data quantization effects in constant false alarm rate (CFAR) signal detection. Exponential distribution for the input data and uniform quantization are assumed for the CFAR detector analysis. Such assumptions are valid in the case of radar for a Swerling I target in Gaussian clutter plus noise and a receiver with analog square-law detection followed by analog-to-digital (A/D) conversion. False alarm and detection probabilities of the cell averaging (CA) and order statistic (OS) CFAR detectors operating on quantized observations are analytically determined. In homogeneous backgrounds with 15 dB clutter power fluctuations, we show analytically that a 12-bit uniform quantizer is sufficient to achieve false alarm rate invariance. Detector performance characteristics in nonhomogeneous backgrounds, due to regions of clutter power transitions and multiple interfering targets, are also presented and detailed comparisons are given     

CFAR detection in clutter with unknown correlation properties

We develop a constant false-alarm rate (CFAR) approach for detecting a random N-dimensional complex vector in the presence of clutter or interference modeled as a zero mean complex Gaussian vector whose correlation properties are not known to the receiver. It is assumed that estimates of the correlation properties of the clutter/interference may be obtained independently by processing the received vectors from a set of reference cells. We characterize the detection performance of this algorithm when the signal to be detected is modeled as a zero-mean complex Gaussian random vector with unknown correlation matrix. Results show that for a prescribed false alarm probability and a given signal-to-clutter ratio (to be defined in the text), the detectability of Gaussian random signals depends on the eigenvalues of the matrix R_c^-1R_s. The nonsingular matrix R_c and the matrix R_s are the correlation matrices of clutter-plus-noise and signal vectors respectively. It is shown that the “effective” fluctuation statistics of the signal to be detected is determined completely by the eigenvalues of the matrix R_c^-1R_s. For example the signal to be detected has an effective Swerling II fluctuation statistics when all eigenvalues of the above matrix are equal. Swerling I fluctuation statistics results effectively when all eigenvalues except one are equal to zero. Eigenvalue distributions between these two limiting cases correspond to fluctuation statistics that lie between Swerling I and II models     

CFAR detection of distributed targets in non-Gaussian disturbance

The subject of detection of spatially distributed targets in non-Gaussian noise with unknown statistics is addressed. At the design stage, in order to cope with the a priori uncertainty, we model noise returns as Gaussian vectors with the same structure of the covariance matrix, but possibly different power levels (heterogeneous environment). We also assume that a set of secondary data, free of signal components, is available to estimate the correlation properties of the disturbance The proposed detector assumes no a priori knowledge about the spatial distribution of the target scatterers and ensures the constant false alarm rate (CFAR) property with respect to both the structure of the covariance matrix and the power levels. Finally, the performance assessment, conducted modeling the disturbance as a spherically invariant random process (SIRP), confirms its validity to operate in real radar scenarios     

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     

Approximating the SNR value in detection problems

The inverse problem of finding the required signal-to-noise ratio (SNR) given a set of probability parameters and number of samples is a nontrivial problem. Several past attempts have proposed simple approximations for the SNR, but the achieved accuracy varied across the parameter space and was at times poor. The approximation equations proposed here are considerably more accurate over a larger parameter space.     

Coverage area analysis for decentralized detection in Weibullclutter

The performance of a decentralized constant false-alarm rate (CFAR) detection system with data fusion in homogeneous non-Gaussian background is analyzed in terms of ground area covered. The advantages of using a distributed radar system and the differences between the system behavior in Rayleigh clutter and in Weibull clutter are stressed. Notably, the increasing benefit of cooperative decision making when clutter becomes spikier is pointed out     

Quickest detection for sequential decentralized decision systems

Quickest detection procedures are techniques used to detect sudden or abrupt changes (also called disorders) in the statistics of a random process. The goal is to determine as soon as possible that the change occurred, while at the same time minimizing the chance of falsely signaling the occurrence of a disorder before the change. In this work the distributed quickest detection problem when the disorder occurs at an unknown time is considered. The distributed local detectors utilize a simple summing device and threshold comparator, with a binary decision at the output. At the fusion center, the optimal maximum likelihood (ML) procedure is analyzed and compared with the more practical Page procedure for quickest detection. It is shown that the two procedures have practically equivalent performance. For the important case of unknown disorder magnitudes, a version of the Hinkley procedure is also examined. Next, a simple method for choosing the thresholds of the local detectors based on an asymptotic performance measure is presented. The problem of selecting the local thresholds usually requires optimizing a constrained set of nonlinear equations; our method admits a separable problem, leading to straightforward calculations. A sensitivity analysis reveals that the resulting threshold settings are optimal for practical purposes. The issue of which sample size to use for the local detectors is investigated, and the tradeoff between decision delay and communication cost is evaluated. For strong signals, it is shown that the relative performance deteriorates as the sample size increases, that is, as the system cost decreases. Surprisingly, for the weak signal case, lowering the system cost (increasing the sample size) does not necessarily result in a degradation of performance     

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     

Explicit solutions for some simple decentralized detection problems

A decentralized detection problem is considered in which a number of identical sensors transmit a finite-valued function of their observations to a fusion center which makes a final decision on one of M alternative hypotheses. The authors consider the case in which the number of sensors is large, and they derive (asymptotically) optimal rules for determining the messages of the sensors when the observations are generated from a simple and symmetrical set of discrete distributions. They also consider the tradeoff between the number of sensors and the communication rate of each sensor when there is a constraint on the total communication rate from the sensors to the fusion center. The results suggest that it is preferable to have several independent sensors transmitting low-rate (coarse) information instead of a few sensors transmitting high-rate (very detailed) information. They also suggest that an M-ary hypothesis testing problem can be viewed as a collection of M(M-1)/2 binary hypothesis testing problems. From this point of view the most useful messages (decision rules) are those that provide information to the fusion center that is relevant to the largest possible numbers of these binary hypothesis testing problems     

A unified approach to the design of decentralized detection systems

A unified approach to the design of decentralized detection networks with arbitrary topologies is proposed and analyzed. In this approach, a decentralized detection system of arbitrary topology is represented by a communication matrix that specifies the interconnection structure of the detection network. This matrix is used to derive the general decision rule using the person-by-person-optimal (PBPO) solution methodology. It is shown that the PBPO decision rule is a likelihood ratio test for statistically independent observations. The threshold of the test is shown to be a function of the decision input vector of the detector under consideration. This unified approach is used to obtain the PBPO decision rules of decentralized detection systems with various topologies. Various results in the literature are verified. In addition, the PBPO decision rules for a decentralized detection system with peer communication are presented. Numerical examples are presented for illustration     

Improved CFAR performance in the littoral

Littoral operation of radars poses severe signal processing difficulties due to the highly stressing, inhomogeneous clutter. This report describes an initial investigation into the feasibility of utilising site-specific radar modelling to provide a localised estimate of the clutter statistics which can then be used to predict the required threshold to maintain a given false alarm rate. The technique has been applied to littoral clutter recordings obtained from the experimental S-band phased array radar, MESAR2. Results are presented for the technique in comparison with a conventional, non-adaptive, cell averaging CFAR. This paper concludes that significant performance enhancements are possible through the use of this new technique.     

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     

Analysis of CFAR processors in homogeneous background

Five different constant false alarm rate (CFAR) radar processing schemes are considered and their performances analyzed in homogeneous and nonhomogeneous backgrounds, the latter specifically being the multiple target environment and regions of clutter transitions. The average detection threshold for each of the CFAR schemes was computed to measure and compare the detection performance in homogeneous noise background. The exponential noise model was used for clear and clutter backgrounds to get closed-form expressions. The processor types compared are: the cell-averaging CFAR, the `greatest of' CFAR, the `smallest of' CFAR, the ordered-statistics CFAR, and a modified ordered-statistics processor called the trimmed-mean CFAR     

Analysis of CFAR performance in Weibull clutter

Recent interest has focused on order statistic-based (OS-based) algorithms for calculating radar detection thresholds. Previous analyses of these algorithms are extended, to determine closed-form approximations for the signal-to-clutter ratio required to achieve a particular probability of detection in clutter environments whose amplitude statistics are modeled by the Weibull distribution, and where the clutter dominates receiver noise. Performance is evaluated in both homogeneous and inhomogenous clutter. The analysis shows that the OS-based algorithm is quite robust against both interference and clutter edges. A method is suggested for improving performance at clutter inhomogeneities for short-range targets     

Radar modelling to improve CFAR performance in the littoral

Littoral operation of radars poses severe signal processing difficulties due to the highly stressing, inhomogeneous clutter. This report describes an initial investigation into the feasibility of utilising site specific radar modelling to provide a localized estimate of the clutter statistics which can then be used to predict the required threshold to maintain a given false alarm rate. The technique has been applied to littoral clutter recordings obtained from the experimental S-band phase array radar, MESAR2. Results are presented for the technique in comparison with a conventional, non-adaptive, cell averaging CFAR. The paper concludes that significant performance enhancements are possible through the use of this new technique.     

OS-CFAR thresholding in decentralized radar systems

In a decentralized detection scheme, several sensors perform a binary (hard) decision and send the resulting data to a fusion center for the final decision. If each local decision has a constant false alarm rate (CFAR), the final decision is ensured to be CFAR. We consider the case that each local decision is a threshold decision, and the threshold is proportional, through a suitable multiplier, to a linear combination of order statistics (OS) from a reference set (a generalization of the concept of OS thresholding). We address the following problem: given the fusion rule and the relevant system parameters, select each threshold multiplier and the coefficients of each linear combination so as to maximize the overall probability of detection for constrained probability of false alarm. By a Lagrangian maximization approach, we obtain a general solution to this problem and closed-form solutions for the AND and OR fusion logics. A performance assessment is carried on, showing a global superiority of the OR fusion rule in terms of detection probability (for operating conditions matching the design assumptions) and of robustness (when these do not match). We also investigate the effect of the hard quantization performed at the local sensors, by comparing the said performance to those achievable by the same fusion rule in the limiting case of no quantization     

Analysis of an adaptive CFAR detector in non-Gaussian interference

Coherent signal detection in non-Gaussian interference is presently of interest in adaptive array applications. Conventional array detection algorithms inherently model the interference with a multivariate Gaussian random vector. However, non-Gaussian interference models are also under investigation for applications where the Gaussian assumption may not be appropriate. We analyze the performance of an adaptive array receiver for signal detection in interference modeled with a non-Gaussian distribution referred to as a spherically invariant random vector (SIRV). We first motivate this interference model with results from radar clutter measurements collected in the Mountain Top Program. Then we develop analytical expressions for the probability of false alarm and the probability of detection for the adaptive array receiver. Our analysis shows that the receiver has constant false alarm rate (CFAR) performance with respect to all the interference parameters. Some illustrative examples are included that compare the detection performance of this CFAR receiver with a receiver that has prior knowledge of the interference parameters