Control system analysis of a hardware-in-the-loop simulation

A multivariable z-domain linear technique is presented for analyzing a simplified linear HWIL (hardware-in-the-loop) simulation model. Four complementary methods are given, consisting of singular value plots of the input LTF (loop transfer function), multivariable stability margins, closed-loop z-plane poles and zeros of the airframe, and the closed-loop system time response     

Distribution of general noncentral positive definite quadratic formin K-dimensions

The authors present a series solution using Hermite polynomials to the long-standing problem of computing the probability P that positive definite noncentral quadratic form d(x) of a Gaussian random vector x∈R satisfies d( x)⩽r² for any given r∈R. This problem has wide applications in radar, tracking, air traffic control, etc. The fast-converging series solution presented is very accurate and can be performed rapidly using the recursion relations for Hermite polynomials     

Nonparametric rank detectors on quantized radar video signals

Uniform randomization of ties is required for defining distribution-free ranks of independent and identically distributed quantized samples. Formulas of rank probabilities are given and applied to radar detection under quantized video samples. For some detectors, and assuming Gaussian noise, the asymptotic loss L_∞(q) is calculated versus the normalized quantization step q, and the loss L(q) is estimated by Monte Carlo simulations. Both of these resulted in monotonic functions of q (0<q<1.1) that are independent of the other parameters. Furthermore, L(q)≈L_∞(q )⩽0.45 dB, as q<0.8. The quantization step q is normalized with respect to the noise standard deviation     

On the uniform sampling of a sinusoidal signal

It is generally accepted that a monochromatic signal such as sin 2πWt (W>0) must be sampled at a uniform rate greater than the ostensible Nyquist rate of 2W samples per to effect a reconstruction of the signal. It is shown that a sinusoid of frequency W Hz is completely determined by its samples taken at the uniform rate of 2r samples per second, where r>0 is arbitrary subject only to the restriction that W ≠kr for any positive integer k. In particular, a pure sinusoid may be sampled uniformly without loss of information at arbitrarily small rates     

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     

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     

Detectability of signals in Laplace noise

Closed-form expressions for the false-alarm and detection probabilities attained by the optimum and the linear detectors of a positive signal in n independent samples of noise having a bilateral exponential or Laplace distribution require lengthy computation when n is large, and those for the optimum detector suffer from round-off error because their terms alternate in sign. It is shown how the method of saddlepoint integration can be conveniently applied to compute these probabilities, and numerical comparisons of the accuracies of the methods are presented. The relative efficiency of the two detectors is calculated as a function of n and found to approach the asymptotic value of 2 very slowly     

SAR resolution in the presence of phase errors

The author analyzes the effects of phase errors on synthetic aperture radar (SAR). The theory is applied to the following question: how does the achievable resolution vary with the carrier frequency when optimum quadratic focus and/or optimum processing interval (synthetic aperture length) are used? Numerous related results are given, so that much of the material is tutorial. For phase errors corresponding to uncompensated motion, the best achievable RMS resolution with any phase error spectrum satisfies the derived equation. For motion-induced phase errors it is seen that resolution improves with increasing carrier frequency when the first term in the expression applies (e.g. for phase errors concentrated at low frequencies) and resolution is independent of carrier frequency when R δ/v/v is the smaller term (e.g. with broad band or high frequency phase errors)     

The autocorrelation of m-sequences over nonprime finitefields

Nonbinary m-sequences (maximal length sequences) for spread-spectrum communication systems that have a two-level autocorrelation are presented. The autocorrelation function of an m -sequence over the Galois field of q elements GF(q), where q=p^k, for p a prime and k an integer greater than 1, is developed and shown to be bilevel when the elements of GF(q) are expressed as elements of a vector space over the pth roots of unity     

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     

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     

An exact expression for resolution cell area in special case ofbistatic radar systems

An exact expression for the bistatic resolution-cell area (A _B) is developed for the special case in which either the transmit or receive antenna has a broad azimuth beamwidth or is omnidirectional. Quantitative examples are presented to illustrate the variation of A_B with location. A comparison is made with the performance of a commonly used approximation formula     

Performance of receivers with linear detectors

The false-alarm and detection probabilities of a receiver summing M independent outputs of a linear detector are calculated by numerical saddlepoint integration. The saddlepoint approximation is also considered. Both constant-amplitude and Rayleigh-fading signals are treated, and the relative efficiency of the quadratic and the linear detectors for these is calculated for a broad range of values of M . The numerical integration method is the more efficient, the smaller the false-alarm probability or the false-dismissal probability, that is, under just those conditions for which the terms in the Gram-Charlier series oscillate most violently and the series becomes least reliable. The simpler saddlepoint approximation yields values that in those same regions have been found close enough to the exact probabilities to be adequate for most engineering purposes. The larger the number M of samples, the more efficient methods are     

Optimum gain control for A/D conversion using digitized I/Q data inquadrature sampling

Calculation of optimum gain for minimum distortion due to A/D (analog-to-digital) conversion requires the estimation of the input signal strength. To use a common AGC (automatic gain control) for both the I/Q (in-phase and quadrature) signals, it is efficient to estimate the input signal strength using the quantized A/D output from both channels. Assuming a Gaussian input, the relationship between σ of the input of the A/D converter and E(|x|+|y|) and E(max(|x|,|y|)+1/2 min (|x|,|y|)) for t quantized I/Q output x and y is derived. Numerical results obtained using the derived expression and the statistical data obtained through simulation show excellent agreement. It is concluded that, because of its simplicity, the cubic equation obtained by fitting the numerical results should be useful     

Adaptive canceler and pulse compressor interactions

Performance results for the sidelobe level of a compressed pulse that has been preprocessed through an adaptive canceler are obtained. The adaptive canceler is implemented using the sampled matrix inversion algorithm. Because of finite sampling, the quiescent compressed pulse sidelobe levels are degraded due to the preprocessing of the main channel input data stream (the uncompressed pulse) through an adaptive canceler. It is shown that if N is the number of input canceler channels (main and auxiliaries) and K is the number of independent samples per channel, then K/N can be significantly greater than one in order to retain sidelobes that are close to the original quiescent sidelobe level (with no adaptive canceler). Also it is shown that the maximum level of degradation is independent of whether pulse compression occurs before or after the adaptive canceler if the uncompressed pulse is completely contained within the K samples that are used to calculate the canceler weights. This same analysis can be used to predict the canceler noise power level that is induced by having the desired signal present in the canceler weight calculation     

A parallel square-root algorithm for modified extended Kalmanfilter

A parallel square-root algorithm and its systolic array implementation are proposed for performing modified extended Kalman filtering (MEKF). The proposed parallel square-root algorithm is designed based on the singular value decomposition (SVD) and the Faddeev algorithm, and a very large scale integration (VLSI) systolic array architecture is developed for its implementation. Compared to other square root Kalman filtering algorithms, the proposed method is more numerically stable. The VLSI architecture described has good parallel and pipelining characteristics in applying to the MEKF and achieves higher efficiency. For n-dimensional state vector estimations, the proposed architecture consists of O(2n²) processing elements and uses O ((s+17)n) time-steps for a complete iteration at each instant, in contrast to the complexity of O((s+6) n³) time-steps for a sequential implementation, where s≈log n     

Design of high-efficiency series-resonant converters aboveresonance

Power losses in series-resonant converters (SRCs) operated above resonance are examined for the purpose of developing design guidelines leading to SRC designs with the highest possible operating efficiencies. Loss expressions are formulated and analyzed as functions of normalized voltage conversion ratio M and normalized output current J for the controlled transistor switches, antiparallel diodes, bridge diodes, and resonant capacitor. Overall losses range from a low of nearly 9% to a maximum of about 17%. Operating efficiencies corresponding to these losses range from a high of 92% to a low of 85%. Operation at the maximum efficiency of 92% occurs at values of M close to unity and is not highly dependent on J. However, in a practical closed-loop regulated SRC, operation with M too close to unity could provide an insufficient design margin, given component tolerances or other variations     

Position and force control of coordinated multiple arms

A technique is presented for controlling multiple manipulators which are holding a single object and therefore form a closed kinematic chain. The object, which may or may not be in contact with a rigid environment, is assumed to be held rigidly by n robot end-effectors. The derivation is based on setting up constraint equations which reduce the 6×n degrees of freedom of n manipulators each having six joints. Additional constraint equations are considered when one or more degrees of freedom of the object is reduced due to external constraints. Utilizing the operational space dynamic equations, a decoupling controller is designed to control both the position and the interaction forces of the object with the environment. Simulation results for the control of a pair of two-link manipulators are presented     

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     

Two-valued sequences with perfect periodic autocorrelation

Periodic two-valued signals which exhibit two-level autocorrelation can, in many cases, be made to yield an out-of-phase autocorrelation value identically equal to zero. This can be achieved by replacing the two values of the sequence (normally +1 and -1) with the two values +1 and e^iφ, or with +1 and β (β real). Simple expression for φ and β are given, based on the parameters of the difference set to which such signals correspond. Another strategy is to transmit a sequence of +1s and -1s, but of +1s and bs (b real and negative). An expression for b is also obtained