基于System Generator的动态局部可重构设计方法

在动态局部可重构设计过程中,系统级设计到现场可编程门阵列（FPGA）硬件实现,还需要大量的寄存器传输级（RTL）硬件语言编写,导致设计效率下降的问题。针对该问题,以Xilinx公司最新提出的动态局部重构设计流程———早期获取部分可重构（EAPR）为基础,利用System Generator软件,提出一种动态局部重构的设...     

Flexible Protocol Reconfiguration for Emergency Communication Systems

The necessity for services of emergency communication systems to be uninterrupted and reliable has brought forward strict requirements for express software upgrades of base stations. Based on reconfigurability technology, this paper presents a protocol reconfiguration scheme for emergency communication base stations. By introducing the concept of ‘local safe state,’ the proposed scheme could make the updating and replacement of the protocol software flexible and maintain interactions during the updating procedure to achieve seamless system upgrades. Further, taking TETRA protocol stack and VxWorks operating system as an example, specific processes and realization methods of reconfiguration are proposed in this paper, along with the measurements of the factors impacting on the system performance. Simulation results show that, compared with traditional technology, the method proposed significantly improves the system efficiency and does not interrupt system services.     

军事认知通信网络研究

针对军事通信网络的网络抗毁重建、服务质量、异构性互连互通方面的需求分析,提出了构建军事认知通信网络。论述了军事认知通信网络的体系结构,包括网络组成、功能实体、工作流程和网络要素;比较分析了军事认知通信网络与目前网络的突出功能特点;描述了认知环境多域认知技术、认知智能决策和重配置等关键技术。     

空天信息系统的容错设计与实现

为了提高SRAM型FPGA在空天信息系统应用中的可靠性,提出了一种基于FPGA局部动态可重构的容错系统设计方法.通过深入分析FPGA在空天信息系统应用中的故障机理,比较了当前应用较为广泛的抗空间辐射容错方法,结合FPGA 局部动态可重构技术的优点和Virtex-5器件的结构特点,实现了XC5VLX50T-1FFll36...     

流水行云:支持可扩展的并行分布式流处理系统

数据流处理系统,无论是集中式还是分布式,都需要克服单点瓶颈问题.不仅如此,如果数据流处理系统是静态配置的,那么还会出现处理节点供给不足或者过剩的情况,为此本文提出了一种支持可扩展的并行分布式数据流处理系统-流水行云,该系统根据有状态算子将查询拓扑划分为并行处理的子查询,并且通过有状态算子的分发器和收集器实现了数据流的保序,同时最大化减少并行处理的通信开销,不仅如此,结合负载均衡和重配置的可扩展技术使得该系统能够根据输入负载动态调整处理节点的负载和个数.60个节点组成的集群的实验证明了该系统的可扩展能力.     

可重构信息通信基础网络体系研究简

提出了“可重构网络”思想并建立可重构信息通信基础网络体系,然后在可重构网络功能参考模型的基础上分别创立了网络元能力理论、多态寻址路由机制、网络重构机理和安全可管可控机理,从而为构建一个支持目前业务和未来新业务的不同服务质量需求,功能灵活扩展,满足泛在互联、融合异构、可信可管可扩需求,支持现有网络兼容演进和适于规模应用的新型网络通信信息基础设施提供了一种解决途径。     

一种基于斜率-电阻相位插值的低功耗十倍频电路北大核心

基于65 nm CMOS工艺设计了一种低功耗低成本十倍频电路。在1.2 V电源电压下，电路功耗小于0.53 mW。提出了一种低复杂度的5段斜率-电阻相位插值方法，通过对四路正交斜率信号进行电阻相位插值，在8 MHz到24 MHz的输入频率范围内，实现了可重构的十倍频电路。该电路结构简单，仅包含正交方波信号发生器、斜坡信号发生器和提出的5段斜率-电阻相位插值器，可用于低功耗、低成本的倍频场合，且具有可接受的频率偏差。在输入频率为16 MHz,输入功率为-2.0 dBm时，电路输出功率为-12.9 dBm,倍频效率为4.40%。     

Reconfiguration of connected graph partitions

Motivated by recent computational models for redistricting and detection of gerrymandering, we study the following problem on graph partitions. Given a graph $G$ and an integer $k\ge 1$, a $k$-district map of $G$ is a partition of $V\left(G\right)$ into $k$ nonempty subsets, called districts, each of which induces a connected subgraph of $G$. A switch is an operation that modifies a $k$-district map by reassigning a subset of vertices from one district to an adjacent district; a 1-switch is a switch that moves a single vertex. We study the connectivity of the configuration space of all $k$-district maps of a graph $G$ under 1-switch operations. We give a combinatorial characterization for the connectedness of this space that can be tested efficiently. We prove that it is PSPACE-complete to decide whether there exists a sequence of 1-switches that takes a given $k$-district map into another; and NP-hard to find the shortest such sequence (even if a sequence of polynomial lengths is known to exist). We also present efficient algorithms for computing a sequence of 1-switches that take a given $k$-district map into another when the space is connected, and show that these algorithms perform a worst-case optimal number of switches up to constant factors.     

基于WOA的FBG形状传感器铺设角度偏差自矫正模型

FBG形状传感器的铺设角度偏差导致曲率和挠率测量误差，进而影响形状传感器的重构精度。针对该问题，文章提出了一种基于鲸鱼优化算法(Whale Optimization Algorithm, WOA)的FBG铺设角度偏差自矫正模型。重构实验验证了所提方法的有效性，不同形状的远端重构误差分别从11.66和22.6 mm降低至5.63和10.47 mm,相对误差分别从2.56%和4.96%降低至1.21%和2.25%,相对误差从2.56%和4.96%降低至0.95%和2.06%。