DocumentCode
2504266
Title
A non-minimal wire length algorithm for complex routing problems
Author
Abos, Imre G.
Author_Institution
Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary
fYear
1988
fDate
7-9 Jun 1988
Firstpage
2185
Abstract
A routing algorithm is presented which is based on the general (original) Lee-model and can be used for a wide range of design rules, pad (contact) sizes and shapes, and variable track widths and separations. Different design rules can be assigned to ground and power lines, signals, and special rules can be applied to selected modes. Via pads (contact holes) are inserted automatically. The connections are not of minimal length; their shape is optimized by a sophisticated path function in such a way that the spread of wires is nearly homogeneous in all phases of the routing process
Keywords
circuit layout CAD; monolithic integrated circuits; printed circuit design; complex routing problems; contact holes; design rules; general Lee model; nearly homogeneous; nonminimal wire length algorithm; pad sizes; power lines; routing algorithm; sophisticated path function; variable track widths; Algorithm design and analysis; Copper; Design automation; Routing; Shape; Signal design; Silicon carbide; Wire;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1988., IEEE International Symposium on
Conference_Location
Espoo
Type
conf
DOI
10.1109/ISCAS.1988.15377
Filename
15377
Link To Document