首页 | 本学科首页   官方微博 | 高级检索  
     

一般图拓扑的电源/地线线宽优化设计
引用本文:李春辉,范明钰,庄昌文,虞厥邦,黄劲. 一般图拓扑的电源/地线线宽优化设计[J]. 计算机辅助设计与图形学学报, 2000, 12(10): 731-735
作者姓名:李春辉  范明钰  庄昌文  虞厥邦  黄劲
作者单位:1. 电子科技大学光电子技术系,成都,610054
2. Ambow Corporation, 530 Berryessa Road, suite 434, San Jose, CA95131
摘    要:电源/地线(P/G)线宽优化是高性能超大规模集成电路(VLSI)物理设计的重要环节。文中通过研究一般图拓扑的P/G线宽优化的电路模型和数学模型,给出了基于单个节点的线宽优化的必要条件等几个有意义的性质,并在此基础上提出了P/G经宽优化的初始构造和优化的新算法,该算法避免了其它算法的许多冗余搜索,不需复杂的网络及敏感度分析,仿真结果表明,该算法得到相近的优化结果所需计算时间显著减少,达50%,此外,

关 键 词:VLSI 电源 地布线 线宽优化设计 图拓扑

Automatic Sizing of Power/Ground(P/G) Networks Having General Graph Topology
LI Chun-Hui,FAN Ming-Yu,ZHUANG Chang-Wen,YU Jue-Bang,HUANG Jin. Automatic Sizing of Power/Ground(P/G) Networks Having General Graph Topology[J]. Journal of Computer-Aided Design & Computer Graphics, 2000, 12(10): 731-735
Authors:LI Chun-Hui  FAN Ming-Yu  ZHUANG Chang-Wen  YU Jue-Bang  HUANG Jin
Abstract:The automatic sizing of Power/Ground (P/G) nets is one of the most critical stage in VLSI physical design. In this paper, we first give some new properties about the optimum P/G nets having general graph topology, and based on which we present an effective algorithm to find the optimum wire width of P/G nets. Our algorithm is fast by successfully avoiding the redundant search and the time consuming net analysis. Experimental results show that our algorithm is nearly 50% faster than other available algorithms, and it is universally applicable for both the tree and the general graph topology.
Keywords:VLSI physical design   power and ground routing   automatic sizing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号