共查询到20条相似文献,搜索用时 31 毫秒
1.
战场区域移动通信系统中,指挥中心实时地将主波束对准作战分队来波方向,而将其他方向的来波作为干扰置零陷,不仅提高了抗干扰能力,而且还可对作战分队进行定位。这一过程是通过跟踪移动用户信号的波达角(DOA)来实现的,传统的高分辨率DOA估计算法,如MUSIC、ESPRIT等算法,无法实现自适应、实时跟踪,因为它需要对接收信号的协方差矩阵反复进行特征值分解或奇异值分解,计算量大。针对这一问题,引入基于改进的信号子空间自适应跟踪的卡尔曼(Kalman)滤波算法,该算法直接从信号子空间中提取DOA的更新,无需从协方差矩阵中提取。仿真结果表明,该算法不仅降低了运算量,而且可跟踪多用户的DOA。 相似文献
2.
3.
对于空间目标识别这个具有挑战性的研究课题,提出了基于子块积分双谱的空间目标识别算法。该算法首先从空间目标距离像的双谱中提取出子块积分双谱特征;然后应用KL变换进行特征压缩;最后应用模板匹配方法进行分类识别。计算机仿真实验表明,该算法取得了比较好的识别效果。 相似文献
4.
基于Markov模型对航天测控通信系统进行可靠性分析的过程中,若系统中测控通信设备数量较多,模型中的状态空间随设备数量呈指数增长,将会导致数值计算困难.提出了一种基于Krylov子空间技术的可靠性分析方法,将大规模问题投影至小规模子空间中,求得问题的近似解.实验结果证明,Krylov子空间方法的计算速度及精度优于Ross方法和前向Euler法(forward Euler method,FEM). 相似文献
5.
6.
阵列天线空时自适应处理通过联合空域和时域的自适应滤波处理技术能够有效提高导航接收机的窄带和宽带干扰抑制性能。利用导航信号淹没在干扰信号和热噪声的特点,本文提出先将天线阵列接收的空时信号矢量向干扰子空间的正交子空间投影以实现干扰抑制,当接收机对投影后的参考阵元数据捕获成功后,利用捕获估计的本地扩频码相位作为参考信号依据最小均方误差准则进行波束形成。仿真结果表明该抗干扰算法在零陷强干扰的同时使主波束指向导航信号来波方向,有效提高了阵列输出信干噪比,并降低了空时自适应处理对导航信号伪码相关峰形状和载波跟踪性能的影响。 相似文献
7.
8.
针对固定翼无人机对地面目标进行保距跟踪过程中不能稳定获取目标图像的问题,设计了一种提高视觉目标跟踪稳定性的算法。该算法基于核相关滤波算法,提出了线性旋转子空间的概念,用于估计平面外旋转后的目标图像,在跟踪的过程中通过跟踪效果判断是否对线性旋转子空间进行校正。这种更新机制提高了在相对位置不断变化的情况下视觉跟踪的稳定性和准确性,有效地降低了跟踪漂移的程度。算法在无人机跟踪视角的视觉跟踪数据集中进行了测试,结果显示在跟踪的准确性和鲁棒性上明显好于当前主流跟踪算法。并使用固定翼无人机进行了实机飞行,验证了算法的可行性。 相似文献
9.
10.
11.
在低信噪比时,针对估计信源DOA实时性的问题,提出了一种新的适合于ESPRIT算法的多级维纳滤波器(MSWF)结构,找到了一种能判别信号子空间的方法。首先将多级维纳滤波器(MSWF)与ESPRIT算法相结合,采用多级维纳滤波器(MSWF)的前向递推,得到子空间,不需要通过特征值分解。低信噪比时,针对噪声子空间泄漏到信号子空间的现象,提出一种判别方法,找到了更精确的信号子空间,结合ESPRIT方法实现信号的DOA估计。由于该算法实现了真实的信号子空间的判断,因此,比传统基于MSWF算法具有更高地估计精度。特别是在低信噪比时,增强了算法的实用性,仿真结果证明了算法的有效性。 相似文献
12.
In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000 相似文献
13.
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998 相似文献
14.
为了保证水下设备的长期稳定通信,提出了一种基于改进的快速边缘似然最大化的稀疏贝叶斯学习(sparse Bayesian learning based on improved fast marginal likelihood maximization, IFM-SBL)算法,对水声信道进行低复杂度、高性能的估计。特别是在低信噪比情况下,通过阈值去噪和离散傅里叶变换降噪,可以进一步提升算法的性能。仿真和海试结果表明,所提的IFM-SBL信道估计后的输出误码率与基于期望最大化的稀疏贝叶斯学习(sparse Bayesian learning based on expectation maximization, EM-SBL)算法相似,且验证了算法在低信噪比和快慢时变信道中都具有良好的鲁棒性。在运行速度方面,FM-SBL算法与IFM-SBL算法比EM-SBL算法提高了约90%,大大减少了信道估计时间。 相似文献
15.
16.
One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and Lmax and Cmax objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
17.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
18.
流媒体数据已经在互联网流量中占据极高的比例,P2P是目前支撑互联网流媒体数据分发的重要手段。本文提出一种新型的P2P Tracker实现方法——eTracker。该方法通过网络边缘的eTracker分布实现peer列表的保存,不但消除传统集中式Tracker的性能瓶颈,而且通过eTracker对本地peer的识别,优化了P2P系统的peer选择。 相似文献
19.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
20.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献