Krylov subspace method based on data preprocessing technology

The performance of adaptive beamforming techniques is limited by the nonhomogeneous clutter scenario. An augmented Krylov subspace method is proposed, which utilizes only a single snapshot of the data for adaptive processing. The novel algorithm puts together a data preprocessor and adaptive Krylov subspace algorithm, where the data preprocessor suppresses discrete interference and the adaptive Krylov subspace algorithm suppresses homogeneous clutter. The novel method uses a single snapshot of the data received by the array antenna to generate a cancellation matrix that does not contain the signal of interest （SOI） component, thus, it mitigates the problem of highly nonstationary clutter environment and it helps to operate in real-time. The benefit of not requiring the training data comes at the cost of a reduced degree of freedom （DOF） of the system. Simulation illustrates the effectiveness in clutter suppression and adaptive beamforming. The numeric results show good agreement with the proposed theorem.     

New method for passive radar seeker to antagonize non-coherent radar decoy

Using super resolution direction of arrival (DOA) estimation algorithm to reduce the resolution angle is an effective method for passive radar seeker (PRS) to antagonize non-coherent radar decoy. Considering the power and correlation property between radar and non-coherent decoy, an improved subspace DOA estimation method based on traditional subspace algorithm is proposed. Because this new method uses the invariance property of noise subspace, compared with traditional MUSIC algorithm, it shows not only better resolution in condition of closely spaced sources, but also superior performance in case of different power or partially correlated sources. Using this new method, PRS can distinguish radar and non-coherent decoy with good performance. Both the simulation result and the experimental data confirm the performance of the method.     

极值理论(EVT)方法用于受险价值(VaR)计算的实证比较与分析

讨论了根据极值理论 ( EVT)计算受险价值 ( Va R)的两类不同的方法 :基于矩估计的“两次子样试算法”和极大似然估计法 ,并给出了各自理论推导过程和计算步骤 .同时 ,把这两类方法与正态分布和经验分布的结果进行了比较 .应用四种汇率历史数据进行的实证计算表明 ,在极端条件下 ,用极值理论方法估计 Va R具有很高的准确性 ,而矩估计法的结果又优于极大似然估计法 .     

考虑多因素扰动的项目关键链缓冲区间设置及控制模型

项目规划及执行过程中极易出现不确定性,故需对项目关键链缓冲区间进行动态调整以适应项目任务关系变化.针对项目计划关键链缓冲区间设置及调整控制问题,本文提出了一种考虑多因素扰动的缓冲设置及调整控制联动模型.项目初始缓冲设置充分考虑项目工序安全工期、网络复杂程度及资源紧张程度等因素影响,项目执行过程中将缓冲/资源绩效指数与Bayes估计相结合,通过对Weibull分布参数估计实现缓冲信息的递阶转换,提升对缓冲使用的控制能力,最后通过实例验证所提方法与控制模型的有效性.     

基于新息序列修正的输入估计算法

针对传统输入估计算法跟踪机动目标时检测概率和估计精度不高的缺点,提出一种改进的输入估计跟踪算法。算法利用对检测窗内新息序列进行修正以及对卡尔曼滤波状态变量进行补偿的方法,消除了已有机动检测估计对后继机动输入估计的影响,提高了对机动的检测概率和估计精度。理论分析和仿真结果表明,改进后的算法相比原有算法和IMM3算法,不仅跟踪性能有显著提高,而且对加速度缓变的机动也有较好的跟踪能力。     

基于稀疏非均匀COLD阵列的极化信号DOA估计

基于稀疏非均匀COLD(concentered orthogonal loop and dipole)阵列,提出了一种极化信号的DOA(direction-of-arrival)无模糊估计算法.该算法利用了稀疏非均匀COLD阵列的阵元数少和孔径大等特点,因而在阵元数目一定的情况下,可获得较高的DOA估计精度.由于稀疏非均匀COLD阵列可分成电磁环和偶极子两个子阵列,通过分析每个子阵列DOA估计的模糊性,给出了整个稀疏非均匀COLD阵列不发生DOA估计模糊的条件.通过计算机仿真证明了该算法的有效性.     

总磁场强度梯度模作为匹配特征量的基准图制备技术

基准图制备是地磁匹配制导的关键技术之一。提出用总磁场强度梯度模作为地磁匹配特征量,根据研究的实际需要,从四个方面分析了地磁场梯度模作为匹配特征量的优势;在选定区域制作了以总磁场强度梯度模作为特征量的基准图,在基准图上提取了特征参数并进行了分析。结果表明:在选定区域,以总磁场强度梯度模作为特征量生成的基准图特征丰富、起伏程度大,较之以地磁总场强度为特征量生成的基准图优势明显。     

模糊连续变增益H∞控制器及其在生化过程中的应用

针对连续搅拌反应釜系统(CSTR)和生物反应等连续系统,采用梯度线性化,设计一种连续变增益控制器,主要思想是先利用梯度线性化方法得到非线性系统的一系列局部线性化模型,结合H_∞理论和极点配置得到变增益矩阵,通过拟合得到连续变增益H_∞控制器,再引入模糊隶属度函数,使控制器兼顾快速特性和良好的阻尼特性,保证系统始终具有较好的动态性能。仿真结果说明了此控制器设计方法的有效性。     

多分量二维线性调频信号瞬时频率变化率估计

针对多分量二维线性调频信号的瞬时频率变化率估计问题,提出了一种新方法.定义了二维线性调频信号的二维三次相位函数CPF.通过分析可知,应用二维CPF方法处理多分量二维线性调频信号时,会由于交叉干扰项的存在而产生伪峰,接着借助于二维CPF构造了二维三次相位函数乘积项PCPF.应用该方法可以在较低信噪比下,准确地估计出多分量二维线性调频信号的瞬时频率变化率.仿真实验验证了该方法的有效性.     

Directionality based fast fractional pel motion estimation for H.264

Motion estimation is an important and intensive task in video coding applications. Since the complex-ity of integer pixel search has been greatly reduced by the numerous fast ME algorithm, the computation overhead required by fractional pixel ME has become relatively significant. To reduce the complexity of the fractional pixel ME algorithm, a directionality-based fractional pixel ME algorithm is proposed. The proposed algorithm efficiently explores the neighborhood positions which with high probability to be the best matching around the minimum one and skips over other unlikely ones. Thus, the proposed algorithm can complete the search by examining only 3 points on appropriate condition instead of 17 search points in the search algorithm of reference software. The simulation results show that the proposed algorithm successfully optimizes the fractional-pixel motion search on both half and quarter-pixel accuracy and improves the processing speed with low PSNR penalty.