摘要
贪婪算法是VLSI设计中通道布线的常用算法,在电路原理图的自动布图中,也会遇到通道布线的问题。但传统的贪婪算法着重于使通道面积最小化,不能满足原理图中对布线结果有序化的要求。提出类贪婪算法,在原贪婪算法的基础上,通过修改处理规则,使得布线结果更加整齐有序,便于阅读,同时也保留了原算法简洁高速的优点。
Greedy algorithm is prevalent used in chunnel routing of VLSI design. The chunnel routing problem also exists in circuit schematics auto-drawing, but the conventional greedy algorithm, which emphasizes minimizing channel area, can' t satisfy circuit schematic's requirement of regularity. The derivative greedy algorithm putted forward in paper can increase routing result's regularity and readability, as well as keep conventional greedy algorithm's virtues, by revising handling rules based on primary algorithm frame.
出处
《计算机工程与设计》
CSCD
2002年第7期68-70,共3页
Computer Engineering and Design
