用8097单片机访问16位RAM中的奇地址字

MCS96系列单片机的外部总线宽度是可以编程控制的.为了达到访问16位RAM奇地址空间中的字,需要特殊的硬件结构支持.笔者讨论了两种方案,并进行了比较分析.     

双DSP技术在无线分组网络路由控制器中的应用

介绍了双DSP技术在无线分组网络路由控制器中的应用,阐述了双DSP间通信方案的选择及双DSP系统的实现,提出了一种双DSP对多个串行通信控制器(SCC)的设计方案,并给出了具体的硬件、软件设计方法.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

数字式单边带调制的关键及实现方法

分析了传统模拟方法实现单边带调制的不足,给出了用数字信号处理方法实现单边带调制的实现方法,并分析了其中的正交调制、内插技术等关键技术,在此基础上设计并实现了一个以TI TMS320 芯片为核心的数字式单边带调制系统.与模拟调制法相比,该电路结构简单,性能稳定可靠.     

一种基于电压空间矢量控制的三相静止变流器设计

提出了一种以三相电压的合成电压空间矢量为控制对象的三相静止变流器的设计.该设计的优点在于,在三相负载不对称的情况下,能够保持三相电压的平衡.最后给出了该系统基于DSP的实现.试验结果验证了该方案的可行性.     

临近空间对地观测平台的矢量化建模及稳定性分析

研究了临近空间对地观测平台的矢量化建模和稳定性问题.定义了描述观测平台空间运动的坐标系及运动参数;在受力分析的基础上,根据Newton-Euler方程建立了矢量形式的六自由度非线性数学模型;基于此模型,应用Lyapunov稳定性理论对观测平台的稳定性进行了分析.研究结果表明:对于给定的未扰运动,观测平台是渐近稳定的;纵...     

改进类电磁算法在武器目标分配问题中的应用

通过基于级数的粒子编码变换方法,将武器目标分配问题的约束条件进行了化简.对原始类电磁算法,在种群初始化、局部搜索、合力计算以及粒子移动等各步骤对其进行改造,使之适应武器目标分配问题的整数解空间.最后通过数值实验验证了该改造后算法解决武器目标分配问题的有效性.     

基于结构聚集度的海面目标特征描述及匹配方法

在对海面目标进行光电图像跟踪时,由于跟踪技术的局限性,跟瞄点往往会出现对目标的"失跟"现象,为了判断这一情况,通常需要对前后帧跟瞄区域的目标图像特征进行对比判别。但红外图像基本不存在颜色及纹理特征,而仅使用形状特征对于持续运动中的复杂目标图像又难以取得良好的效果。为解决这一问题,提出了一种基于目标结构聚集度的特征描述及匹配方法。首先对目标图像进行均匀矩形划分,在此基础上建立基于矩形块填充比的邻域矩阵作为图像特征,计算相邻帧图像该特征的欧氏距离差,并加入面积差参数进行特征匹配。对多种不同情况下的实测及模拟目标进行了计算机仿真实验,结果表明这种特征能够有效判断"失跟"情况,并且对于光学及红外目标旋转具有较好的不变性。     

DLX虚拟处理器流水线性能分析

介绍了DLX虚拟处理器的结构特征和流水线处理机的工作原理,通过矩阵乘法运算实例模拟了程序在DLX虚拟处理器中的流水执行过程,并利用DLX的统计分析工具对流水线的性能进行对比分析,提出了流水线处理过程中潜在问题的解决方法,为设计和改进流水线结构及提高流水线处理机中算法的执行效率提供了参考依据。