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     

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     

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     

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     

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     

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     

Identification of rational transfer function from frequencyresponse sample

A method for identifying a transfer function, H(z)=A(z)/B(z), from its frequency response values is presented. Identifying the transfer function involves determining the unknown degrees and coefficients of the polynomials A(z) and B( z), given the frequency response samples. The method for finding the parameters of the transfer function involves solving linear simultaneous equations only. An important aspect of the method is the decoupled manner in which the polynomials A(z) and B(z) are determined. The author presents two slightly different derivations of the linear equations involved, one based on the properties of divided differences and the other using Vandermonde matrices or, equivalently, Lagrange interpolation. A matrix synthesized from the given frequency response samples is shown to have a rank equal to the number of poles in the system     

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     

CCRS C/X-airborne synthetic aperture radar: An Rand D tool for the ERS-1 time frame

The airborne synthetic-aperture radar (SAR) system developed for the Canada Centre for Remote Sensing (CCRS) is described. It consists of two radars, at C-band and X-band. Each radar incorporates the following features: dual-channel receivers and dual-polarized antennas; a high quality, 7-look, real-time processor; a sensitivity time control for range-dependent gain control; a motion-compensation system for antenna steering in azimuth and elevation; and baseband I and Q signal phase rotation. The system also uses a high-power transmitter with a low-power back-up. The SAR maps to either side of the aircraft, at high or low resolution, at incidence angles which in high resolution span 0° to 80°. Radar operating parameters, data products, key specifications and the motion compensation scheme used are presented. Properties of the real-time imagery are discussed and examples of C-band SAR data in the three operating modes are given     

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     

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     

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     

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     

Simplified analysis of PWM converters using model of PWM switch.II. Discontinuous conduction mode

For pt.I see ibid., vol.26, no.3, p.490-6 (1990). According to the method of state-space averaging, when a pulsewidth modulation (PWM) converter enters discontinuous conduction mode (DCM), the inductor current state is lost from the average model of the converter. It is shown that there is neither theoretical nor experimental justification for the disappearance of the inductor state as claimed by the method of state-space averaging. For example, when the model of the PWM switch in DCM is substituted in the buck, boost, or buck-boost converter while the inductor is left intact, the average model has two poles: the first pole f_p1 agrees with the single pole of state-space averaging, while the second pole f_p2 occurs in the range f_p2⩾F_s/π. It is shown that the right-half plane zeros present in the control-to-output transfer functions of the boost, buck-boost, and Cuk converters in continuous conduction mode are also present in discontinuous conduction mode     

Performance evaluation of a cascaded logic for track formation inclutter

The authors present a Markov-chain-based performance evaluation technique for two-stage sliding-window cascaded logic (2/2×m /n) for track formation in a cluttered environment. The main features of this technique are that it avoids the need for extensive simulations and it is more realistic than previous methods, accounting for the association gate size variation. The gates are obtained from a Kalman filter and fully account for the transient observed for the cascaded logic following the two-point initiation from its first stage. Numerical examples of performance evaluation are given along with a logic design example     

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     

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     

On-board multibeam deployable antennas using Ka,C, andS frequency bands

The configuration, on-ground tests, and design verification results for the multibeam antenna flight model for Engineering Test Satellite-VI (ETS-VI) are described for onboard multibeam antennas with thirteen and five beams for the Ka- and S-bands, respectively. The antennas feature Ka-band frequency reuse in alternate beams through use of a cluster horn; shared use of a reflector for two frequency bands using a novel frequency selective surface (FSS); large, lightweight deployable main reflectors with diameters of 3.5 m and 2.5 m; and a highly accurate antenna-pointing control system consisting of RF sensors and an antenna-pointing mechanism to drive the subreflector     

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     

Performances of order statistics CFAR

A previous analysis of order-statistics constant-false-alarm-rate (OS-CFAR) radar receiving a single pulse from a Rayleigh fluctuating target in a Rayleigh background is extended to a Rayleigh-plus-dominant target. The analysis includes effects of a multitarget environment. A detailed comparison of OS-CFAR, cell-averaging (CA) CFAR, and censored CA-CFAR is provided for a Rayleigh target in the presence of strongly interfering targets. The false-alarm analysis of OS-CFAR is extended to the more general case of a Weibull background. The deterioration of the CFAR property of OS as the shape factor, C, of a Weibull probability density function changes from Rayleigh (C=2) to a longer-tailed one (C<2) is evaluated. The analytic comparison between CA-CFAR and OS-CFAR is extended to an integration of pulses reflected from a Swerling II target. The OS-CFAR performance (with and without interfering targets) yields an integral equation that is solved numerically