调整门和连线尺寸以减小串扰的拉格朗日松弛法

本文给出了一个布线后减小串扰噪声的算法。该算法通过调整逻辑门和互连线的尺寸有效地减小了串扰噪声，在减小噪声的同时约束电路的最大延时，使得在串扰噪声和时序都满足约束的条件下最小化芯片面积。算法保证了改变逻辑门和线网尺寸不会破坏电路的时序约束。实验结果证明，本算法有效地减小了串扰。此算法不需回到布线阶段来优
优化串扰，减少了设计迭代次数，加快了设计收敛时间。     

高性能综合布线系统的测试及其意义

测试是检验综合布线质量的重要方法,该文对衰减、近端串扰损耗、近端串扰与衰减差、综合近端串扰、回波损耗、特性电阻等反映综合布线系统性能的重要技术指标进行了分析。并提出了如何从工程的角度来使上述技术指标更加符合规范的要求。     

嵌入式系统串扰问题分析

引言 在嵌入式系统硬件设计中,串扰是硬件工程师必须面对的问题。特别是在高速数字电路中,由于信号沿时间短、布线密度大、信号完整性差,串扰的问题也就更为突出。设计者必须了解串扰产生的原理,并且在设计时应用恰当的方法,使串扰产生的负面影响降到最小。     

综合布线系统的性能测试及其工程意义

测试是检验综合布线质量的重要方法,本文对衰减、近端串扰损耗、近端串扰与衰减差、综合近端串扰、回波损耗、特性电阻等反映综合布线系统性能的重要技术指标进行了分析。并提出了如何从工程的角度来使上述技术指标更加符合规范的要求。     

信号相关的串扰优化详细布线

针对超深亚微米IC布线设计中的串扰问题,提出基于改进遗传算法的串扰优化的详细布线方法．该方法同时考虑了产生串扰的动态和静态的因素,能够更加准确地反映线间串扰的情况,为布线的调整提供更大的余地．实验证明,该方法不但比现有的方法能更好地减少线间串扰,而且改进的遗传算法能显著地减少繁衍代数和运算时间。     

基于串扰影响的混合时序分析

针对产生串扰所需的耦合电容、信号翻转方向及时序信息，提出了包括串扰目标选择、串扰逻辑关系验证的混合时序分析算法。该算法在混合时序分析中引入测试生成，通过考察信号间的时序和逻辑关系来验证耦合电容处是否有串扰发生，并在串扰条件下验证电路的时序是否收敛。实验证明，该算法真实地反映了电路中串扰的分布情况，所得的延时分析结果也更为准确。     

数据中心万兆应用为何要采用屏蔽6A布线

高效、安全的布线系统是提升数据中心网络通信系统性能的关键。从抗串扰性、散热和节能效果等方面,对万兆屏蔽布线和非屏蔽布线两种方案进行了比较,指出数据中心布线更适合采用万兆屏蔽布线方案。同时,对万兆屏蔽布线系统的性能进行了简要的阐述。     

面向区域布线的层次式PB角勾链版图数据结构

无网格区域布线具有存储量小、布通率较高、易实现混合设计规划布线并可解决串扰问题等优点,无网格区域布线算法中,找到路径后对底层图数据库的修改时间在整个算法运行时间中占很大比例,因此,操作简便、快捷的版图数据结构对于网格区域布线算法非常重要,目前无网格区域布线算法中应用最广泛的版图数据结构是矩形勾链,其点查找和模块插入操作的复杂度均匀Ｏ（Ｎ＾１／２）,文中提出一种新型的结合了Ｂｉｎ结构与梯形角勾链结构     

自动布局布线程序

功述描述了用于规划芯片的自动布局布线程序。其特点是在单元电路版图实现之前进行布局布线以及布线是在单元内部进行，不存在专门的布线通道。这种布图模式，以多端网连接模型作为布局布线的连接模型，并以布线均匀作为主要的目标函数。 整个程序模块分为矩阵网格规划和布局，总体布线，端口分配三部分。在布局中采用最小切割算法。初始布线以布线均匀，连线长度最短为目标，并采用一个基于布线均匀的“重心“算法。通过再布线和通     

基于HyperLynx的电视跟踪系统信号完整性分析

在HyperLynx环境下,对反射和串扰这两种常见的信号完整性问题进行了仿真分析,提出了反射和串扰的抑制方案以及差分线的布线策略,在此基础上对以TS201为核心的电视跟踪系统的设计进行了改进。测试结果表明,在系统设计中进行有效的端接和合理的布局布线,可以提高信号的传输质量,避免和减小信号完整性问题。     

A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes

In this paper we propose a sufficient codition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes,It is based on an early work of the author on minial routing in 2-dimensional(2-D) meshes,Unlike many traditional models that assume all the nodes know global fault distribution or just adjacent fault information,our approach is based on the concept of limited global fault information,First,we propose a fault model called faulty cube in which all faulty nodes in the system are contained in a set of faulty cubes.Fault information is then distributed to limited number of nodes while it is still sufficeint to support minimal routing.The limited fault information collcted at each node is represented by a vector caaled extended safety level.The extended safety level associated with a node can be used to determine the existence of a minimal path from this node to a given destination .Specifically,we study the existence of minimal paths at a given source node,limited distribution of fault information,minimal routing,and deadlock-free and livelock-free routing.our results show that any minimal routing that is partially adaptive can be applied in our model as long as the dstination node meets a certain conditon.We also propose a dynamic planar-adaptive routing scheme that offers better fault tolerance and adaptivity than the planar-adaptive routing scheme in 3-D meshes.Our approach is the first attempt to address adaptive and minimal routing is 3-D meshes with faulty nodes using limited fault information.     

En-Route Transcoding缓存的优化放置和替换

对en-route transcoding缓存中的缓存路由和协同放置及替换问题进行了研究.提出了CCRA(cost-aware cache routing algorithm)缓存路由算法,能以可控的探测开销来发现潜在的、具有最小访问开销的缓存对象.在此基础上,建立了en-route transcoding缓存的分析模型,将缓存放置和替换问题形式化为一个最优化问题,并利用一种基于动态规划的方法来求解最佳缓存放置策略.仿真结果表明,与已有的元算法放置策略相比,该协同放置和替换策略可以获得更好的CSR性能.     

基于无线传感器网络路由协议的安全机制研究

针对无线传感器网络中现有部分路由协议考虑安全需求不够的问题,提出一种基于路由协议的安全机制(RPSS).该安全机制把节省节点能耗和增强路由安全性作为设计目标,采用低能量密钥管理方案和减少转发节点计算量的方法,有效地降低节点的耗能.通过预设密钥和证书,在路由建立阶段增加安全机制,得到一种较优的安全路由方案.经过安全性分析和性能分析,该安全机制可防御虚假路由信息、Sybile和确认欺骗等攻击;还具有适用面广、耗能低和计算量小的优势.     

A fault-tolerant routing scheme in dynamic networks

In dynamic networks,links and nodes will be deleted or added regularly.It is very essential for the routing scheme to have the ability of fault-tolerance.The method to achieve such a goal is to generate ore than one path for a given set of source and destination.In this paper,the idea of inderval routing is used to construct a new scheme(Multi-Node Label Interval Routing Scheme,or MNILIR scheme)to realizee fault-tolerance.Interval routing is a space-efficinet routing method for netwroks ,but the method is static and determinative,and it cannot realize faulttoloerance.In MNLIR scheme some nodes will have more than one label,thus some parirs of destination and source will have more than one path;the pairs of nodes, which have inheritance relation,will have the shortest path.Using this character,MNLIR scheme has better overall routing performance than the former interval routing scheme,which can be proven by simulations.The common problem concerning the insertion and deletion of nodes and links is considered in this paper.So if the networks have some changes in topology,MNLIR scheme may find alternative path for certain paris of nodes.In this way,fault-tolerance can be realized with only a little space added to store the multi-node labels.     

基于动态规划的无线传感器网络的路由算法

路由问题是无线传感器网络中的核心问题之一,其数据传送的多跳特点使得非常适合用动态规划的原理来设计传感器网络的路由算法.基于动态规划,通过节点跳数生成算法为传感器网络中的每个节点赋一个表示到Sink点跳数的节点跳数值,并分析了传感器网络的拓扑结构特点,然后给出了无线传感器网络中寻找从源到汇满足不同设计目标的最小跳数(MinH)、最小跳数最大剩余能量(MinHMaxRE)和最小跳数最小费用(MinHMinC)3种路由算法.探讨了最小跳数最小费用路由与最小费用路由之间的关系,并给出了判断最小跳数最小费用路径就是最小费用路径的一个充要条件.算法的能量消耗分析表明,所给路由算法能实现大幅度的能量节省.     

The Multi-Level Communication: Efficient Routing for Interconnection Networks

In this paper, we present a general methodology for the improvement of the criteria of a given routing scheme. We study particularly the correlation between deadlock-avoidance and paths' stretch factor [28]. We prove that the methodology preserves deadlock-avoidance. As the methodology starts from a primary communication scheme, we choose routing by Eulerian cycle rules [27] as the primary scheme. To validate the methodology, we apply the resulting routing scheme to the torus network. Then, making a judicious choice with regard to certain parameters, we prove that the result is an adaptive, deadlock-free, minimal and storage efficient routing algorithm for such networks.     

无线 Ad hoc 网络和传感网络中基于位置的、可靠的无信标传输路由方法

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.     

无线网状网跨层路由的研究

目前,无线网状网跨层路由设计方兴未艾,以往无线路由设计是基于最小跳数的,缺少对无线网状网特性的综合考虑,并不能充分发挥出无线网状网的优势。该文提出了基于"队列负载率"和"链路传输效率"的跨层路由协议算法,通过将MAC层的网络状态信息传递给网络层的路由代理,以便选择负载较小的最佳路由。通过仿真可以发现,改文提出的路由不仅显著提高了吞吐量,而且使包的投递更加可靠,提高了QoS。     

Crosstalk-Aware Routing Resource Assignment

Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.