| 摘要: |
| 本文提出了一种用于门阵列和标准单元版图自动设计中的走线道分配算法一FARM，它连接总体布线和通道布线．算法目标是使通道的最大密度最小，同时考虑减小线网长度和通孔数．FARM由两部分组成：多行走线道分配和单行走线道分配它已用c语言在DE(：工作站和sun工作站上实现，并已用于我们开发的双层CMOS门阵列布图系统MALS3中．实验例子表明，它与Timborwolf 5.6的结果相当或更好． |
| 关键词: 走线道分配，总体布线，集成电路布图．门阵列，标准单元． |
| DOI： |
| 分类号: |
| 基金项目: |
|
| AN EFFICIENT FEED—THROUGH ASSIGNMENT ALGORITHM FOR GATE ARRAY AND STANDARD CELL LAYOUT |
|
Hong Xianlong,Huang Jin
|
| Abstract: |
| In this paper，an efficient feed—through assignment algorithm，FARM，is proposed to minimize the maximum channel density and at the same time to reduce，the wire length and via number．It connects the global routing with the channel routing．FARM consists of two parts：multi—row feed—through assignment and single row feed—through assignment．It is implemented in C language on DEC station 3100 and Sun—sparc2 station，and has been used in the Double—Layer CMOS gate array layout system—
MALS3．Experiments on several benchmarks demonstrate FARM achieves comparable or better results comparing with TimberWolf 5．6． |
| Key words: Feed—through assignment,global routing,layout for integrated circuits,gate array,standard cell． |
