Performance Data for a Double-Threshold Detection Radar

A problem f requently encountered by radar systems analysts is the evaluation of the "double-threshold" or M out of N detection process. Detection probabilities of this process are binomially distributed, making it difficult to obtain exact results for large values of the number of samples and for low probabilities of false alarm. In this paper, the M out of N detection algorithm is defined and detection performance is calculated for the special cases of the nonfluctuating target and Swerling cases I and 11 for false alarm probabilities of 106, 10-8 and 10-10.     

A Method for Setting a Test Signal Level Relative to Noise

A method is described for adjusting the leval of an RF test signal generator relative to the noise level at the receiver output. The method compares a detected output to a threshold and counts the number of times noise and signal plus noise cross the threshold in a given number of tries. By setting the threshold at a given false alarm probability for noise alone and then adding the test signal and adjusting its level to give a specified detection probability, the signal-to-noise ratio can be calibrated to an accuracy that depends on the number of samples used to measure the probabilities. The false alarm and detection probabilities are given for best accuracy as well as the rms error in signal-to-noise ratio as a function of the number of samples used.     

Blind adaptive decision fusion for distributed detection

We consider the problem of decision fusion in a distributed detection system. In this system, each detector makes a binary decision based on its own observation, and then communicates its binary decision to a fusion center. The objective of the fusion center is to optimally fuse the local decisions in order to minimize the final error probability. To implement such an optimal fusion center, the performance parameters of each detector (i.e., its probabilities of false alarm and missed detection) as well as the a priori probabilities of the hypotheses must be known. However, in practical applications these statistics may be unknown or may vary with time. We develop a recursive algorithm that approximates these unknown values on-line. We then use these approximations to adapt the fusion center. Our algorithm is based on an explicit analytic relation between the unknown probabilities and the joint probabilities of the local decisions. Under the assumption that the local observations are conditionally independent, the estimates given by our algorithm are shown to be asymptotically unbiased and converge to their true values at the rate of O(1/k/sup 1/2/) in the rms error sense, where k is the number of iterations. Simulation results indicate that our algorithm is substantially more reliable than two existing (asymptotically biased) algorithms, and performs at least as well as those algorithms when they work.     

Multistatic-Radar Binomial Detection

The performance of multistatic-radar binomial detectors is investigated. Although conceptually similar to the well-knwn "M-out-of-N" detector frequently considered for monostatic systems, the multistatic detector must cope with false alarms generated by target et ghosting as well as by noise threshold crossings. A procedure for deriving the detection statistics of multistatic binomial detectors ors is presented. The procedure is applied to derive the detection probabilities for a spectrum of false alarm probabilities, target densities, and numbers of radar receivers.     

Estimation of radar detection and false alarm probability

The accuracy with which detection and false alarm probabilities can be estimated with a limited amount of measured radar data is addressed. A simple simulation method for estimating the statistical performance of a radar detection system is presented. Confidence limits and a rule of thumb for accuracy for the estimated probabilities are presented along with procedures for calculating them. It is concluded that the minimum value of N used in a detection radar signal simulation should be 10/P_FA when the simple simulation method is used, where P_FA is the probability of false alarm, and that a value closer to 100/P _FA is preferable     

A Boolean algebra approach to multiple sensor voting fusion

A technique for integrating multiple-sensor data using a voting fusion process that combines the individual sensor outputs is described. An important attribute of the method is the automatic confirmation of the target by the fusion processor without the need to explicitly determine which sensors and what level of sensor participation are involved. A three-sensor system, with multiple confidence levels in each sensor, is discussed to illustrate the approach. Boolean algebra is used to derive closed-form expressions for the multiple sensor-system detection probability and false-alarm probability. Procedures for relating confidence levels to detection and false alarm probabilities are described through an example. The hardware implementation for the sensor system fusion algorithm is discussed     

Optimum local decision space partitioning for distributed detection

A distributed detection system is considered that consists of a number of independent local detectors and a fusion center. The decision statistics and performance characteristics (i.e. the false alarm probabilities and detection probabilities) of the local detectors are assumed as given. Communication is assumed only between each local detector and the fusion center and is one-way from the former to the latter. The fusion center receives decisions from the local detectors and combines them for a global decision. Instead of a one-bit hard decision, the authors propose that each local detector provides the fusion center with multiple-bit decision value which represents its decision and, conceptually, its degree of confidence on that decision. Generating a multiple-bit local decision entails a subpartitioning of the local decision space the optimization of which is studied. It is shown that the proposed system significantly outperforms one in which each local detector provides only a hard decision. Based on optimum subpartitioning of local decision space, the detection performance is shown to increase monotonically with the number of partitions     

Contiguous pulse binary integration analysis

The probability of detecting m or more pulses contiguously-that is, in a row-from a pulse train of n pulses is determined when the detection of each pulse is an independent Bernoulli trial with probability p. While a general closed-form expression for this probability is not known, we present an analytical procedure that gives the exact expression for the probability of interest for any particular case. We also present simple asymptotic expressions for these probabilities and develop bounds on the probability that the number of pulses that must be observed before m contiguous detections is greater than or less than some particular number. We consider the implications for binary integration in radar and electronic warfare problems     

分布式接收宽带多目标信号盲检测迭代处理方法

随着软硬件技术的飞速发展和宽带接收机的广泛使用,频谱检测向着高瞬时带宽的方向发展,传统基于信道化处理的频谱检测方法存在搜索速度慢、处理效率低下的问题。文章提出了 1种新的分布式接收宽带多目标信号盲检测迭代处理方法,在无须预先知道信号数目及信号频谱位置的情况下,能够实现特定虚警概率多信号盲检测,具备较高的灵活性和稳健性。首先,在对信号特征进行分析的基础上,通过构造线性模型,将分布式接收多目标信号检测转化为线性模型求解问题进行处理;然后,基于贝叶斯多参数联合求解模型,在对未知参数先验分布进行合理假设的基础上,推导了各未知参数变分分布及信号检测门限的解析表达式,采用变分分布软信息迭代的方式实现多传感器信号、多参数联合估计,并利用每次迭代参数估计结果,对信号检测门限进行更新,通过置零操作实现预设虚警概率下的多信号盲检测;最后,通过仿真实验对所提方法性能进行了分析,并与相关方法进行了对比。仿真结果表明,所提方法能够有效利用多路接收信号信息,实现宽带未知多目标信号的盲检测,有效提升短数据下的算法处理效能,与现有方法相比,在接收单元数目较多以及信噪比较低时具有明显优势。     

Fluctuating Target Detection in Clutter Using Sidelobe Blanking Logic

In an earlier paper, Maisel [6] considered two-channel detection systems using a sidelobe blanking logic when a nonfluctuating target was present. This paper is an extension of the earlier work to include fluctuating targets. The Swerling I, II, III, and IV models are considered when single-pulse detection is of interest. An adaptive threshold procedure is also briefly discussed whereby the probability of false alarm at any given resolution cell is maintained constant, even though the input clutter level may vary from cell to cell or from beam position to beam position. Useful data are presented for detection probabilities in the range 0.5 to 0.9, for false alarm probabilities in the range 104 to 10-8, and for a false detection probability of 0.1 for a sidelobe target yielding an apparent signal to total noise power density ratio of 13.0 dB in the main beam receiver.     

Parallel Distributed CFAR Detection Optimization Based on Genetic Algorithm with Interval Encoding

Aiming at parallel distributed constant false alarm rate (CFAR) detection employing K/N fusion rule, an optimization algorithm based on the genetic algorithm with interval encoding is proposed. N-1 local probabilities of false alarm are selected as optimization variables. And the encoding intervals for local false alarm probabilities are sequentially designed by the person-by-person optimization technique according to the constraints. By turning constrained optimization to unconstrained optimization, the problem of increasing iteration times due to the punishment technique frequently adopted in the genetic algorithm is thus overcome. Then this optimization scheme is applied to spacebased synthetic aperture radar (SAR) multi-angle collaborative detection, in which the nominal factor for each local detector is determined. The scheme is verified with simulations of cases including two, three and four independent SAR systems. Besides, detection performances with varying K and N are compared and analyzed.     

Multi-Target Tracking in Clutter without Measurement Assignment

When tracking targets using radars and sonars, the number of targets and the origin of data is uncertain. Data may be false measurements or clutter, or they may be detections from an unknown number of targets whose possible trajectories and detection processes can only be described in a statistical manner. Optimal all-neighbor multi-target tracking (MTT) in clutter enumerates all possible joint measurement-to-track assignments and calculates the a posteriori probabilities of each of these joint assignments. The numerical complexity of this process is combinatorial in the number of tracks and the number of measurements. One of the key differences between most MTT algorithms is the manner in which they reduce the computational complexity of the joint measurement-to-track assignment process. We propose an alternative approach, using a form of soft assignment, that enables us to bypass this step entirely. Specifically, our approach treats possible detections of targets followed by other tracks as additional clutter measurements. It starts by approximating the a~priori probabilities of measurement origin. These probabilities are then used to modify the clutter spatial density at the location of the measurements. A suitable single target tracking (STT) filter then uses the modified clutter intensity for updating the track state. In effect, the STT filter is transformed into an MTT filter with a numerical complexity that is linear in the number of tracks and the number of measurements. Simulations show the effectiveness of this approach in a number of different multi-target scenarios.     

A new distributed constant false alarm rate detector

A new constant false alarm rate (CFAR) test termed signal-plus-order statistic CFAR (S+OS) using distributed sensors is developed. The sensor modeling assumes that the returns of the test cells of different sensors are all independent and identically distributed In the S+OS scheme, each sensor transmits its test sample and a designated order statistic of its surrounding observations to the fusion center. At the fusion center, the sum of the samples of the test cells is compared with a constant multiplied by a function of the order statistics. For a two-sensor network, the functions considered are the minimum of the order statistics (mOS) and the maximum of the order statistics (MOS). For detecting a Rayleigh fluctuating target in Gaussian noise, closed-form expressions for the false alarm and detection probabilities are obtained. The numerical results indicate that the performance of the MOS detector is very close to that of a centralized OS-CFAR and it performs considerably better than the OS-CFAR detector with the AND or the OR fusion rule. Extension to an N-sensor network is also considered, and general equations for the false alarm probabilities under homogeneous and nonhomogeneous background noise are presented.     

Cascaded detector for multiple high-PRF pulse Doppler radars

A postdetection design methodology for a multiple high-pulse-repetition frequency (PRF) pulse Doppler radar has been developed. The postdetection processor consists of an M out of N detector where range and target ambiguities are resolved, followed by a square-law detector which enhances the minimum signal-to-noise (S/N) power-ratio per pulse burst performance. For given probabilities of false alarm and detection, formulas are derived from which the three thresholds associated with the cascaded detector can be found. Fundamental tradeoffs between the minimum S/N required, number of ghosts, and the number of operations (NOPs) that the cascaded detector must perform are identified. It is shown that the NOPs and the number of ghosts increase and the minimum S/N required decreases as the binary M out of N detector passes more detections to the square-law detector     

Optimal radar threshold determination in Weibull clutter andGaussian noise

A technique is presented for determining the ideal detection threshold when Gaussian noise and Weibull distributed clutter returns are present on a radar receiver and neither is dominant. Quantitative data is presented for several clutter types and false alarm probabilities     

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     

Asynchronous distributed detection

Binary parallel distributed-detection architectures employ a bank of local detectors to observe a common volume of surveillance, and form binary local decisions about the existence or nonexistence of a target in that volume. The local decisions are transmitted to a central detector, the data fusion center (DEC), which integrates them to a global target or no target decision. Most studies of distributed-detection systems assume that the local detectors are synchronized. In practice local decisions are made asynchronously and the DFC has to update its global decision continually. In this study the number of local decisions observed by the central detector within any observation period is Poisson distributed. An optimal fusion rule is developed and the sufficient statistic is shown to be a weighted sum of the local decisions collected by the DFC within the observation interval. The weights are functions of the individual local detector performance probabilities (i.e., probabilities of false alarm and detection). In this respect the decision rule is similar to the one developed by Chair and Varshney for the synchronized system. Unlike the Chair-Varshney rule, however, the DFC's decision threshold in the asynchronous system is time varying. Exact expressions and asymptotic approximations are developed for the detection performance with the optimal rule. These expressions allow performance prediction and assessment of tradeoffs in realistic decision fusion architectures which operate over modern communication networks     

Threshold Control for Automatic Detection in Radar Systems

In automatic detection in radar systems an estimate of background clutter power is used to set the detection threshold. Usually detection cells surrounding the cell under test for the presence of a target are used to estimate the clutter power. In the research reported herein, the target location is taken to be uncertain and thus returns from a target could corrupt this clutter power estimate. It is shown how the threshold should be varied to compensate for the resulting degradation in detection performance. The threshold control procedure is based on a priori information about target location that could be supplied by the radar's tracking system. In addition, a simple procedure for calculating detection and false alarm probabilities for Swerling II target models is presented.     

Joint integrated probabilistic data association: JIPDA

A new recursive filter for multi-target tracking in clutter is presented. Multiple tracks may share the same measurement(s). Joint events are formed by creating all possible combinations of track-measurement assignments and the probabilities for these joint events are calculated. The expressions for the joint event probabilities incorporate the probabilities of target existence of individual tracks, an efficient approximation for the cluster volume and a priori probability of the number of clutter measurements in each cluster. From these probabilities the data association and target existence probabilities of individual tracks are obtained, which allows track state update and false track discrimination. A simulation study is presented to show the effectiveness of this approach.