Systolic array implementation of second-order Kalman filter

The approach for design of parallel implementation of the second-order Kalman filter using systolic array processors is proposed. The original time complexity of more than 27n³ for sequential processing can be reduced to only 21n+10r-4 in the proposed parallel implementation. The improvement is gained from the utilization of interarray pipelining, concurrent processing and substitution forwarding techniques. The approach is especially suitable for real-time application of the Kalman filter in solving second-order linear system     

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     

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     

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     

航天器相对运动估计的一种并行推广卡尔曼滤波方法

 从并行的观点出发，研究应用推广卡尔曼滤波估计航天器交会对接寻的期相对位置和速率问题。推导出交会推广卡尔曼滤波公式；提出了基于奇异值分解（ＳＶＤ）和Ｆａｄｄｅｖ算法的并行平方根算法；给出了其脉动阵列（Ｓｙｓｔｏｌｉｃ）实现结构；并对阵列所需的处理单元数目和执行一次迭代所需的时间步进行了分析，说明了其实现的优越性。为航天器相对运动估计提供了一种新的有效方法     

Buck-flyback DC-DC converter

It is difficult to obtain a large input/output voltage ratio with a DC-DC converter, because the duty factor d may not reach very small values. For the same reason, it is difficult to obtain an output voltage that is adjustable in a large range. A DC-DC converter circuit is proposed that overcomes this limitation by performing a voltage ratio d²/(1-d) in the best operating mode. Circuit operation is analyzed, operating modes are evidenced, and the voltage ratio is deduced in each operating mode as a function of output current, duty factor, and circuit component values. Boundary conditions between different operating modes are obtained; consequently, it is concluded that these conditions do not occur for some operating modes. Component ratings are summarized, to facilitate circuit design. The buck-flyback DC-DC converter is very suitable for low-voltage (e.g. computer) power supplies and for power supplies with the output voltage (adjustable in a large range) supplied from the mains without a mains voltage transformer     

Digital system design in the presence of single event upsets

The authors consider the effects of single event upsets (SEUs) on digital systems, and show techniques for designing reliable systems with current levels of SEU protection. Three main systems are discussed: main memory, logic, and cache memory. A design for the main and cache memory subsystems that are SEU protected is also described. With SEU defined in bit days p, and using single error correction, it is shown that for all subsystems considered, an effective upset rate which is proportional to the product of p² and the time between corrections, or scrub time, can be obtained. Data for memory chip size and performance derived from the gallium-arsenide (GaAs) pilot lines funded by the Defense Advanced Research Projects Agency (DARPA) throughout the 1980s are used     

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     

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     

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     

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     

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     

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     

Decentralized CFAR signal detection

The authors develop the theory of CA-CFAR (cell-averaging constant false-alarm rate) detection using multiple sensors and data fusion, where detection decisions are transmitted from each CA-CFAR detector to the data fusion center. The overall decision is obtained at the data fusion center based on some k out of n fusion rule. For a Swerling target model I embedded in white Gaussian noise of unknown level, the authors obtain the optimum threshold multipliers of the individual detectors. At the data fusion center, they derive an expression for the overall probability of detection while the overall probability of false alarm is maintained at the desired value for the given fusion rules. An example is presented showing numerical results     

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     

Target tracking in maneuver-centered coordinates

Aircraft targets normally maneuver on circular paths, which has led to tracking filters based on circular turns. A coordinate system to track circular maneuvers with a simple Kalman filter is introduced. This system is a polar coordinate system located at the center of the maneuver. It leads to a tracking filter with range, angle, and angular velocity in the state vector. Simulation results are presented, showing that the algorithm displays improved performance over methods based on constant x-y acceleration when tracking circular turns     

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 divide and conquer approach to least-squares estimation

The problem of estimating parameters &thetas; which determine the mean μ(&thetas;) of a Gaussian-distributed observation X is considered. It is noted that the maximum-likelihood (ML) estimate, in this case the least-squares estimate, has desirable statistical properties but can be difficult to compute when μ(&thetas;) is a nonlinear function of &thetas;. An estimate formed by combining ML estimates based on subsections of the data vector X is proposed as a computationally inexpensive alternative. The main result is that this alternative estimate, termed here the divide-and-conquer (DAC) estimate, has ML performance in the small-error region when X is appropriately subdivided. As an example application, an inexpensive range-difference-based position estimator is derived and shown by means of Monte-Carlo simulation to have small-error-region mean-square error equal to the Cramer-Rao lower bound     

Optimal weight extraction for adaptive beamforming using systolicarrays

Systolic algorithms and architectures for parallel and fully pipelined instantaneous optimal weight extraction for multiple sidelobe canceller (MSC) and minimum variance distortionless response (MVDR) beamformer are presented The proposed systolic parallelogram array processors are parallel and fully pipelined, and they can extract the optimal weights instantaneously without the need for forward or backward substitution. We also show that the square-root-free Givens method can be easily incorporated to improve the throughput rate and speed up the system. As a result these MSC and MVDR systolic array weight extraction system are suitable for real-time very large scale integration (VLSI) implementation in practical radar/sonar system