An anticipative adaptive array for frequency-hopping communications

To fully utilize the theoretical processing gain achievable when an adaptive array and frequency hopping are combined, frequency compensation is required. Improved versions of an anticipative adaptive array are examined that provide efficient compensation by adapting the complex weights at each antenna element to the appropriate values for a carrier frequency before that frequency is received. The underlying adaptive algorithm used is the maximum algorithm. Computer simulation results are used to compare the different versions of anticipative processing. These results show that an appropriate version ensures the rapid convergence of weights to values that provide wideband nulling of the interference and noise     

Equivalent transformation for a partially adaptive array

A partially adaptive array is one in which elements of a phased array are controlled or adaptively weighted in groups or in which certain elements, called auxiliary elements, are made controllable. Mathematically, this type of array is formed by transforming all of the elements of an array by a nonsquare matrix such that the resulting output vector has a length less than the number of array elements. It is shown that there is an equivalent matrix transform that can effectively be utilized in analyzing the partially adaptive array's performance when a small number of external jammers are present. Processor implementation and convergence rate considerations lead to the desirability of reducing the dimensionality of the cancellation processor while maintaining good sidelobe interference protection. A meaningful measure of canceller performance is to compute the optimal output signal-to-noise ratio. This expression is a function of the jammer, direction-of-arrival vectors (DOAVs), jammer powers, the array steering vector, and internal noise. It is shown that if this expression is computed for the fully adaptive array then it is easily computed for the partially adaptive array by transforming the jammer DOAVs and the steering vector by the orthogonal projection matrix defined by the rows of the subarray transformation matrix and substituting these vectors back into the original expression for the fully adaptive array     

Median cascaded canceller for robust adaptive array processing

A median cascaded canceller (MCC) is introduced as a robust multichannel adaptive array processor. Compared with sample matrix inversion (SMI) methods, it is shown to significantly reduce the deleterious effects of impulsive noise spikes (outliers) on convergence performance of metrics; such as (normalized) output residue power and signal to interference-plus-noise ratio (SINR). For the case of no outliers, the MCC convergence performance remains commensurate with SMI methods for several practical interference scenarios. It is shown that the MCC offers natural protection against desired signal (target) cancellation when weight training data contains strong target components. In addition, results are shown for a high-fidelity, simulated, barrage jamming and nonhomogenous clutter environment. Here the MCC is used in a space-time adaptive processing (STAP) configuration for airborne radar interference mitigation. Results indicate the MCC produces a marked SINR performance improvement over SMI methods.     

Instrumental variable adaptive array processing

An instrumental variable (IV) approach is presented for estimating the weights of an adaptive antenna array. Theoretical analysis of the IV method shows that the antenna gain weights are independent of finitely correlated noise, so that unbiased estimation of signal arrival angles is possible. Only matrix inversions are required to compute the weight estimates. In this sense, the IV method provides performance comparable with eigenvector techniques but with lower computational burden. Both minimal and overdetermined IV estimators are derived. The overdetermined estimators give the same theoretical array weights as minimal estimators, but yield more accurate weight estimates in real data situations. Simulation results are presented to compare these IV methods with one another and with conventional matrix inversion weight estimators. In these examples it is seen that IV methods are able to resolve closely spaced interference sources when conventional matrix inversion techniques cannot. It is also shown that overdetermined methods are capable of providing weight estimates with lower variances than those of minimal methods     

Reiterative median cascaded canceler for robust adaptive array processing

A new robust adaptive processor based on reiterative application of the median cascaded canceler (MCC) is presented and called the reiterative median cascaded canceler (RMCC). It is shown that the RMCC processor is a robust replacement for the sample matrix inversion (SMI) adaptive processor and for its equivalent implementations. The MCC, though a robust adaptive processor, has a convergence rate that is dependent on the rank of the input interference-plus-noise covariance matrix for a given number of adaptive degrees of freedom (DOF), N. In contrast, the RMCC, using identical training data as the MCC, exhibits the highly desirable combination of: 1) convergence-robustness to outliers/targets in adaptive weight training data, like the MCC, and 2) fast convergence performance that is independent of the input interference-plus-noise covariance matrix, unlike the MCC. For a number of representative examples, the RMCC is shown to converge using ~ 2.8N samples for any interference rank value as compared with ~ 2N samples for the SMI algorithm. However, the SMI algorithm requires considerably more samples to converge in the presence of outliers/targets, whereas the RMCC does not. Both simulated data as well as measured airborne radar data from the multichannel airborne radar measurements (MCARM) space-time adaptive processing (STAP) database are used to illustrate performance improvements over SMI methods.     

A flexible processor for a digital adaptive array radar

A digital beamforming processor for an adaptive array radar is described. The functionality and the architecture of the processor are strongly driven by a goal of achieving adaptive null depths in the 60-dB to 70-dB range, which necessitates substantial preprocessing of each channel. In particular, conversion to baseband quadrature channels is accomplished digitally using a single A/D converter per channel, and FIR (finite impulse response) equalizing filters are employed in each channel to match channel transfer functions. The processor is highly modular, and this not only distributes the total processing load, but also the I/O (input/output) bandwidth requirement. This is accomplished by distributing the adaptive beamforming algorithm systolically across a linear array of processing nodes. The processor is expandable to a different number of channels and sufficiently flexible to be applied to other problems of an array signal processing nature. Experimental data presented demonstrate that the processor is capable of supporting channel-to-channel cancellation of interfering signals to the level of -65 dB     

A self-normalizing gradient search adaptive array algorithm

A method is described to normalize the step parameter and perturbation amount used for gradient search adaptive algorithms. The step normalization assures rapid stable convergence. The perturbation normalization also assures rapid stable convergence and limits the output perturbation noise to a level below thermal noise. The normalizations are computationally simple and are consistent with the use of a single receiver at the adaptive array output. Results are presented to verify the robustness of the technique.<>     

An adaptive array detector with mismatched signal rejection

An adaptive detection algorithm with a sensibility parameter for rejecting unwanted signals is presented. This algorithm is a simple modification of the generalized likelihood ratio (GLR) detector (or test) for detecting a signal in zero mean Gaussian noise with unknown correlation matrix. Specifically, the adaptive detection algorithm is obtained by introducing an arbitrary positive scalar, which is called the sensitivity parameter, into the GLR detector as a multiplier of an already existing quadratic term. The GLR detector then becomes a special case of this detector for the unity sensitivity parameter. It is shown that the sensitivity parameter controls the degree to which unwanted signals are rejected. From numerical examples, it is demonstrated how the sensitivity parameter can be chosen such that unwanted signals, can be rejected while maintaining acceptable detection loss for slightly mismatched signals. Further insight into previous work on adaptive detection is also given     

Implementation and convergence considerations of a linearlyconstrained adaptive array

O.L. Frost (1972) introduced a linearly constrained optimization algorithm that allows certain main beam properties to be preserved while good cancellation is attained. An open-loop implementation of this algorithm is developed. This implementation is shown to be equivalent to the technique developed by C.W. Jim (1977), L.J. Griffiths and C.W. Jin (1982), and K.M. Buckley and L.J. Griffiths (1982) whereby the constrained problem is reduced to an unconstrained problem. Analytical results are presented for the convergence rate when the sampled matrix inversion (SMI) or Gram-Schmidt (GS) algorithm are employed. It has been previously shown that the steady-state solution for the optimal weights is identical for both constrained and reduced unconstrained problems. It is shown that if the SMI or GS algorithm is employed, then the transient weighting vector solution for the constrained problem is identical to the equivalent transient weight vector solution for the reduced unconstrained implementation     

一种基于麦克风阵列用于分离单极子和偶极子声源的方法

基于单极子假设的波束成形算法作为一种声场可视化技术,在声源识别中得到了广泛应用.但是在实际工程应用中,声源的类型较为复杂,基于单一声源假设的波束成形无法有针对性地识别不同类型的声源.本文提出了一种混合反卷积方法来分离含有单极子和偶极子的组合声源,该方法构造了波束成形输出与实际声源之间的线性方程,通过求解该线性方程,可以...     

Cancellation of specular and diffuse jammer multipath using ahybrid adaptive array

It has been demonstrated that specular or diffuse jammer multipath can be canceled to a desired level by using an adaptive array that combines bandwidth partitioning with tapped delay lines. Such hybrid systems are studied. In particular, the author studies an ideal two-element array that uses bandwidth partitioning in both the main and auxiliary channels, with an Mth-order adaptive finite impulse response filter in each subband of the auxiliary. The ability of this system to cancel specular moderately diffuse and diffuse multipath is studied. The combinations of bandwidth partitioning and filter order that can achieve a specified jammer cancellation level are discussed     

Asymptotic distribution of the conditional signal-to-noise ratio in an eigenanalysis-based adaptive array

The statistical characterization of the conditioned signal-to-noise ratio (SNR) of the sample matrix inversion (SMI) method has been known for some time. An eigenanalysis-based detection method, referred to as the eigencanceler, has been shown to be a useful alternative to SMI, when the interference has low rank. In this work, the density function of the conditioned SNR is developed for the eigencanceler. The development is based on the asymptotic expansion of the distribution of the principal components of the covariance matrix. It is shown that, unlike the SMI method, the eigencanceler yields a conditional SNR distribution that is dependent on the covariance matrix, It is further shown that simpler, covariance matrix-independent approximations can be found for the large interference-to-noise case. The new distribution is shown to be in good agreement with the numerical data obtained from simulations.     

Effects of finite weight resolution and calibration errors on theperformance of adaptive array antennas

Adaptive antennas are now used to increase the spectral efficiency in mobile telecommunication systems. A model of the received carrier-to-interference plus noise ratio (CINR) in the adaptive antenna beamformer output is derived, assuming that the weighting units are implemented in hardware, The finite resolution of weights and calibration is shown to reduce the CINR. When hardware weights are used, the phase or amplitude step size in the weights can be so large that it affects the maximum achievable CINR. It is shown how these errors makes the interfering signals “leak” through the beamformer and we show how the output CINR is dependent on power of the input signals. The derived model is extended to include the limited dynamic range of the receivers, by using a simulation model. The theoretical and simulated results are compared with measurements on an adaptive array antenna testbed receiver, designed for the GSM-1800 system. The theoretical model was used to find the performance limiting part in the testbed as the 1 dB resolution in the weight magnitude. Furthermore, the derived models are used in illustrative examples and can be used for system designers to balance the phase and magnitude resolution and the calibration requirements of future adaptive array antennas     

二维条码标准化工作分析

描述了二维条码的主要用途,二维条码与精确保障的关系;阐述了航空标准化二维条码工作的主要内容,给出了每个工作内容的工作要点,最后提出了应用建议。     

压气机二维可压缩气动稳定性分析模型

基于压缩系统气动稳定性理论模型对压气机内部流动可压缩性以及叶排之间相互影响的需要,以Moore-Greitzer模型为基础,发展了一个用于分析多级轴流压气机动态失速特性的多"激盘"二维可压缩模型.该模型采用二维非定常的可压缩Euler方程描述压气机上、下游管道以及各叶排之间轴向间隙内的流动,而采用"激盘"分别取代压气机的各个叶片排.利用该模型,系统地计算和分析了多级轴流压气机中二维小尺度旋转失速的起始特性和动-静叶之间的相互影响,以及总压畸变旋转频率对下游压气机稳定性的影响.计算结果与实验数据的比较表明该模型及其计算结果是可靠的.      

APFSDS弹托分离干扰三维流场数值模拟

通过应用多块复合网格生成法的网格生成技术,对尾翼稳定脱壳穿甲弹 (APFSDS)的外形进行适当简化后,生成了三瓣弹托对称分离的三维贴体网格.在此网格生成的基础上,对其分离过程应用TVD有限体积格式进行了三维流场数值模拟,并将气动力计算结果与风洞实验结果进行了对比,结果表明数值计算结果合理.这为新一代的尾翼稳定脱壳穿甲弹的设计与研制提供了一定的参考与帮助.     

Bearings-only tracking for maneuvering sources

Classical bearings-only target-motion analysis (TMA) is restricted to sources with constant motion parameters (usually position and velocity). However, most interesting sources have maneuvering abilities, thus degrading the performance of classical TMA. In the passive sonar context a long-time source-observer encounter is realistic, so the source maneuver possibilities may be important in regard to the source and array baseline. This advocates for the consideration and modeling of the whole source trajectory including source maneuver uncertainty. With that aim, a convenient framework is the hidden Markov model (HMM). A basic idea consists of a two-levels discretization of the state-space. The probabilities of position transition are deduced from the probabilities of velocity transitions which, themselves, are directly related to the source maneuvering capability. The source state sequence estimation is achieved by means of classical dynamic programming (DP). This approach does not require any prior information relative to the source maneuvers. However, the probabilistic nature of the source trajectory confers a major role to the optimization of the observer maneuvers. This problem is then solved by using the general framework of the Markov decision process (MDP)     

Weighted marginal fisher analysis with spatially smooth for aircraft recognition

Due to limitations to extract invariant features for recognition when the aircraft presents various poses and lacks enough samples for training, a novel algorithm called Weighted Marginal Fisher Analysis with Spatially Smooth （WMFA-SS） for extracting invariant features in aircraft rec- ognition is proposed. According to the Graph Embedding （GE） framework, Heat Kernel function is firstly introduced to characterize the interclass separability when choosing the weights of penalty graph. Furthermore, Laplacian penalty is applied to constraining the coefficients to be spatially smooth in this algorithm. Laplacian penalty is able to incorporate the prior information that neigh- boring pixels are correlated. Besides, using a Laplacian penalty can also avoid the singularity of Laplacian matrix of intrinsic graph. Once compact representations of the images are obtained, it can be considered as invariant features and then be performed in classification to recognize different patterns of aircraft. Real aircraft recognition experiments show the superiority of our proposed WMFA-SS in comparison to other GE algorithms and the current aircraft recognition algorithm; the accuracy rate of our proposed method is 90.00% for dataset BH-AIR1.0 and 99.25% for dataset BH-AIR2.0.     

脉冲爆震发动机快起爆的二维数值模拟

为研究脉冲爆震发动机的点火过程，用二维欧拉方程和Korobeinikov两步爆震模型对爆震波快起爆过程进行了数值模拟研究。用高温高压未燃气体点火方式来模拟试验中的电火花塞点火。研究表明：电火花塞的能量不足以直接点燃爆震波，爆震波是在经历了一系列反射激波的相互作用后最终建立的。激波．爆震波转捩是快点火过程，是爆震波建立的一个非常重要的机理。在设计点火装置时，火花塞要尽可能靠近壁面和拐角，以便产生高强度的反射激波。同时还要控制反射激波的方向，使之向未燃气体中顺利传播，才能起到很好的点火效果。     

Active phased array design for high reliability

We discuss strategies for designing: active phased array antennas with high reliability. We show how to consider fault-tolerance in the design of the antenna architecture, so that replacement of failed components can be avoided for an extended period of time. First, we address the dependence of antenna life cycle cost on component failure rates. Then we discuss the design of active phased array architecture for maximizing antenna mean-time-between-failures (MTBF). The antenna MTBF is defined in terms of a specified degradation in peak sidelobe level. We present simulated data showing the effect of random, single, and clustered element failures on the peak sidelobe level of a low sidelobe antenna aperture. We use these data as a basis for analyzing various phased array architectures in terms of their antenna MTBF