基于多变量LSTM-AE方法的地面测发控系统异常检测

火箭地面测发控系统流程复杂,为自动检测系统运行流程中的异常,本文提出一种基于多变量长短时记忆自编码器(LSTM-AE,Long-short Term Memory-Autoencoder)方法的测发控系统运行异常检测方法。首先对正常系统运行数据进行分析,对系统中开关量和数字量数据进行归一化处理,并系统中模拟量信息进行统计特征提取。然后将提取的模拟量特征和其他数字量信息组成系统运行特征向量,并作为LSTM-AE的样本输入,经自编码学习自动识别系统状态,并建立系统状态迁移异常检测模型。通过对某火箭地面测发控流程监测数据的自动建模,实现了对仿真注入故障的高效实时检测。仿真结果表明,本文所提的自编码方法优于传统的BP神经网络方法。     

简化微处理器与温度传感器之间的接口

数字系统常常需要测量,控制和保持温度,而温度是一个模拟量,如果采用适当的技术和元件,将模拟温度量转化为数字量并不困难。本文介绍了几种简单的微处理器与传感器的接口电路。     

基于FPGA与AD5422的PLC模拟量扩展单元的设计

本文设计了一种以FPGA为核心,基于AD5422实现多路高精度输出的PLC模拟量扩展单元模块.设计先对现有的方案进行了分析和讨论,之后对FPGA内部相关处理机制和实现方案做了详尽的论述,经过仿真和测试验证了设计的可行性.相比于传统的模拟量扩展单元模块,本系统具有处理速度快、方便、灵活,电路精简,抗干扰能力强等优点.     

LTE-Advanced网络Uu接口多协议关联方案的研究与实现

针对LTE-Advanced网络移动数据业务爆炸性增长、多协议关联分析处理效率低下等问题,在传统信令监测系统的基础上,提出了一种采用大数据技术(存储、处理和分析)和多协议关联分析技术的LTE-Advanced网络Uu接口多协议关联分析系统.首先,对Uu接口的L1、L2、L3数据业务流程进行高效处理和精准分析,然后进一步关联分析用户数据信令流程和用户业务数据流程.最后,将所提系统应用于LTE-Advanced网络Uu接口数据的现网测试中.测试结果表明:设计的多协议关联分析系统达到了预期的效果,对提升用户体验、高效进行大数据分析以及精准营销领域具有推广意义.     

气象卫星数据接收处理流程简化模式设置

介绍了气象数据卫星广播接收系统（CMACast系统）数据接收机与Micaps数据接口在基层气象台站应用的一种简化模式、设置方法以及维护注意事项。此种模式与传统模式相比,不仅节约了硬件成本,简化了气象卫星资料传输、处理和存储流程,而且便于日常操作和维护。     

基于PC总线模板的温度测控系统

本文主要介绍采用PG总线，集成模板式结构，即尽量用集成的模拟量输入输出模板和开关量输入输出模板来实现系统的各种测量，转换，接口电路等功能，从而使系统硬件设计大为简化，系统可靠性得到保障，这些输入输出模拟可直接插入主机的扩展槽中，使用方便。     

半导体设备运动控制系统接口设计

在多自由度纳米级运动平台的运动控制系统架构中,运动控制器和电机驱动器之间增加了运动控制系统接口的设计,用于实现光纤接口和模拟量控制接口的转换,从而完成运动平台的驱动控制。运动控制系统接口的设计主要针对光纤接口的运动控制器及常用的模拟量控制伺服或线性驱动器,适用性强。主要描述了运动控制系统接口的功能与构成、硬件设计、现场可编程逻辑门阵列（FPGA）程序设计。     

基于FPGA的多路模拟信号源设计

提出了一种基于FPGA的多路模拟量信号源设计方法。该系统以Altera公司的Cyclone系列EP2C8为核心。它包括多路数模转换单元、电源隔离、稳压单元及运算放大单元等,实现了电源独立的不同频率、不同波形的多路模拟量信号源。主要模块采用VHDL实现,通过合理利用路选通信号对各路模拟量信号进行锁存,实现了各路数据的正确分路,各路模拟量波形输出,并通过USB接口上传数据并实时显示,经多次测试表明,该系统稳定可靠,每路输出电压纹波小于30 mV。     

集群通信系统多媒体调度台的实现

文章提出了一种实用的集群通信系统多媒体调度台实现方案 ,给出了其硬件实现方法以及数据通信的软件控制流程 ,并对其实现的功能作了简要介绍 ,该多媒体调度台在我国警用集群通信系统中得到了广泛应用 ,效果良好。     

DCS模拟量数据的分部压缩方法

传统压缩方法对DCS模拟量进行压缩效果不佳。要得到较好的压缩效果就要从模拟量在计算机中表示的方法入手。本文分析了DCS模拟量在计算机中存储和表示方法及其特点,对原始数据进行预处理,使数据表现出较明显的冗余信息,然后对数据的不同部分,采用不同的压缩方法,每种压缩算法压缩模拟量数据的一部分。通过测试表明该分部压缩方法算法简单,实现方便,可推广到一般工业过程数据的压缩。     

A measure of graceful degradation in parallel-computer systems

Gracefully-degrading multiprocessor systems are studied using a multistage interconnection-network-based parallel computer as an example. A measure of graceful degradation, system functionality, is used and analyzed; it is proportional to the number of data-flow paths in a system in the presence of faults. Each path consists of a processor, switches, and a memory. Under this approach, graceful degradation of a multiprocessor system can be evaluated as a combination of individual degradations in each of the processor, memory, and network subsystems. A detailed evaluation of graceful degradation of tightly coupled multiprocessor systems (of large size) based on multistage interconnection networks is given     

Determining the minimum iteration period of an algorithm

Digital signal processing algorithms are repetitive in nature. These algorithms are described by iterative data-flow graphs where nodes represent computations and edges represent communications. For all data-flow graphs, there exists a fundamental lower bound on the iteration period referred to as theiteration bound. Determining the iteration bound for signal processing algorithms described by iterative data-flow graphs is an important problem. In this paper we review two existing algorithms for determination of the iteration bound. Then we propose another novel method based on theminimum cycle mean algorithm to determine the iteration bound with a lower polynomial time complexity than the two existing techniques. It is convenient to represent many multi-rate signal processing algorithms by multi-rate data-flow graphs. The iteration bound of a multi-rate data-flow graph (MRDFG) can be determined by considering the single-rate data-flow graph (SRDFG) equivalent of the MRDFG. However, the equivalent single-rate data-flow graph contains many redundant nodes and edges. The iteration bound of the MRDFG can be determined faster if these redundancies in the equivalent SRDFG are first removed. A previous approach has considered elimination of edge redundancy. In this paper we present an approach to eliminatenode redundancy in the MRDFG. We combine elimination of node and edge redundancies to propose a novel algorithm for faster determination of the iteration bound of the MRDFG.This research was supported by the Advanced Research Projects Agency and monitored by Wright—Patterson AFB under contract number F33615-93-C-1309.     

一种针对位操作密集应用的扩展指令自动选择方法

本文提出一种结合位操作分析和变换的扩展指令自动选择方法。该方法在数据流图中引入新的位操作中间表示结点,可精简地描述位访问操作。编译器可对程序数据流图进行选择性循环展开和位操作分析优化,并将其转换为带有直接表示位赋值操作结点的数据流图。实验结果表明,基于新的数据流图进行扩展指令选择可有效提升位操作密集型应用的性能     

一种高分辨率机载SAR实时数据处理系统设计

该文给出了一种高分辨率合成孔径雷达实时数据处理系统的方案设计与实现。该方案采用PowerPC G4处理器进行运算,采用VME作为系统总线,RACE++作为高速数据通道,具有稳定、计算能力强、可灵活配置等优点。通过简单的扩展或裁减就可以提供不同的计算能力与数据带宽,可以适合于多种分辨率与模式的SAR系统实时数据处理。     

Progressive and explicit refinement of scheduling for multidimensional data-flow applications using uml marte

Process networks and data-flow graphs are used to capture data-dependencies in computation-intensive embedded systems. Their simplicity allows the computation of static schedules that reduce the dynamic overhead and increase predictability. The resulting schedule is a total ordering of actor computations and communications. It can therefore become an over-specification of the initial system when several schedules are valid. This is particularly the case for multidimensional data-flow applications. We propose a methodology to avoid such an over-specification. We propose to use logical time to capture explicitly all the valid schedules for a given multi-dimensional data-flow model. Then, we show that the proposed approach allows for a progressive and explicit refinement of computation scheduling that also captures constraints imposed by the environment and the execution platform. All this is achieved by using uml marte concepts and the resulting models can be considered for simulation and analysis with existing tools for early design validation. The whole approach is validated on a typical application devoted to radar signal processing.     

Adaptive Path Selection Scheme with Combining for Multiple Relaying Cooperative Communications Networks

In future communications, cooperative communications with relay networks will be one of the most effective schemes to enlarge the coverage area and to boost the data rate. In the recent research results, the path selection, power allocation, and relay protocols on relay networks are the most important factors to improve the system performance. However, the channel quality of the direct transmission path and the relaying path has an influential effect on the performance of relay networks. Therefore, in this paper, we propose a best relaying path selection (BRPS) scheme to obtain the path diversity to improve the system capacity and data rate for cooperative networks (CNs). Simulation results show that the more the relay nodes are selected, the lower the bit error rate (BER) is. The proposed BRPS scheme obtains a high concession between both BER and system capacity for CNs.     

基于Nios SOPC的车载台最佳行车路径计算系统设计

提出了一种计算最优路径的硬件系统及其实现方法。采用Altera片上可编程器件Nios SOPC技术、硬件并行设计等关键技术,设计并实现启发式最佳路径搜索算法,实现了具有并行计算能力的硬件加速器,并利用Nios提供的用户指令定制功能,应用动态规划方法定制了三条专用信号处理指令,进一步增强了系统的运算能力,使系统具有良好的实时处理能力,可成倍地提高系统的数据处理能力。     

A path tracking control system for autonomous mobile robots: an experimental investigation

A path tracking control system developed for autonomous mobile robots driven by wheels is described. In conventional approaches, the path is usually planned by smooth curves with curvature-continuity and a path tracking controller is independently designed to compensate the path error occurring in the navigation. However, smooth path planning is difficult to execute on-line due to the computational burden. In addition, the conventional path tracking algorithm often causes unpredictable tracking motion when large path error occurs. In previous work, the present authors presented a bang-bang path tracking algorithm by which smooth and stable tracking motion could be obtained even for the path given by simple combination of straight lines or circles and its effectiveness was proven via preliminary simulation studies. However, there still remained the problem that the design parameter called landing coefficient could not be optimally chosen and performance verification through real system application was not accomplished. In this study, we improve the algorithm which can determine the design parameters analytically and verify its performance by implementing the algorithm in an actual mobile robot control system designed using a personal computer. To investigate the performance of the control system, a series of path tracking experiments was conducted for a two-wheel driven robot developed in the laboratory.     

Object-oriented communication structures for multimedia datatransport

The evolving multimedia applications generate requirements for complex transport capabilities, i.e., functional features, in the end-to-end communication system such as handling of heterogeneity among communicating terminals, supporting finer levels of user-specifiable quality of data transport service, and synchronization of various data streams for delivery at users in real time. Accordingly, the communication system may be viewed as extending the basic capabilities provided by the backbone network (e.g., bandwidth allocation) into a set of transport capabilities suitable for complex applications. This paper presents: (1) an object-oriented view of the user interface to the communication system with an elegant separation of data transport functionalities, and (2) an approach to the design of underlying transport protocols. The object-orientation decomposes an application-level data transport into a set of network channel objects, with each channel object handling a separate data stream. The object interactions are modeled using a “data-flow programming” style, which allows a richer set of protocols to implement the communication system and offers flexibility to accommodate complex and heterogeneous subscriber services/terminals. The “data-flow programming” method also allows a high degree of communication level parallelism among data transport through channels. The view of a multimedia communication system as a “parameterizable black-box”, as underscored in the object-oriented structuring, allows easier interworking of the communication system with existing networks and easier integration of multimedia transport into programming environments