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     

Finding the best set of K paths through a trellis withapplication to multitarget tracking

A solution is presented to the problem of finding the best set of K completely unmerged paths through a trellis with M _i⩾K states at depth i in the trellis, i=0, 1, 2, . . ., N. Here, `best set' means that the sum of the metrics of all K paths in the set is minimized, and `completely unmerged' means that no two paths pass through a common state. The solution involves using the Viterbi algorithm on an expanded trellis. This result is then used to separate the tracks of K targets optimally in a simplified model of a multitarget radar system. The model includes measurement errors and false alarms, but it does not include the effects of missing detections or merged measurements     

Detection performance in K-distributed and correlatedRayleigh clutters

Performance prediction for a detection system employing noncoherent integration is carried out for a chi-square family of fluctuating targets in K-distributed clutter plus noise. The detection performance for Swerling 11 targets in the K-distributed clutter plus noise is compared with that in exponentially correlated Rayleigh clutter. The results show that the performance prediction based on N pulses integrated in clutter plus noise using the K-distributed clutter model may be approximately equivalent to that using the exponentially correlated Rayleigh-distributed clutter model     

CFAR data fusion center with inhomogeneous receivers

Detection systems with distributed sensors and data fusion are increasingly used by surveillance systems. A system formed by N inhomogeneous constant false alarm rate (CFAR) detectors (cell-averaging (CA) and ordered statistic (OS) CFAR detectors) is studied. A recursive formulation of an algorithm that permits a fixed level of false alarms in the data fusion center is presented, to set the optimum individual threshold levels in the CFAR receivers and the optimum `K out of N' decision rule in order to maximize the total probability of detection. The algorithm also considers receivers of different quality or with different communication channel qualities connecting them with the fusion center. This procedure has been applied to several hypothetical networks with distributed CA-CFAR and OS-CFAR receivers and for Rayleigh targets and interference, and it was seen that in general the fusion decision OR rule is not always the best     

Collapsing losses of peak signal integrators

Collapsing losses are computed for systems in which the peak return of K samples of noise plus one sample of signal-plus-noise are integrated over N looks. The statistical approach, collapsing losses, and an application are described. The peak integrator is found to have substantially lower collapsing losses than conventional systems in which the average, not the peak, is integrated     

Tracking multitarget in cluttered environment

A method for multitarget tracking and initiating tracking in a cluttered environment is proposed. The algorithm uses a sliding window of length uT (T is the sampling time) to keep the measurement sequence at time k. Instead of solving a large problem, the entire set of targets and measurements is divided into several clusters so that a number of smaller problems are solved independently. When a set of measurements is received, a new set of data-association hypotheses is formed for all the measurements lying in the validation gates within each cluster from time K-u+1 to K. The probability of each track history is computed, and, choosing the largest of these histories, the target measurement is updated with an adaptive state estimator. A covariance-matching technique is used to improve the accuracy of the adaptive state estimator. In several examples, the algorithm successfully tracks targets over a wide range of conditions     

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     

Periodic ambiguity function of CW signals with perfect periodicautocorrelation

A periodic ambiguity function (PAF) is discussed which describes the response of a correlation receiver to a CW signal modulated by a periodic waveform, when the reference signal in the receiver is constructed from an integral number N, of periods T, of the transmitted signal. The PAF is a generalization of the periodic autocorrelation function, to the case of non-zero Doppler shift. It is shown that the PAF of N periods is obtained by multiplying the PAF of a single period by the universal function sin(Nπν T)/N sin(πνT), where ν is the Doppler shift, to phase-modulated signals which exhibit perfect periodic autocorrelation when there is no Doppler shift. The PAF of these signals exhibits universal cuts along the delay and Doppler axes. These cuts are functions only of t, N and the number M, the modulation bits in one period     

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     

Low-altitude target detection by coastline operated marine radar

Relevant to a Richian family of fluctuating targets with a composite background of sea-plus-land clutter, the performance prediction of a radar operating in near-coastal regions is elucidated by assuming noncoherent integration of the pulses. Considering the dominance of land clutter, a modified K-distributed statistic is indicated for the overall clutter envelope; and the corresponding probability of false alarm and probability of detection are deduced for fixed threshold detection (s) based on N pulses integrated in the presence of the sea-plus-land clutter and the noise. Even when the target offers a dominant scattered echo, the worst situations of the land clutter affecting the detection performance are indicated     

Tracking multiple targets with correlated measurements andmaneuvers

The problem of tracking N targets with correlation in both measurement and maneuver statistics is solved by transforming to a coordinate frame in which the N targets are decoupled. For the case of N identical targets, the decoupling is shown to coincide with a transformation to a set of nested center-of-mass coordinates. Absolute and differential tracking accuracies are compared with suboptimal results to show the improvement that is achieved by properly exploiting the correlation between targets     

CW alternatives to the coherent pulse train-signals and processors

Continuous wave (CW) signals phase modulated by a periodic waveform, and their corresponding receivers, are discussed. The combined response in delay and Doppler is almost identical to the (ideal) response of the coherent pulse train. The receivers are matched to an integral number N of modulation periods of the transmitted signal. CW implies a duty cycle of 100%. However, the signal duration need not be longer than N+2 periods. The CW signals have the advantage that their peak power is equal to the average power. Their disadvantages are more complicated receiver processing and the need for two antennas     

Frequency diversity in millimeter wave satellite communications

Dual-band frequency diversity seems to be an effective fade countermeasure to rain-induced attenuation in satellite communications above 20 GHz. This method, particularly suited for satellites operating in two frequency bands, typically K_a band and C or K_u band, achieves very low levels of outage probability especially where the rain fades are severe. A theoretical analysis of a frequency diversity system is performed to evaluate the amount of reserve capacity needed to counteract fading in a satellite network. The problems that arise in implementing adaptive fade countermeasures because of the dynamic characteristics of fading are discussed, and the results of the simulations performed using the attenuation time series at 11.6 GHz, measured with the Sirio satellite throughout four years, are presented     

Optimal speckle reduction in polarimetric SAR imagery

Speckle is a major cause of degradation in synthetic aperture radar (SAR) imagery. With the availability of fully polarimetric SAR data, it is possible to use the three complex elements (HH, HV, VV) of the polarimetric scattering matrix to reduce speckle. The optimal method for combining the elements of the scattering matrix to minimize image speckle is derived, and the solution is shown to be a polarimetric whitening filter (PWF). A simulation of spatially correlated, K-distributed, fully polarimetric clutter is then used to compare the PWF with other, suboptimal speckle-reduction methods. Target detection performance of the PWF, span, and single-channel |HH|² detectors is compared with that of the optimal polarimetric detector (OPD). A novel, constant-false-alarm-rate (CFAR) detector (the adaptive PWF) is as a simple alternative to the OPD for detecting targets in clutter. This algorithm estimates the polarization covariance of the clutter, uses the covariance to construct the minimum-speckle image, and then tests for the presence of a target. An exact theoretical analysis of the adaptive PWF is presented; the algorithm is shown to have detection performance comparable with that of the OPD     

Efficient algorithms for finding the K best paths througha trellis

A set of algorithms is presented for finding the best set of K mutually exclusive paths through a trellis of N nodes, with worst-case computation time bounded by N³log n for a fixed-precision computation. The algorithms are based on a transformation of the K-path trellis problem into an equivalent minimum-cost network flow (MCNF) problem. The approach allows the application of efficient MCNF algorithms, which can obtain optimal solutions orders of magnitude faster than the algorithm proposed by J.K. Wolf et al. (1989). The resulting algorithms extend the practicality of the trellis formulation (in terms of required computations) to multiobject tracking problems with much larger numbers of targets and false alarms. A response by Wolf et al. is included     

Binary integration of fluctuating targets

The detection performance of a binary integrator (M-out-of-N detector) against nonfluctuating, slowly fluctuating, and quickly fluctuating targets is given. Since the solution for the slowly fluctuating target is numerically intensive, a simpler approximate solution is developed. This approximation is very accurate and is valid even when the noise power varies from pulse to pulse within a single antenna scan     

A sampling-based approach to wideband interference cancellation

Classical adaptive array schemes which use only complex spatial weights are inherently narrowband and consequently perform poorly when attempting to suppress wideband interference. The common solution to this problem is the use of tapped delay line filters in each spatial channel to facilitate space-time adaptive processing (STAP). The higher performance provided by the STAP architecture comes at the cost of a considerable increase in complexity. This paper presents a simpler technique based on programmable time adjustable sampling (TAS) that provides a limited number of wideband degrees of freedom. Two TAS methods are introduced: TAS-sidelobe canceler (TAS-SLC) is based on the sidelobe canceler, while TAS-minimum variance beamformer (TAS-MVB) is derived from the minimum variance beamformer. TAS is implemented by adjusting the sampling instant at selected array channels. TAS-SLC consists of controlling the sampling in the main channel of the sidelobe canceler With TAS-MVB array complex weights are substituted with TAS time delays. The performance of TAS methods with wideband interference is compared to the conventional sidelobe canceler and minimum variance beamformers. It is shown that TAS-SLC provides better performance than the sidelobe canceler, while TAS-MVB outperforms the minimum variance beamformer     

Multiple target angle tracking using sensor array outputs

The use of the output of an array of sensors to track multiple independently moving targets is reported. The output of each sensor in the array is the sum of signals received from each of the targets. The results of direction-of-arrival estimation by eigenvalue analysis are extended to derive a recursive procedure based on a matrix quadratic equation. The solution of this matrix quadratic equation is used to provide updated target positions. A linear approximation method for estimating the solution of the matrix equation is presented. The algorithm is demonstrated by the simulated tracking of two targets. The main advantage of the algorithm is that a closed-form solution for updating the target angle estimates has been obtained. Also, its application is straightforward, and the data association problem due to uncertainty in the origin of the measurements is avoided. However, it requires the inversion of an N×N as well as other linear operations, so that the computational burden becomes substantial as N becomes very large     

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     

Optimal serial distributed decision fusion

The problem of distributed detection involving N sensors is considered. The configuration of sensors is serial in the sense that the Jth sensor decides using the decision it receives along with its own observation. When each sensor uses the Neyman-Pearson test, the probability of detection is maximized for a given probability of false alarm, at the Nth stage. With two sensors, the serial scheme has a performance better than or equal to the parallel fusion scheme analyzed in the literature. Numerical examples illustrate the global optimization by the selection of operating thresholds at the sensors