Application of Gram-Schmidt algorithm to fully adaptive arrays

The Gram-Schmidt orthogonalization (GSO) algorithm has excellent numerical performance and is readily applicable to systolic implementations such as in a field of adaptive cancellation systems. A modified GSO algorithm for a fully adaptive array is proposed and computer simulations show that the proposed algorithm gives superior performance. A systolic implementation of the proposed GSO algorithm for fully adaptive array is presented. A feedback mode GSO algorithm for use with analog weights is also presented and has been shown to have excellent performance in the presence of weight errors     

Minimal submodel-set algorithm for maneuvering target tracking

The variable structure multiple model (VSMM) approach to the maneuvering target tracking problem is considered. A new VSMM design, the minimal submodel-set switching (MSMSS) algorithm for tracking a maneuvering target is presented. The MSMSS algorithm adaptively determines the minimal set of models from the total model set and uses this to perform multiple models (MM) estimation. In addition, an iterative MSMSS algorithm with improved maneuver detection and termination properties is developed. Simulations results demonstrate that, compared with a standard interacting MM (IMM), the proposed algorithms require significantly lower computation while maintaining similar tracking performance. Alternatively, for a computational load similar to IMM, the new algorithms display significantly improved performance.     

On solving multi-commodity flow problems: An experimental evaluation

Multi-commodity flow problems (MCFs) can be found in many areas,such as transportation,communication,and logistics.Therefore,such problems have been studied by a multitude of researchers,and a variety of methods have been proposed for solving it.However,most researchers only discuss the properties of different models and algorithms without taking into account the impacts of actual implementation.In fact,the true performance of a method may differ greatly across various implementations.In this paper,several popular optimization solvers for implementations of column generation and Lagrangian relaxation are discussed.In order to test scalability and optimality,three groups of networks with different structures are used as case studies.Results show that column generation outperforms Lagrangian relaxation in most instances,but the latter is better suited to networks with a large number of commodities.     

Multiple-model estimation with variable structure. V. Likely-modelset algorithm

For pt. IV see ibid., vol. 35, no. 1, p. 242-254 (1999). A multiple-model (MM) estimator with a variable structure, called likely-model set (LMS) algorithm, is presented, which is generally applicable to most hybrid estimation problems and is easily implementable. It uses a set of models that are not unlikely to match the system mode in effect at any given time. Different versions of the algorithm are discussed. The model set is made adaptive in the simplest version by deleting all unlikely models and activating all models to which a principal model may jump so as to anticipate the possible system mode transitions. The generality, simplicity, and ease in the design and implementation of the LMS estimator are illustrated via an example of tracking a maneuvering target and an example of fault detection and identification. Comparison of its cost-effectiveness with other fixed- and variable-structure MM estimators is given     

Feedback structure based entropy approach for multiple-model estimation

The variable-structure multiple-model（VSMM）approach,one of the multiple-model（MM）methods,is a popular and effective approach in handling problems with mode uncertainties.The model sequence set adaptation（MSA）is the key to design a better VSMM.However,MSA methods in the literature have big room to improve both theoretically and practically.To this end,we propose a feedback structure based entropy approach that could fnd the model sequence sets with the smallest size under certain conditions.The fltered data are fed back in real time and can be used by the minimum entropy（ME）based VSMM algorithms,i.e.,MEVSMM.Firstly,the full Markov chains are used to achieve optimal solutions.Secondly,the myopic method together with particle flter（PF）and the challenge match algorithm are also used to achieve sub-optimal solutions,a trade-off between practicability and optimality.The numerical results show that the proposed algorithm provides not only refned model sets but also a good robustness margin and very high accuracy.     

小推力深空探测轨道全局优化设计

 针对小推力深空探测四维轨道优化设计,给出了一种组合优化算法,采用该算法基于二体模型进行了深空探测四维轨道全局优化。该组合优化算法由动态规划算法、静态参数优化算法与共轭梯度算法组成。动态规划算法和静态参数优化算法用以选择最优的发射窗口、返回窗口及相应的近似飞行轨道;基于该近似轨道方案,采用共轭梯度算法（解决两点边值问题）求解精确的最优轨道。通过大量的数值仿真计算,得到了航天器的全局最优飞行轨道,及相应的最优发射窗口与返回窗口。数值仿真结果表明,该组合优化算法对深空探测轨道优化具有良好的通用性和工程运用价值。     

Geometrical entropy approach for variable structure multiple-model estimation

The variable structure multiple-model(VSMM) estimation approach, one of the multiple-model(MM) estimation approaches, is popular in handling state estimation problems with mode uncertainties.In the VSMM algorithms, the model sequence set adaptation(MSA) plays a key role.The MSA methods are challenged in both theory and practice for the target modes and the real observation error distributions are usually uncertain in practice.In this paper, a geometrical entropy(GE) measure is proposed so that the MSA is achieved on the minimum geometrical entropy(MGE) principle.Consequently, the minimum geometrical entropy multiple-model(MGEMM) framework is proposed, and two suboptimal algorithms, the particle filter k-means minimum geometrical entropy multiple-model algorithm(PF-KMGEMM) as well as the particle filter adaptive minimum geometrical entropy multiple-model algorithm(PF-AMGEMM), are established for practical applications.The proposed algorithms are tested in three groups of maneuvering target tracking scenarios with mode and observation error distribution uncertainties.Numerical simulations have demonstrated that compared to several existing algorithms, the MGE-based algorithms can achieve more robust and accurate estimation results when the real observation error is inconsistent with a priori.     

Multiple-model estimation with variable structure- part VI: expected-mode augmentation

A new class of variable-structure (VS) algorithms for multiple-model (MM) estimation is presented, referred to as expected-mode augmentation (EMA). In the EMA approach, the original set of models is augmented by a variable set of models intended to match the expected value of the unknown true mode. These models are generated adaptively in real time as (globally or locally) probabilistically weighted sums of mode estimates over the model set. This makes it possible to cover a large continuous mode space by a relatively small number of models at a given accuracy level. The paper presents new theoretical results for model-set design, a general formulation of the EMA approach, along with theoretical analysis and justification, and three algorithms for its practical implementation. The performance of the proposed EMA algorithms is evaluated via simulation of a generic maneuvering target tracking problem.     

Strapdown Matrix Orthogonalization: The Dual Iterative Algorithm

There exist several algorithms for the optimal orthogonalization of the Direction Cosine Matrix used in navigation, control and simulation One of these recursive algorithms is shown to be derived from a dual solution to the optimal orthogonalization problem. The duality of the algorithm is demonstrated and its convergence properties are investigated Quadratic convergence is proven and the condition for convergence is determined and illustrated with numerical examples.     

基于Nash-Pareto策略的两种改进算法及其应用

针对多目标、多设计变量的优化问题,提出了两种优化的新算法:一种是将多目标问题转化为单目标时,对目标权重的确定提出了新的途径;另一种是直接对多目标问题进行优化,并对Pareto遗传优化技术作了改进,以得到均匀分布的Pareto最优解集.两种新算法都是建立在Nash的系统分解与Pareto遗传算法的基础上,因此称这类算法为Nash-Pareto策略.借助于这类算法,文中以跨声速压气机双圆弧类叶型的气动优化为例,给出了气动优化的全过程.数值优化的实验表明所给出的改进算法是可行的、有效的.     

Circular array STAP

Traditionally, space-time adaptive processing (STAP) for airborne early warning (AEW) radar has been applied to uniform linear arrays (ULAs). However, when considering the overall radar system, electronically scanned circular arrays have advantages: a better combination of even and continual angular and temporal coverage, and mechanical simplicity because it does not need to rotate. This paper answers the question “How well does STAP perform when applied to a circular array?” This paper shows that for the AEW mission, circular arrays are indeed STAP compatible. However, when conventional STAP algorithms are used there may be a small loss in performance when compared with a ULA. With some care in the choice and implementation of the STAP algorithm, the majority of the degradation is at close ranges, where the target returns are relatively strong. At long ranges performance is barely affected. A STAP algorithm which compensates for the circular array environment and provides better performance than existing algorithms is presented     

Stationkeeping manoeuvres for geostationary satellites using feedback control techniques

In this paper we discuss the determination of the correction manoeuvres required to control geostationary satellites within a predefined space box over a place above the Earth using a feedback control technique. The control algorithm formulated here combines an accurate numerical propagator for the orbit evolution with an iterative process for the calculation of impulsive manoeuvres that gives numerical solutions convergent to the optimal values, both for the impulses to be applied and for the times of their implementations, to minimize fuel consumption. Numerical simulations are presented to illustrate this technique and to compare it with classical stationkeeping. The numerical results for this nonlinear approach show how the magnitude of the impulses can be reduced over 3 percent per year with respect to the classical approach. This means that the orbital life-time can be increased up to 5 months for a 15 years life-time mission.     

Analysis of Min-Norm and MUSIC with arbitrary array geometry

A nonasymptotic performance comparison is presented between the Min-Norm and MUSIC algorithms for estimating the directions of arrival of narrowband plane waves impinging on an array of sensors. The analysis is based on a finite amount of sensor data. The analysis makes the assumption of high signal-to-noise ratio (SNR), and it applies to arrays of arbitrary geometry. It is shown that Min-Norm can be expressed as a certain data-dependent weighted MUSIC algorithm, and that this relationship allows a unified performance comparison. It is also shown that the variances of the estimated directions-of-arrival from the MUSIC algorithm are always smaller than those of the Min-Norm algorithm at high SNR when both algorithms employ a numerical search procedure to obtain the estimates     

特征结构配置法及其在飞行控制系统设计中的应用

 本文研究了状态反馈系统的特征结构配置（Eigenstructure Assignment）问题。文中提出了配置具有多重特征值及复共轭特征值的特征结构的算法。并以某飞行控制系统的设计为例说明了算法的应用;最后还给出了设计方案的数字～模拟计算机仿真实验结果。     

Performance of Digital Implementations of an Adaptive Processor

The performance of a digital implementation of an Applebaum-Howells type adaptive processor is analyzed for both a limiter and nonlimiter configuration. The performance is evaluated in terms of steady-state residue power, using either a single-pole filter or a perfect integrator to smooth the output of the correlation mixer. The latter filter is the more commonly used for digital implementations. It is shown that when using the perfect integrator filter for both the limiter and linear digital implementations, the steady-state average weight vector equals the optimum weight vector. Thus, for this filter, the steady-state residue power is the minimum possible for either implementation. When using the single-pole filter, neither implementation achieves the minimum possible steady-state residue power. The relative performance of the two implementations depends upon the relative gain settings. When the gains are adjusted to give comparable servo stability for the design maximum jammer power, a reasonable criterion for digital implementations because of analog to digital saturation, the limiter configuration always has smaller steady-state residue power.     

A Parallel Adaptive 3D MHD Scheme for Modeling Coronal and Solar Wind Plasma Flows

A parallel adaptive mesh refinement (AMR) scheme is described for solving the governing equations of ideal magnetohydrodynamics (MHD) in three space dimensions. This solution algorithm makes use of modern finite-volume numerical methodology to provide a combination of high solution accuracy and computational robustness. Efficient and scalable implementations of the method have been developed for massively parallel computer architectures and high performance achieved. Numerical results are discussed for a simplified model of the initiation and evolution of coronal mass ejections (CMEs) in the inner heliosphere. The results demonstrate the potential of this numerical tool for enhancing our understanding of coronal and solar wind plasma processes. This revised version was published online in June 2006 with corrections to the Cover Date.     

空间谱估计经典算法性能比较

空间谱估计是阵列信号处理的一个重要研究方向。空间谱估计理论与技术已日趋成熟,近几十年的经典谱估计技术包括：常规波束形成（CBF）、Capon谱估计、多重信号分类（MUSIC）、旋转不变子空间算法（ESPRIT）、最大似然（ML）、子空间拟合（SF）,及这些算法的扩展和变形。上述算法在各个分散的文章中均有具体深入的理论分析和研究,亦有类似的2种或3种算法的性能比较,但是针对这些所有算法的性能比较,就笔者所知尚无公开报道,而使工程实现时对算法的选择没有依据。本文对这些经典算法做了简介,列出各个算法的优缺点,并对性能进行仿真比较,能直观地得到各个算法的性能对比,给工程实现算法选择提供理论依据。     

隐式无网格算法及其应用研究

本文的主要目的在于研究求解Euler方程的隐式无网格算法，并应用于复杂的流场计算。采用无网格算法，计算区域用点云离散代替通常的网格划分；计算点上的空间导数，用当地点云上引入的二次极小曲面逼近。求解的Euler方程用隐式时间后差离散，结合用Roe的近似Riemann解确定通量，并用LU－SGS算法分步计算，数值求解了单翼型或双翼型模拟的复杂绕流。     

Interfacing aircraft to commercial personal computers

The focus of this paper is the concept of utilizing commercial PC products and interfacing them to military and commercial aircraft. The problem of the life cycle of the different products is examined from multiple viewpoints, Existing products are described, the architecture for each implementation is derived, and their strengths and weaknesses are explored. Finally an attempt to define the root causes for the problem of implementation of interface architectures in this environment will be presented. A new developmental architecture will be introduced. This architecture is designed to maintain the strengths of the traditional architectures and eliminate some of the weaknesses and inefficiencies. A series of hardware/software co-development projects will be described to demonstrate the new architecture. The relative performance of the architecture has been evaluated and refined by multiple implementations. These will be described and future implementations examined     

Fast Algorithms for Time Domain Broadband Adaptive Array Processing

Recursive algorithms are presented for time domain, broadband, adaptive beamforming. The algorithms are rapidly converging and can be computationally efficient for a certain range of array processor parameters. The algorithms are presented for two forms of array processor. One form is a Frost-type structure in which explicit constraints are required for defining the array-look direction and also to control the sensitivity of the array processor to implementation errors. The other form is a partitioned array processor in which constraints are built into the processor and the adaptive weight control algorithm is therefore unconstrained. The two processors presented are both element-space processors but the algorithms can be applied also to beam-space processors.