相干信号源DOA估计改进ESPRIT算法研究

在目标方位估计(DOA)的众多算法中,ESPRIT是一种运算速度快、精度高的常用算法,但它不能解相干信号。提出一种基于观测数据直接空间平滑的改进型ESPRIT算法,解决了常规ESPRIT算法不能解相干、对信噪比要求高等问题。该方法适用于所有信号(非相干和相干信号)的目标方位估计。     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Signature based analysis of m‐Consecutive‐k‐out‐of‐n: F systems with exchangeable components

In this article, we study reliability properties of m‐consecutive‐k‐out‐of‐n: F systems with exchangeable components. We deduce exact formulae and recurrence relations for the signature of the system. Closed form expressions for the survival function and the lifetime distribution as a mixture of the distribution of order statistics are established as well. These representations facilitate the computation of several reliability characteristics of the system for a given exchangeable joint distribution or survival function. Finally, we provide signature‐based stochastic ordering results for the system's lifetime and investigate the IFR preservation property under the formulation of m‐consecutive‐k‐out‐of‐n: F systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Improving series and parallel systems through mixtures of duplicated dependent components

We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

随机频率步进雷达成像分析

随机频率步进信号兼具步进频率雷达和宽带噪声雷达的特点,不仅可以降低系统瞬时带宽和数据采样率,还具有优良的低截获概率(LPI)、电磁兼容性(EMC)和抗射频干扰(ARFI)特性.分析了随机频率步进信号的相关输出及模糊函数的统计特性,如一阶矩、二阶矩和方差等,并与均匀频率步进信号做了抗干扰性能的比较.提出并分析了相关输出结...     

一种基于VLIW DSP架构的高性能取指流水线

以超长指令字(VLIW)数字信号处理器(DSP)作为平台,针对现有提高单线程取指流水线效率的方法中存在的弊端,提出了一种高性能的取指流水架构.该架构支持无效取指的检测与作废,从而降低不必要的cacbe访问,减少取指流水停顿周期,该结构还引入专用硬件支持编译调度的循环软流水,有效提高指令并行性,降低代码存储空间,由此释放...     

云模型和混合Petri网相结合的系统可靠性评价

针对复杂系统可靠性评价中工作环境可变的情形,提出基于云模型和混合Petri网相结合的可靠性评价方法。首先采用云模型描述系统的环境适应能力指数,并将其作为混合Petri模型中连续库所的托肯值来控制该模型中变迁的变迁率,然后采用基于Petri网的蒙特卡罗方法对不同环境下的系统可靠性进行仿真求解,得到系统在不同时刻下的失效率。最后以一个C4ISR系统为例,验证了该方法在解决可变工作环境下的系统可靠性评估是可行的。     

L1-analysis稀疏重构在阵列信号恢复及波达角估计中的应用

通过适当的空域稀疏化构造了可对阵列接收信号进行冗余稀疏表示的阵列流形矩阵,建立了相应的L1-analysis稀疏重构模型用于恢复阵列接收信号,重点证明了该流形矩阵是满足L1-analysis 稀疏重构条件的紧框架,从理论上保证了将L1-analysis 稀疏重构用于阵列接收信号恢复及波达角估计问题的合理性,并推导出信号恢复误差的理论上界。利用在微波暗室环境中采集的实测数据,结合MUSIC算法进行实验验证,结果表明基于L1-analysis 稀疏重构的信号恢复对提高低信噪比环境下的波达角估计性能是有效的。     

基于脉冲串信号的无源定位系统频差估计误差CRLB分析

频差估计是无源定位系统中的关键部分,其估计精度直接决定了无源定位系统的性能。本文对单频脉冲信号频差估计误差方差的Cramer-Rao下限(CRLB)进行了理论分析研究。在建立数学模型的基础上,定量分析了频差估计误差CRLB与接收信号参数的数学关系。通过直接公式推导和数值仿真归纳,分别得出了相参/非相参单频脉冲信号频差估计误差CRLB的解析表达式,该结论可用于指导基于频差估计的无源定位系统设计。