DocumentCode
3212744
Title
Modeling the vertical constraints in VLSI channel routing
Author
Jovanovic, Antonije D.
Author_Institution
Dept. of Electr. Eng., Toledo Univ., OH, USA
fYear
1993
fDate
5-6 Mar 1993
Firstpage
11
Lastpage
13
Abstract
Demonstrates that the vertical constraint graph (VCG) is not a complete representation of the vertical constraints of a channel, and proposes an edge-weight augmented VCG that is proved to be complete. Examples demonstrate the feasibility of a deterministic approach to the locally optimal resolution of cyclic vertical constraints when the information provided by the new model is used
Keywords
VLSI; graph theory; network routing; VLSI channel routing; cyclic vertical constraints; deterministic approach; edge-weight augmented VCG; locally optimal resolution; vertical constraint graph; vertical constraints; Computational geometry; Information geometry; Routing; Very large scale integration; Wire; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI, 1993. 'Design Automation of High Performance VLSI Systems', Proceedings., Third Great Lakes Symposium on
Conference_Location
Kalamazoo, MI
Print_ISBN
0-8186-3430-8
Type
conf
DOI
10.1109/GLSV.1993.224491
Filename
224491
Link To Document