一种VLSI设计到无向赋权图的转换系统  

Converter to Translate VLSI Design to Weighted Undirected Graph

作　　者：孙凌宇[1] 冷明[1,2] 曾小荟[1] 郁松年[2] 

机构地区：[1]井冈山大学计算机科学系,江西吉安343009 [2]上海大学计算机工程与科学学院,上海200072

出　　处：《微电子学与计算机》2009年第7期57-59,共3页Microelectronics & Computer

基　　金：科技部国际合作项目(CB7-2-01);上海市教育委员会科研创新项目(08YZ13);江西省教育厅科学技术研究项目(GJJ09590)

摘　　要：基于VLSI剖分问题的需要,设计并实现了VLSI设计到无向赋权图的转换系统(VLSI/Graph Converter,VGC).介绍了电路构造图和图文件存储格式,给出了VGC的处理流程图,提出了针对VLSI线网的无向赋权图转换算法.该算法解决的关键问题是,遍历树状结构的VLSI线网,将其转换为无向赋权图并存储为指定的图文件格式.VGC系统在Windows平台下用C++实现.实验及分析表明,该系统能正确地将Verilog语言描述的门级CPU转换为无向赋权图,避免了直接在VLSI线网上进行剖分,提高了VLSI剖分的效率.A VLSI/Graph Converter is proposed and implemented for VLSI partitioning problem. The graph representation of circuit and the format of graph storage are described. The VGC＇ s flow diagram is presented. Furthermore, we propose the algorithm for converting VLSI netlist to weighted undirected graph in VGC. We discuss the key technologies of the algorithm that traverses the hierarchical netlist, converts netlist into weighted undirected graph which is stored as specified format file. VGC is implemented in Windows OS and C ＋ ＋. The experiment and analysis show that VGC could translate the gate CPU into weighted undirected graph and its objective is to improve the efficiency of VLSI partitioner by avoiding partitioning netlist directly.

关 键 词：VLSI设计 VLSI线网 无向赋权图 转换 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]