Planar Routing Algorithm for High Performance Multi-layer Layouts
碩士 === 國立彰化師範大學 === 工業教育學系 === 85 === In this thesis, we present a new planar routing strategy for high performance multi-layer layouts. The objective of the routing for one layer is to route nets optimizing routing performance, i.e., maxim...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/24826105644311404647 |
Summary: | 碩士 === 國立彰化師範大學 === 工業教育學系 === 85 === In this thesis, we present a new planar routing strategy for
high performance multi-layer layouts. The objective of the
routing for one layer is to route nets optimizing routing
performance, i.e., maximizing the completeness of routing with
minimum overhead of routed wire length and discontinuities such
as bends. We use a1 and a2 parameters to measure the overhead of
routing lengths and number of bends, respectively. And we use b
parameter to measure the completeness of routing. The main goal
of our approac
|
---|