M.S. / Computer Science / A general river routing algorithm is described. It is assumed that there is one layer available for routing and the terminals are on the boundaries of an arbitrarily shaped rectilinear routing region. All nets are two terminal nets. No crossover is permitted between nets. A minimum separation must be maintained between wires to prevent design rule violations. The separation and default width for all nets are obtained from a parameter file. A command line option permits the user to change the width. The algorithm assumes no grid on the routing plane. The number of corners in a given route is reduced by flipping corners.
| Identifer | oai:union.ndltd.org:OREGON/oai:content.ohsu.edu:etd/73 |
| Date | 11 1900 |
| Creators | Holla, Jaya |
| Publisher | Oregon Health & Science University |
| Source Sets | Oregon Health and Science Univ. Library |
| Language | English |
| Detected Language | English |
| Type | Text |
| Format | Needs Adobe Acrobat Reader to view., pdf, 1692.942 KB |
| Rights | http://www.ohsu.edu/library/etd_rights.shtml |
Page generated in 0.3156 seconds