用于混合信号处理器的嵌入式MCU系统

介绍一种用于混合信号处理器的嵌入式微控制器(MCU)系统。针对系统可重构的要求,采用将存储在片外EEPROM中的指令存取到片内指令SRAM中的方法,由MCU系统读取指令并执行所需要的操作。经过SMIC 0.18 µm CMOS混合信号工艺流片,芯片面积为 1.06 mm2,工作电源电压为1.8 V。测试结果表明,该系统能正确执行指令,产生符合SPI总线协议的数据对处理器进行配置,完成所需要的功能。     

不确定条件下控制分配问题的鲁棒优化方法

针对具有冗余执行机构的过驱动系统, 在考虑控制效率不确定性的条件下, 提出了一种基于鲁棒优化理论的控制分配算法. 研究了原始不确定鲁棒优化模型的建立和基于椭球不确定集的鲁棒对等式的转化问题, 并推广到可由锥二次不等式表示的不确定集的情况. 讨论了鲁棒优化控制分配算法的求解方法及其计算复杂度. 最后, 针对多操纵面飞机的最优控制分配问题与传统算法进行了仿真比较, 结果表明鲁棒优化算法能有效降低控制效率不确定性的影响, 使分配结果更为合理, 从而具有更好的鲁棒性, 同时能有效提高操纵面故障情况下闭环系统的控制重构能力, 很好地改善了飞控系统的性能.     

弹性资源下的测试系统资源配置方法

提出采用赋时有色Petri网对测试流程进行建模,用来优化自动测试系统的资源配置。给出了测试流程TCP-net模型的构建步骤;基于模型,给出了寻求测试流程最短测试用时的方法;给出了弹性资源的定义以及在弹性资源条件下最小资源集求解算法和资源分配策略;通过给出一个应用实例,证明了上述方法的有效性和实用性。     

一类多输入多输出系统的冗余设计

分析了多输入多输出多变量系统在某环节失效时系统的整体性,给出了针对开环传递函数矩阵以及解耦后新对象均为本质稳定对象时系统的冗余设计方法.该方法有效解决了某环节失效后对系统稳定性的影响,实现了复杂系统的容错控制.仿真结果表明,该冗余设计方法可行,能够实现系统的容错控制.     

通用鱼雷模拟器适应性软件开发

提出一种具有动态重配置功能的分布式仿真系统成员适应性软件构架,开发通用鱼雷模拟器的适应性软件,它由接口通信层、需求管理层、适应性重配层以及功能实现层构成,给出软件开发所需的关键技术,包括动态重配引擎、可配置化构件模型与功能构件库。利用该通用鱼雷模拟器适应性软件进行实例测试,结果验证了其可行性与有效性。     

Robust actuator fault isolation and management in constrained uncertain parabolic PDE systems

This paper presents a methodology for the design of an integrated robust fault detection and isolation (FDI) and fault-tolerant control (FTC) architecture for distributed parameter systems modeled by nonlinear parabolic Partial Differential Equations (PDEs) with time-varying uncertain variables, actuator constraints and faults. The design is based on an approximate finite-dimensional system that captures the dominant dynamics of the PDE system. Initially, an invertible coordinate transformation-obtained through judicious actuator placement-is used to transform the approximate system into a form where the evolution of each state is excited directly by only one actuator. For each state, a robustly stabilizing bounded feedback controller that achieves an arbitrary degree of asymptotic attenuation of the effect of uncertainty is then synthesized and its constrained stability region is explicitly characterized in terms of the constraints, the actuator locations and the size of the uncertainty. A key idea in the controller synthesis is to shape the fault-free closed-loop response of each state in a prescribed fashion that facilitates the derivation of (1) dedicated FDI residuals and thresholds for each actuator, and (2) an explicit characterization of the state-space regions where FDI can be performed under uncertainty and constraints. A switching law is then derived to orchestrate actuator reconfiguration in a way that preserves robust closed-loop stability following FDI. Precise FDI rules and control reconfiguration criteria that account for model reduction errors are derived for the implementation of the FDI-FTC structure on the distributed parameter system. Finally, the results are demonstrated using a tubular reactor example.     

Tradeoffs in process strategy games with application in the WDM reconfiguration problem

We consider a variant of the graph searching games that models the routing reconfiguration problem in WDM networks. In the digraph processing game, a team of agents aims at processing, or clearing, the vertices of a digraph D. We are interested in two different measures: (1) the total number of agents used, and (2) the total number of vertices occupied by an agent during the processing of D. These measures, respectively, correspond to the maximum number of simultaneous connections interrupted and to the total number of interruptions during a routing reconfiguration in a WDM network.Previous works have studied the problem of independently minimizing each of these parameters. In particular, the corresponding minimization problems are APX-hard, and the first one is known not to be in APX. In this paper, we give several complexity results and study tradeoffs between these conflicting objectives. In particular, we show that minimizing one of these parameters while the other is constrained is NP-complete. Then, we prove that there exist some digraphs for which minimizing one of these objectives arbitrarily impairs the quality of the solution for the other one. We show that such bad tradeoffs may happen even for a basic class of digraphs. On the other hand, we exhibit classes of graphs for which good tradeoffs can be achieved. We finally detail the relationship between this game and the routing reconfiguration problem. In particular, we prove that any instance of the processing game, i.e. any digraph, corresponds to an instance of the routing reconfiguration problem.     

可重构系统中基于空间邻接度的实时任务放置算法*

本文提出了一种基于三维空间邻接度的放置算法,该算法将硬件任务按照长、宽及调度时间构成一个三维资源模型,将每个硬件任务看成是一个空间块。首先对可重构资源进行编码,到达的任务总是通过某个顶点依附另一个任务的边界被放置,确定候选的放置顶点;然后以到达任务与已放置在三维空间的邻接度为代价函数,选择代价函数值最大的顶点放置任务,从而使得到达任务与已放置任务在三维空间接触的邻接面最大。可使任务安排得更紧凑,减小对系统资源的浪费,提高芯片利用率。     

面向嵌入式应用的数据并行语言设计

根据基于PIM(Processor-In-Memory)技术的数据并行计算机体系结构的特点和面向多媒体计算的应用需求,提出了面向嵌入式SIMD(Single Instruction Multiple Data)计算的数据并行语言PIMC。简单讨论了PIMC语言的形式化定义,并以数据并行图像处理的均值滤波算法为例对语言的使用作了说明。结合其他大量的数据并行编程实例,说明了该语言能够在基于PIM技术的SIMD并行计算机上正确描述基本多媒体处理算法的数据并行实现。     

构件模板动态实例化技术的研究与应用

本文介绍了构件体系结构下的模板动态实例化技术,该技术将构件模板与补充语义分离处理,引入动态实例化操作,为需求改变的动态配置提供了实用和有效的手段。