A fast adaptive null-steering algorithm based on output powermeasurements

Presented and investigated here is a simple and fast adaptive algorithm for linear power inversion arrays whose nulls can be accurately steered by controlling the element weights. Based on measurements of the powers of the three signals derived from the array output and the output of an auxiliary beamformer, the algorithm tracks unknown jammers in the environment by steering the nulls of the array one by one in a cyclical time-multiplexed manner. When compared with the least mean square (LMS) algorithm, the proposed algorithm has about the same implementation complexity, a better convergence behavior and the advantage that nulls are directly available     

Improved clutter mitigation performance using knowledge-aided space-time adaptive processing

This paper presents a framework for incorporating knowledge sources directly in the space-time beamformer of airborne adaptive radars. The algorithm derivation follows the usual linearly-constrained minimum-variance (LCMV) space-time beamformer with additional constraints based on a model of the clutter covariance matrix that is computed using available knowledge about the operating environment. This technique has the desirable property of reducing sample support requirements by "blending" the information contained in the observed radar data and the a priori knowledge sources. Applications of the technique to both full degree of freedom (DoF) and reduced DoF beamformer algorithms are considered. The performance of the knowledge-aided beam forming techniques are demonstrated using high-fidelity simulated X-band radar data     

Two-dimensional adaptive array for spatially separating andtracking uncorrelated sources

A new structure for the separation and tracking of uncorrelated sources through the use of a 2-dimensional adaptive array is proposed and investigated. The structure consists of a matrix preprocessing beamformer designed to result in outputs which are due to individual sources in the steady state. The preprocessing weights of the beamformer are calculated using the estimated locations of the sources and are updated periodically. Continuous estimation of the source locations is accomplished by using the beamformer outputs to adaptively eliminate correlated components in a reference element of the array while the structure proposed may have rather erratic initial convergence behavior, it has the advantages of being simple to be implemented, fast in tracking, and well suited for applications in mobile communication systems for increasing system capacity     

Coordinated adaptive beamformer over distributed antenna network

The spatial diversity of distributed network demands the individual filter to accommodate the topology of interference environment. In this paper, a type of distributed adaptive beamformer is proposed to mitigate interference over coordinated antenna arrays network. The proposed approach is formulated as generalized sidelobe canceller (GSC) structure to facilitate the convex combination of neighboring nodes’ weights, and then it is solved by unconstrained least mean square (LMS) algorithm due to simplicity. Numerical results show that the robustness and convergence rate of antenna arrays network can be significantly improved in strong interference scenario. And they also clearly illustrate that mixing vector is optimized adaptively and adjusted according to the spatial diversity of the distributed nodes which are placed in different power of received signals to interference ratio (SIR) environments.     

Tracking of conventional beamforming with hydrophone array ofvarying geometry

In conventional beamformers of a large towed hydrophone array of fixed linear array geometry the sensors may be displaced from their nominal positions due to various kinds of force on the array. The displacements are usually time varying and can severely degrade the performance of the beamformer. This problem is approached by restoring the sensor output signals before beamforming by adaptively tracking and compensating for the displacements. This approach does not require modifications of the conventional shipboard beamformer and hence can be used cost-effectively to upgrade existing conventional systems. Two adaptive algorithms are used for two different cases: known sensor moving trajectories and unknown trajectories with relatively small displacements compared with the intersensor spacing. Tracking performance of the algorithms is analyzed. Simulation results show that for known sensor trajectories the algorithm significantly improves the performance of the conventional shipboard beamformer whereas only limited improvement can be achieved when the trajectories are unknown     

Adaptive Resource Allocation in a Spatial Spectral Processor

A method for achieving an optimal allocation of fixed computational resources in a spatial/spectral filtering system is developed. Specifically, clock cycles per unit time for a given processor are to be optimally allocated. The system is a cascade of three subsystems: an adaptive beamformer, a bandpass filter, and a spectral whitener. Each subsystem has adjustable parameters which are related to required arithmetic operations. A gradient projection algorithm is used to find a best allocation according to specified criteria. Two simulation examples are presented to show how the algorithm operates and to indicate the kind of improvement that is possible in a system design.     

基于新型自适应遗传算法的混合可靠性优化模型

提出一种新型的自适应遗传算法。结合Logistic函数和余弦函数,对交叉、变异算子曲线进行非线性化处理,实现了交叉算子和变异算子的非线性自适应调整。用新算法求解测试函数,结果表明新算法能够提高收敛速度和精确度,有效地跳出局部收敛,避免早熟现象发生。并基于提出的新型自适应遗传算法,研究了截尾随机-模糊-区间变量的混合可靠性模型的优化问题,建立了以混合可靠性指标作为优化约束条件的混合可靠性优化模型。以某型飞机变速箱同步器系统的优化设计为例,验证了该模型在工程应用中的有效性。     

一种变步长LMS自适应滤波算法研究

为了解决最小均方(LMS)算法的稳定性以及收敛速度和稳态误差之间的矛盾,提出了一种复数型自适应变步长的LMS算法,它的权系数的调整取决于误差曲面在新权值点上的梯度。分析了新算法的收敛特性以及参数选择对算法性能的影响。算法具有较快的收敛速度、鲁棒稳定性且运算小易于实现的特点。计算机仿真的结果与理论分析相一致,证实了算法的收敛性能优于标准的LMS算法并且具有较好的实用性。     

A sampling-based approach to wideband interference cancellation

Classical adaptive array schemes which use only complex spatial weights are inherently narrowband and consequently perform poorly when attempting to suppress wideband interference. The common solution to this problem is the use of tapped delay line filters in each spatial channel to facilitate space-time adaptive processing (STAP). The higher performance provided by the STAP architecture comes at the cost of a considerable increase in complexity. This paper presents a simpler technique based on programmable time adjustable sampling (TAS) that provides a limited number of wideband degrees of freedom. Two TAS methods are introduced: TAS-sidelobe canceler (TAS-SLC) is based on the sidelobe canceler, while TAS-minimum variance beamformer (TAS-MVB) is derived from the minimum variance beamformer. TAS is implemented by adjusting the sampling instant at selected array channels. TAS-SLC consists of controlling the sampling in the main channel of the sidelobe canceler With TAS-MVB array complex weights are substituted with TAS time delays. The performance of TAS methods with wideband interference is compared to the conventional sidelobe canceler and minimum variance beamformers. It is shown that TAS-SLC provides better performance than the sidelobe canceler, while TAS-MVB outperforms the minimum variance beamformer     

小波域的自适应波束形成算法

在分析传统自适应波束形成的基础上,首次提出了一种小波域的自适应波束形成算法。与通常的自适应波束形成算法相比,该算法利用小波变换对小波空间进行了分解,信号经小波变换自相关性会下降,收敛速度提高,同时在此分解过程中,根据信号与白噪声在不同尺度上的小波变换模极大值表现完全不同的特性进行信号的消噪。理论分析和仿真结果表明了该算法收敛速度较快,且计算量增加较少,易于实时实现,而且具有较好性能。同时仿真实验表明该算法收敛速度与小波基和尺度的选择有关,尺度越大收敛速度越快;对于同一小波基系列,小波基的正则性越好收敛速度越快。     

An improved LMS adaptive algorithm for narrowband interferencesuppression in direct sequence spread spectrum

In 1990 Vijayan and Poor proposed nonlinear predictive methods for suppressing narrowband interference in spread spectrum (SS) systems with a significant increase in signal-to-noise ratio (SNR) improvement. The main drawback of their adaptive nonlinear filter is its slow convergence rate. A new adaptive least mean squares (LMS) algorithm to increase the slow convergence of their nonlinear adaptive filter is described. Computer simulation results are presented to support the advantages of the new filter     

Broadband focusing for partially adaptive beamforming

A broadband adaptive beamforming approach based on the concept of signal-subspace alignment is formulated and contrasted with the conventional approach. The proposed method involves a preprocessor that focuses the signal spaces at different frequencies to a common one and a narrowband beamformer following the preprocessor. The merits that result as a consequence are partial adaptivity due to single frequency weights and decorrelation of coherent signals thus combating signal cancellation. The latter effect is studied by deriving expressions for the desired-signal distortion in a minimum variance distortionless response (MVDR) beamformer and analyzing them. Implementation issues of the preprocessor are addressed. Simulation results confirm the utility of the focusing preprocessor     

基于自适应模拟退火遗传算法的月球软着陆轨道优化

 将自适应遗传算法与模拟退火算法相结合，形成一种自适应模拟退火遗传算法。该算法不但具备了自适应遗传算法的强大全局搜索能力，也拥有模拟退火算法的强大局部搜索能力。针对月球软着陆轨道优化的特点，利用一种新的参数化方法将轨道优化问题转换为非线性规划问题，并应用提出的自适应模拟退火遗传算法进行优化。数值结果表明：该算法的收敛速度快，优化精度高，且避免了初值敏感、病态梯度和局部收敛等问题，能够搜索到全局最优轨道。     

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     

一种改进的LMS算法及其在自适应消噪中的应用

介绍了一种改进的LMS自适应滤波算法及其在自适应噪声对消中的应用。该算法利用误差信号的相关值去调节步长,解决了算法收敛时间与稳态误差间的矛盾,为实际应用提供了更大的灵活性。它同时实现了均方误差小和收敛速度快,并且降低了LMS算法对噪声的敏感性。文中最后给出了仿真结果,仿真结果与理论分析是一致的。     

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     

基于自适应遗传算法的航迹规划研究

对传统遗传算法进行了改进,通过采用交叉概率和变异概率的自适应设计,避免了进化过程中固定的交叉概率和变异概率产生的个体早熟和收敛缓慢的现象。仿真算例结果表明,自适应遗传算法能够有效地提高遗传算法的全局寻优能力,加快算法的收敛速度,有较强的地形和威胁回避能力,可为低空突防飞行器提供满足战术要求的参考航迹。     

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     

Cumulant-based blind optimum beamforming

Sensor response, location uncertainty, and use of sample statistics can severely degrade the performance of optimum beamformers. We propose blind estimation of the source steering vector in the presence of multiple, directional, correlated or coherent Gaussian interferers via higher order statistics. In this way, we employ the statistical characteristics of the desired signal to make the necessary discrimination, without any a-priori knowledge of array manifold and direction-of-arrival (DOA) information about the desired signal. We then improve our method to utilize the data in a more efficient manner. In any application, only sample statistics are available, so we propose a robust beamforming approach that employs the steering vector estimate obtained by cumulant-based signal processing. We further propose a method that employs both covariance and cumulant information to combat finite sample effects. We analyze the effects of multipath propagation on the reception of the desired signal. We show that even in the presence of coherence, cumulant-based beamformer still behaves as the optimum beamformer that maximizes the signal-to-interference-plus-noise ratio (SINR). Finally, we propose an adaptive version of our algorithm simulations demonstrate the excellent performance of our approach in a wide variety of situations     

自适应变搜索域遗传算法及其在发动机模型中的应用

针对发动机数学模型中非线性方程插值解法的不足,提出非线性方程自适应变搜索域遗传算法解法。论文详细分析了方程求解转化为遗传算法优化的数学描述、依据方程解临域特征的自适应变搜索域机理及算法的具体实现技术。实例计算与发动机仿真结果说明:所设计的变搜索域遗传算法可作为通用的非线性方程解法,相比较于简单遗传算法,能成倍提高计算效率;替代插值解法应用于发动机模型,可有效提高模型的收敛性。