Bounds on Elevation Error Estimates of a Target in Multipath

The Cramer-Rao bound for an unbiased estimate of the elevation angle of a target in the presence of multipath is calculated for the symmetric (target and image symmetric about the elevation symmetry plane of antenna) and nonsymmetric cases for an antenna consisting of 21 elements. These bounds are compared to the maximum likelihood estimates and it is found that the rms error of the maximum likelihood estimate (which has a bias) is below the Cramer-Rao bound for unbiased estimates.     

An Automatic System for the Control of Multiple Drone Aircraft

A conceptual system is proposed and described for the control of a multiplicity of drone aircraft. Each target (drone) aircraft is controlled, during a given mission, over a separate preprogrammed path comprised of straight line and circular arc segments. Full control of each target's altitude, plan position, and velocity is available. Position measurement can be obtained by use of either a radar or a bilateration method where altitude is measured in either case by each aircraft and telemetered to a central control point. Velocity is obtained by smoothing position data in a central computer, which also controls the entire mission complex.     

DO 28飞行试验数据一致性检验

 本文研究DO28试验机飞行试验数据一致性检验及其误差校正。建立了由非线性运动学方程及内容广泛的校正环节构成的一致性检验模型,解决了大地风场重构、测量信号时间延迟估计、ψ转换及测量控制信号的校正。为DO28参数估计提供了可靠、准确的飞行试验数据。     

Model-based segmentation of FLIR images

The use of gray-scale intensities together with the edge information present in a forward-looking infrared (FLIR) image to obtain a precise and accurate segmentation of a target is presented. A model of FLIR images based on gray-scale and edge information is incorporated in a gradient relaxation technique which explicitly maximizes a criterion function based on the inconsistency and ambiguity of classification of pixels with respect to their neighbors. Four variations of the basic technique which provide automatic selection of thresholds to segment FLIR images are considered. These methods are compared, and several examples of segmentation of ship images are given     

False alarm control using Doppler estimation

A technique which uses maximum-likelihood estimates (MLEs) of target Doppler and target amplitude is developed for rejecting clutter residues. Multiple estimates are made and consistency checks are applied to the estimates. Simulation results indicate that for large clutter-to-noise ratios (C/N⩾55 dB) the probability of false alarm from clutter residues is reduced from 1.0 to below 0.01     

Comments with reply, on `A new look at nonseparable syntheticaperture radar processing' by A. Di Cenzo

The commenters point out that the idea using a two-dimensional digital correlation technique to perform synthetic-aperture-radar (SAR) processing, presented as new in the above-titled paper (see ibid., vol.24, p.218-23, May 1988), was described by them as early as 1978 and has since been described by other authors. They discuss some of these earlier studies. The author replies that he was unaware of the earlier work, and that he did not intend to convey the impression that the nonseparable transform domain processor that he presented was the first     

Comparison of half-bridge off-line, ZCS-QRC and ZVS-MRC

The performance of the half-bridge (HB) zero-current-switched (ZCS) quasi-resonant converter (QRC) and zero-voltage-switched (ZVS) multiresonant converter (MRC) is compared with respect to their efficiency, input voltage range, semiconductor stresses, power density, and reliability. The efficiency of the HB ZVS-MRC at a given nominal input is shown to be highly dependent on the range of the input voltage, and it suffers when the converter has to be designed to cover a wide range. However, this is not the case for the HB ZCS-QRC. Experimental versions of the HB ZCS-QRC and HB ZVS-MRC were designed for the input voltage range from 150 to 350 V and a maximum output power of 100 W, under the same constraints, to facilitate their comparison     

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