基于循环子空间理论的线性系统测试矩阵优化

研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值.     

基于循环平稳的DSSS系统窄带干扰抑制技术

在对窄带干扰的频谱特性分析的基础上,采用一种新的利用信号循环平稳特性的方法进行干扰抑制。利用LCL-FRESH滤波器对信号进行更精确的估计,从而有效地抑制了窄带干扰。仿真结果表明,同传统时域预测滤波器相比,这种干扰抑制方法,能够更好地估计和消除窄带干扰,具有更加优越的干扰抑制性能。     

外辐射源雷达系统中时延估计算法及仿真

时延估计的方法有经典的广义相关法、自适应法、循环平稳法、高阶累积量法、时频分析法等,重点分析了外辐射源雷达系统中用于时延估计的循环平稳法和相关法,并给出了循环平稳法和相关法用于时延估计的仿真,得出了仿真结果。仿真结果表明,对QPSK信号无法用循环平稳的方法来进行时差的获取,用相关法在极低信噪比条件下检测出目标信号,长时间的信号积累是必需的。     

四阶累积量的MIMO雷达角度估计算法

针对色噪声环境下的MIMO雷达目标角度估计问题,提出一种新的参数估计算法.通过计算MIMO雷达接收数据的四阶累积量,并对构造出的累积量矩阵进行特征分解,结合MUSIC算法和ESPRIT算法实现了雷达目标的角度估计.在保证阵元扩展能力和目标分辨力的基础上进行了低复杂度改进,去掉了冗余信息,实现了目标参数的有效估计;同时由于采用四阶累积量,提高了算法抑制高斯噪声的能力,更利于工程应用.最后计算机仿真结果证实了算法的有效性和可行性.     

基于循环平稳的卫星信道多普勒频移估计

基于线性调制信号的循环平稳特性,卫星信道多普勒频移的估计可以通过求解发送信号与接收信号的循环相关函数关系得到.借助循环谱函数推导出发送信号的循环相关函数,接收信号的循环相关函数则对信号本身及其有限差分进行计算.仿真结果说明了该算法对信道中的干扰与噪声不敏感,在多普勒频移较大时,该算法具有良好的估计精度;同时该算法还具有低复杂度和应用灵活的特点.     

利用分数抽头均衡器快速定时同步

建立了分数抽头均衡器(FSE)与定时同步相结合的信号模型,分析了定时误差对于均衡性能的影响,提出了一种新的基于FSE的快速定时同步算法。在未知参考序列相位的情况下,利用循环均衡快速收敛并建立同步。在相位跟踪阶段,利用抽头增益跟踪定时相位误差,通过对采样数据进行抽取或插值以及均衡器抽头的移位操作控制相位误差。仿真表明,该算法能在长度为均衡器抽头数的符号周期内快速建立同步,通过采样率的选择可以精确地控制定时相位误差。     

单信道时频重叠MPSK信号的调制识别方法

提出一种基于高阶循环累积量的调制识别算法,用于解决单信道两个时频重叠M PSK信号的调制识别问题。对接收到的重叠信号进行预处理,计算其四阶循环累积量,提取分类特征参数,采用最小误差准则算法实现时频重叠双信号的自动分类。理论分析和仿真试验结果均证明了算法的正确性和有效性。     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于高阶累积量与神经网络的干扰识别算法

研究了一种基于高阶累积量和神经网络的干扰识别算法。该方法把卫星通信中常见的各种干扰信号的归一化高阶累积量作为分类特征参数,应用神经网络对特征参数进行分类训练,将接收干扰信号的归一化高阶累积量输入已训练的神经网络进行干扰类型的识别。试验结果表明:该算法在低干信比的情况下具有较高的识别准确率。