A localized adaptive MTD processor

The problem of achieving the optimum moving target indicator (MTI) detection performance in strong clutter of unknown spectrum when the set of data available to the estimation of clutter statistics is small due to a severely nonhomogeneous environment is studied. A new adaptive implementation, called the Doppler domain localized generalized likelihood ratio processor (DDL-GLR), is proposed, and its detection performance is studied in detail. It is shown that the DDL-GLR is a data-efficient implementation of the high-order optimum detector and has several advantages of practical importance over the adaptive processors     

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     

Optimum Active Array Processing Structure and Space-Time Factorability

An active array processor is concerned with the problem of detecting a signal echo, reflected from a target, in the presence of reverberation (clutter). The processor can also be used to estimate target range and bearing. It is a priori not evident whether the optimum (likelihood ratio) detector can be factored into spatial and temporal operations, thus resulting in a simpler processor implementation. This paper studies this problem for a linear continuous array in a reverberation-limited environment. Conditions on signal, reverberation, and array parameters are derived under which the optimum detector is factorable. The validity of using factorability as a criterion of signal design is briefly examined. Finally, the relationship between space-time factorability and range-bearing estimates is pointed out.     

Optimum detection and location estimation of target lines in the range-time space of a search radar

The average likelihood ratio detector is derived as the optimum detector for detecting a target line with unknown normal parameters in the range-time data space of a search radar, which is corrupted by Gaussian noise. The receiver operation characteristics of this optimum detector is derived to evaluate its performance improvement in comparison with the Hough detector, which uses the return signal of several successive scans to achieve a non-coherent integration improvement and get a better performance than the conventional detector. This comparison, which is done through analytic derivations and also through simulation results, shows that the average likelihood ratio detector has a better performance for different SNR values. This result is justified by showing the disadvantages of the Hough method, which are eliminated by the optimum detector. To have an estimate for the location of the detected target line in the optimum detection method as the Hough method, which detects and localizes the target lines simultaneously, we present the maximum a posteriori probability estimator. The estimation performance of the two methods is then compared and it is shown that the maximum a posteriori probability estimator localizes the detected target lines with a better performance in comparison with the Hough method.     

Vector subspace detection in compound-Gaussian clutter. Part I: survey and new results

Deals with the problem of detecting subspace random signals against correlated non-Gaussian clutter exploiting different degrees of knowledge on target and clutter statistical characteristics. The clutter process is modeled by the compound-Gaussian distribution. In the first part of the paper, the optimum Neyman-Pearson (NP) detector, the generalized likelihood ratio test (GLRT), and a constant false-alarm rate (CFAR) detector are sequentially derived both for the Gaussian and the compound-Gaussian scenarios. Different interpretations of the various detectors are provided to highlight the relationships and the differences among them. In particular, we show how the GLRT detector may be recast into an estimator-correlator form and into another form, namely a generalized whitening-matched filter (GWMF), which is the GLRT detector against Gaussian disturbance, compared with a data-dependent threshold. In the second part of this paper, the proposed detectors are tested against both simulated data and measured high resolution sea clutter data to investigate the dependence of their performance on the various clutter and signal parameters.     

Optimum and mismatched detection against K-distributed plusGaussian clutter

We derive the optimum radar receiver to detect fluctuating and non-fluctuating targets against a disturbance which is modeled as a mixture of coherent K-distributed and Gaussian-distributed clutter. In addition, thermal noise, which is always present in the radar receiver, is considered. We discuss the implementation of the optimum coherent detector, which derives from the likelihood ratio test under the assumption of perfectly known disturbance statistics, and evaluate its performance via a numerical procedure, when possible, and via Monte Carlo simulation otherwise. Moreover, we compare the performance of the optimum detector with those of two detectors which are optimum for totally Gaussian and totally K-distributed clutter respectively, when they are fed with such a mixed disturbance. We conclude that, though the optimum detector has a larger computational cost, it provides sensibly better detection performance than the mismatched detectors in a number of operational situations. Thus, there is a need to derive suboptimum target detectors against the mixture of disturbances which trade-off the detection performance and the implementation complexity     

Approximate Maximum Likelihood Algorithm for Moving Source Localization Using TDOA and FDOA Measurements

 A closed-form approximate maximum likelihood (AML) algorithm for estimating the position and velocity of a moving source is proposed by utilizing the time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements of a signal received at a number of receivers. The maximum likelihood (ML) technique is a powerful tool to solve this problem. But a direct approach that uses the ML estimator to solve the localization problem is exhaustive search in the solution space, and it is very computationally expensive, and prohibits real-time processing. On the basis of ML function, a closed-form approximate solution to the ML equations can be obtained, which can allow real-time implementation as well as global convergence. Simulation results show that the proposed estimator achieves better performance than the two-step weighted least squares (WLS) approach, which makes it possible to attain the Cram閞-Rao lower bound (CRLB) at a sufficiently high noise level before the threshold effect occurs.     

PAM approach to weak CPM and its application to flight termination receivers

A method for computing the PAM representation for weak continuous phase modulation (CPM) is presented and applied to the modulation defined in the enhanced flight termination system (EFTS) standard. The pulse-amplitude modulation (PAM) representation was used to formulate a reduced-complexity detector whose performance is within 0.7 dB of maximum likelihood detection and 5.6 dB better than limiter-discriminator detection in the additive white Gaussian noise (AWGN) environment. The complexity of the reduced-complexity detector is less than 25% that of the maximum likelihood detector but, unlike the limiter-discriminator detector, requires a carrier phase PLL. In the presence of phase noise, the reduced-complexity detector outperforms limiter-discriminator detection when the RMS frequency deviation due to phase noise is less than 10% of the bit rate.     

Parametric Rao Test for Multichannel Adaptive Signal Detection

The parametric Rao test for a multichannel adaptive signal detection problem is derived by modeling the disturbance signal as a multichannel autoregressive (AR) process. Interestingly, the parametric Rao test takes a form identical to that of the recently introduced parametric adaptive matched filter (PAMF) detector for space-time adaptive processing (STAP) in airborne surveillance radar systems and other similar applications. The equivalence offers new insights into the performance and implementation of the PAMF detector. Specifically, the Rao/PAMF detector is asymptotically (for large samples) a parametric generalized likelihood ratio test (GLRT), due to an asymptotic equivalence between the Rao test and the GLRT. The asymptotic distribution of the Rao test statistic is obtained in closed form, which follows an exponential distribution under the null hypothesis H ₀ and, respectively, a noncentral Chi-squared distribution with two degrees of freedom under the alternative hypothesis H ₁. The noncentrality parameter of the noncentral Chi-squared distribution is determined by the output signal-to-interference-plus-noise ratio (SINR) of a temporal whitening filter. Since the asymptotic distribution under H ₀ is independent of the unknown parameters, the Rao/PAMF asymptotically achieves constant false alarm rate (CFAR). Numerical results show that these results are accurate in predicting the performance of the parametric Rao/PAMF detector even with moderate data support.     

非相干Rice杂波中的恒虚警检测

 地杂波的统计特性常常可以用Rice模型来描述,其物理基础是认为地杂波由一些大的固定散射体引起的稳定分量和大量小的随机分布的运动散射体引起的瑞利起伏分量所合成。文献[2]研究了稳定分量不相干时Rice杂波中离散时间最佳检测的估值器——相关器结构,但无显式解,实现有困难。文献[3]导出了Rice杂波中SwerlingⅡ目标的离散时间检测的似然比检测器结构。在此基础上,本文给出了一种修正平方律结构的似然比检测器,并和通常的平方律检测器作了性能比较。     

An adaptive array detector with mismatched signal rejection

An adaptive detection algorithm with a sensibility parameter for rejecting unwanted signals is presented. This algorithm is a simple modification of the generalized likelihood ratio (GLR) detector (or test) for detecting a signal in zero mean Gaussian noise with unknown correlation matrix. Specifically, the adaptive detection algorithm is obtained by introducing an arbitrary positive scalar, which is called the sensitivity parameter, into the GLR detector as a multiplier of an already existing quadratic term. The GLR detector then becomes a special case of this detector for the unity sensitivity parameter. It is shown that the sensitivity parameter controls the degree to which unwanted signals are rejected. From numerical examples, it is demonstrated how the sensitivity parameter can be chosen such that unwanted signals, can be rejected while maintaining acceptable detection loss for slightly mismatched signals. Further insight into previous work on adaptive detection is also given     

无需辅助数据的分布式目标自适应检测器

在非高斯背景和没有辅助数据的条件下,研究了高分辨率雷达分布式目标的自适应检测问题.首先采用有序检测理论和协方差矩阵的迭代估计方法粗略估计散射点集合,进一步利用迭代估计方法获得协方差矩阵的近似最大似然估计,提出了无需辅助数据的自适应检测器(ADWSD).ADWSD在非高斯背景下具有近似恒虚警率特性,且检测性能远好于修正的...     

Spatial Correlation of Reverberation Noise in Active Sonar

A linear array of hydrophones is considered for detecting a signal echo from a stationary target in the presence of reverberation. The structure of the optimum (likelihood ratio) detector is compared with that of a beamformer-matched filter detector. The conditions causing an increase in the spatial noise correlation between two hydrophones are the conditions under which the optimum spatial detector performs significantly better than the beamforming detector. A study of the space-time correlation function of reverberation shows that 1) a decrease in scatterer angular spread (or a narrowing of the receiver directivity pattern) tends to increase the spatial correlation, 2) if the scatterer Doppler spread is much less than the signal carrier frequency and if the angular spread is uniform, it is still possible to get a high correlation if the intersensor distance is much smaller than the carrier wavelength. These conditions indicate situations where optimum techniques may be worthwhile.     

Structures for radar detection in compound Gaussian clutter

The problem of coherent radar target detection in a background of non-Gaussian clutter modeled by a compound Gaussian distribution is studied here. We show how the likelihood ratio may be recast into an estimator-correlator form that shows that an essential feature of the optimal detector is to compute an optimum estimate of the reciprocal of the unknown random local power level. We then proceed to show that the optimal detector may be recast into yet another form, namely a matched filter compared with a data-dependent threshold. With these reformulations of the optimal detector, the problem of obtaining suboptimal detectors may be systematically studied by either approximating the likelihood ratio directly, utilizing a suboptimal estimate in the estimator-correlator structure or utilizing a suboptimal function to model the data-dependent threshold in the matched filter interpretation. Each of these approaches is studied to obtain suboptimal detectors. The results indicate that for processing small numbers of pulses, a suboptimal detector that utilizes information about the nature of the non-Gaussian clutter can be implemented to obtain quasi-optimal performance. As the number of pulses to be processed increases, a suboptimal detector that does not require information about the specific nature of the non-Gaussian clutter may be implemented to obtain quasi-optimal performance     

Difference beam aided target detection in monopulse radar

The classical detection step in a monopulse radar system is based on the sum beam only,the performance of which is not optimal when target is not at the beam center. Target detection aided by the difference beam can improve the performance at this case. However, the existing difference beam aided target detectors have the problem of performance deterioration at the beam center, which has limited their application in real systems. To solve this problem, two detectors are proposed in this paper. Assuming the monopulse ratio is known, a generalized likelihood ratio test(GLRT) detector is derived, which can be used when targeting information on target direction is available. A practical dual-stage detector is proposed for the case that the monopulse ratio is unknown. Simulation results show that performances of the proposed detectors are superior to that of the classical detector.     

Optimum Detection of an Optical Image on a Photoelectric Surface

The detection of an optical image in the presence of uniform background light is based on a likelihood ratio formed of the numbers of photoelectrons emitted from small elements of a photoelectric surface onto which the image is focused. When diffraction is negligible and the surface has unit quantum efficiency, this detector is equipollent with the optimum detector of the image-forming light. Its performance is compared with that of the threshold detector and that of a detector basing its decisions on the total number of photoelectrons from a finite area of the image. The illuminance of the image is postulated to have a Gaussian spatial distribution. All three detectors exhibit nearly the same reliability.     

Nonlinear clutter cancellation and detection using a memory-basedpredictor

In this paper, a nonlinear prediction (NLP) method is proposed as an alternative to the conventional linear prediction (LP) method for clutter cancellation. Because of the nonlinearity and non-Gaussianity of a clutter process, a nonlinear predictor is therefore needed to suppress clutter optimally. A memory-based predictor which uses a table look-up strategy to perform NLP is used in this work. The advantages of the memory-based approach are fast learning, algorithmic simplicity, robustness and suitability for parallel implementation. The memory-based predictor is then used as an adaptive detector for small surface target detection embedded in clutter. The effectiveness of the new method is demonstrated using real sea clutter data, and the results show improvement when compared with the conventional LP techniques     

Fast converging adaptive processor or a structured covariance matrix

The use of adaptive linear techniques to solve signal processing problems is needed particularly when the interference environment external to the signal processor (such as for a radar or communication system) is not known a priori. Due to this lack of knowledge of an external environment, adaptive techniques require a certain amount of data to cancel the external interference. The number of statistically independent samples per input sensor required so that the performance of the adaptive processor is close (nominally within 3 dB) to the optimum is called the convergence measure of effectiveness (MOE) of the processor. The minimization of the convergence MOE is important since in many environments the external interference changes rapidly with time. Although there are heuristic techniques in the literature that provide fast convergence for particular problems, there is currently not a general solution for arbitrary interference that is derived via classical theory. A maximum likelihood (ML) solution (under the assumption that the input interference is Gaussian) is derived here for a structured covariance matrix that has the form of the identity matrix plus an unknown positive semi-definite Hermitian (PSDH) matrix. This covariance matrix form is often valid in realistic interference scenarios for radar and communication systems. Using this ML estimate, simulation results are given that show that the convergence is much faster than the often-used sample matrix inversion method. In addition, the ML solution for a structured covariance matrix that has the aforementioned form where the scale factor on the identity matrix is arbitrarily lower-bounded, is derived. Finally, an efficient implementation is presented.     

Second time around radar return suppression using PRI modulation

A technique for suppressing second-time-around radar returns using pulse-repetition interval (PRI) modulation is presented and analyzed. It is shown that a staggered PRI radar system can offer considerable improvement over a nonstaggered radar system in rejecting second-time-around returns which cause false alarms. This improvement is a function of detector implementation (noncoherent integrator or binary integrator), the number of staggered PRIs, the quiescent false alarm number, the Swerling number of the false return, the transmitted signal power, the second-time-around noise power, and the quiescent noise power of the radar. Small changes in transmitted signal power can be traded off with the quiescent false alarm number to suppress the bogus return significantly. In addition, for a noncoherent integrator, all other parameters being equal, if the second-time-around return is a Swerling case II or IV target, then there is an optimum number of staggered PRIs that can be chosen to minimize the likelihood of its detection. It is also shown that the binary integrator significantly reduces the number of second-time-around return detections when compared with the noncoherent integrator. However, there is an accompanying loss of detection