DocumentCode :
507481
Title :
Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree
Author :
Li, Liang ; Qian, Zaichen ; Young, Evangeline F Y
Author_Institution :
Dept. of Comput., Sci. & Eng., Chinese Univ. of Hong Kong, Hong Kong, China
fYear :
2009
fDate :
2-5 Nov. 2009
Firstpage :
21
Lastpage :
25
Abstract :
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner tree problem optimally. Our work is developed based on the GeoSteiner approach, modified and extended to allow rectilinear blockages in the routing region. We extended the proofs on the possible topologies of full Steiner tree (FST) to allow blockages, where FST is the basic concept used in GeoSteiner. We can now handle hundreds of pins with multiple blockages, generating an optimal solution in a reasonable amount of time. This work serves as a pioneer in providing an optimal solution to this difficult problem.
Keywords :
VLSI; circuit layout CAD; integrated circuit layout; network routing; trees (mathematics); GeoSteiner approach; VLSI physical design; full Steiner tree; obstacle-avoiding rectilinear steiner minimum tree; optimal solution; routing region; Ant colony optimization; Computer science; Large-scale systems; Permission; Pins; Routing; Steiner trees; Topology; Very large scale integration; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design - Digest of Technical Papers, 2009. ICCAD 2009. IEEE/ACM International Conference on
Conference_Location :
San Jose, CA
ISSN :
1092-3152
Print_ISBN :
978-1-60558-800-1
Electronic_ISBN :
1092-3152
Type :
conf
Filename :
5361319
Link To Document :
بازگشت