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

通孔最小化的三层不规则边界通道布线
引用本文:宋学军,刘美轮.通孔最小化的三层不规则边界通道布线[J].天津大学学报(自然科学与工程技术版),1992(4):41-47.
作者姓名:宋学军  刘美轮
作者单位:天津大学电力及自动化工程系 (宋学军),天津大学电力及自动化工程系(刘美轮)
摘    要:提出了一种以连通孔和布线区域最小化为目标的三层不规则边界通道布线算法。算法将通道边界的凹陷区域看成固定障碍,利用填充和压缩方法,使线网绕过障碍,实现互连。算法已用PASCAL语言编程,并在XT/286机上实现。结果表明,该算法不仅使通孔数减少,而且由于利用了各凹陷区域之间的面积进行布线,通道宽度也相应减小。

关 键 词:VLSI布图  三层通道布线  不规则边界

A VIA MINIMIZATION CHANNEL ROUTER FOR THREE-LAYER CHANNEL WITH IRREGULAR BOUNDARIES
Song Xuejun Liu Meilun.A VIA MINIMIZATION CHANNEL ROUTER FOR THREE-LAYER CHANNEL WITH IRREGULAR BOUNDARIES[J].Journal of Tianjin University(Science and Technology),1992(4):41-47.
Authors:Song Xuejun Liu Meilun
Institution:Dept. of Electrical Engineering and Automation
Abstract:In LSI/VLSI chip layout design, channel routing is one of the key steps. Generally, boundaries of the channel are two parallel lines. But sometimes, because of the different sized cells or macro cells, there may be some indentations on boundaries of the channel. In this paper, a channel router for three-layer channel with irregular boundaries is presented. The numbers of both vias and tracks are taken as the objectives. This algorithm has been coded in PASCAL and implemented. The experimental results are satisfactory.
Keywords:VLSI layout  three-layer channel routing  irregular boundaries  via minimization  net-layering graph  3-vertex colouring  net-order graph
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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