Signal‐to‐interference‐plus‐noise ratio estimation for wireless communication systems: Methods and analysis

The Signal‐to‐Interference‐plus‐Noise Ratio (SINR) is an important metric of wireless communication link quality. SINR estimates have several important applications. These include optimizing the transmit power level for a target quality of service, assisting with handoff decisions and dynamically adapting the data rate for wireless Internet applications. Accurate SINR estimation provides for both a more efficient system and a higher user‐perceived quality of service. In this paper, we develop new SINR estimators and compare their mean squared error (MSE) performance. We show that our new estimators dominate estimators that have previously appeared in the literature with respect to MSE. The sequence of transmitted bits in wireless communication systems consists of both pilot bits (which are known both to the transmitter and receiver) and user bits (which are known only by the transmitter). The SINR estimators we consider alternatively depend exclusively on pilot bits, exclusively on user bits, or simultaneously use both pilot and user bits. In addition, we consider estimators that utilize smoothing and feedback mechanisms. Smoothed estimators are motivated by the fact that the interference component of the SINR changes relatively slowly with time, typically with the addition or departure of a user to the system. Feedback estimators are motivated by the fact that receivers typically decode bits correctly with a very high probability, and therefore user bits can be thought of as quasipilot bits. For each estimator discussed, we derive an exact or approximate formula for its MSE. Satterthwaite approximations, noncentral F distributions (singly and doubly) and distribution theory of quadratic forms are the key statistical tools used in developing the MSE formulas. In the case of approximate MSE formulas, we validate their accuracy using simulation techniques. The approximate MSE formulas, of interest in their own right for comparing the quality of the estimators, are also used for optimally combining estimators. In particular, we derive optimal weights for linearly combining an estimator based on pilot bits with an estimator based on user bits. The optimal weights depend on the MSE of the two estimators being combined, and thus the accurate approximate MSE formulas can conveniently be used. The optimal weights also depend on the unknown SINR, and therefore need to be estimated in order to construct a useable combined estimator. The impact on the MSE of the combined estimator due to estimating the weights is examined. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

倾斜转弯高超声速飞行器滚动通道的自适应全局积分滑模控制

针对倾斜转弯高超声速飞行器滚动通道控制中初始误差大、系统参数不确定和干扰严重的问题,设计了一种自适应全局积分滑模控制方法.该方法在滑模控制参数中引入了自适应调节律来逼近系统参数摄动和干扰的上界,保证了整个控制过程中的滑模可达性,在此基础上,设计了一种基于全局积分滑模面的自适应滑模控制器,消除了稳态误差,同时大大削弱了系统参数不确定和干扰对系统的动态影响,并使系统在初始阶段就处于滑模态,解决了大的初始误差引起的超调问题.理论分析和仿真结果验证了本文所提方法的有效性.     

带限信道中准相干码相关参考波形技术多径抑制性能分析

码相关参考波形(CCRW)技术以其设计灵活、抗多径性能优异等特点成为卫星导航多径抑制研究的热点,但目前相关文献在分析CCRW技术时常假设单边信道带宽无限或远大于扩频码率,且仅研究特定参考波形的性能,缺乏具有工程指导意义的定量结论.根据CCRW技术一般原理,推导了在无限带宽时任意参考波形的鉴别曲线计算公式,给出了满足稳定跟踪的波形约束条件.分析了不同带宽和闸宽参数的W2/W4/W5三类参考波形的准相干多径误差包络性能,仿真表明带限信道中W4、W5波形抗多径性能优于W2波形;以GPS L5和Galileo E5a/E5b的QPSK(10)信号为例进行原理样机试验,结果表明W2、W5算法比窄相关技术的3dB衰减多径误差包络面积减小达63％和72％.结论可用于现代化导航接收机的多径抑制设计.     

太赫兹粗糙金属目标镜面雷达散射截面预估方法

在太赫兹频段,研究金属目标表面粗糙度对雷达散射截面(Radar Cross Section,RCS)的调制作用,对粗糙金属目标的RCS缩比测量具有重要意义.通过研究太赫兹粗糙金属目标镜面RCS随粗糙度的变化规律,结合相干、非相干散射理论,在基尔霍夫近似法的基础上,提出一种特定参数区间粗糙金属目标镜面RCS的预估方法,并...     

纯时滞三种群捕食系统持续生存与全局吸引性

研究了具有HollingⅡ功能性反应的纯时滞的两捕食者、一食饵生物系统,通过构造合理的Lyapunov函数讨论了系统的全局吸引性,并得到系统持续生存的充分条件。     

一类无穷次多项式系统极限环研究

利用平面自治系统的极限环理论和分支理论研究了一类无穷次多项式系统,并讨论了该系统极限环的存在性和唯一性。应用所得结论,推广并改进了前人的结果。     

指挥信息系统非线性最优化问题的混沌搜索解法

指挥信息系统进行辅助决策很多情况下是一个求解最优化问题的过程,指挥信息系统遇到的很多问题具有非线性,同时指挥信息系统对算法的适应性和收敛速度要求相当严格。对此,普通的优化技术只能求出局部最优解。基于混沌搜索技术的计算智能具有全局搜索能力强、算法简洁、计算量小、收敛速度快的特点,成为一种求解非线性最优化问题全局最优的有效方法。算例表明,当搜索次数达到一定数量时,混沌搜索方法可以保证算法收敛到全局最优解,且计算效率很高。     

一类具有时滞的捕食系统的稳定性与Hopf分支

研究一类具有时滞的两种群捕食系统,通过分析特征方程讨论了正平衡点的局部稳定性问题。通过构造适当的Lyapunov泛函,得到了保证系统正平衡点全局渐近稳定的充分条件,并讨论了在正平衡点附近Hopf分支的存在性问题。