DocumentCode
3554563
Title
An efficient optimum channel routing algorithm
Author
Lin, Zhi-Ming
Author_Institution
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
fYear
1991
fDate
7-10 Apr 1991
Firstpage
1179
Abstract
An optimal channel routing algorithm for a detailed two-layer channel routing is proposed. Through the inclusion of appropriate net characteristic information in the node searching function, this algorithm expands far fewer nodes than Wang´s (1990) algorithm to obtain optimum solutions on all of the benchmark problems presented by T. Yoshimura and E.S. Kuh (1982). Since the two-layer model has a minimum number of vias and a minimum length of wires, the proposed algorithm is suitable for the routing of channels with mixed analog/digital signals
Keywords
VLSI; circuit layout CAD; trees (mathematics); VLSI chips; algorithm; benchmark problems; mixed analog/digital signals; net characteristic information; node searching function; optimum channel routing algorithm; searching tree; two-layer channel routing; Cost function; Educational institutions; Routing; Very large scale integration; Wire;
fLanguage
English
Publisher
ieee
Conference_Titel
Southeastcon '91., IEEE Proceedings of
Conference_Location
Williamsburg, VA
Print_ISBN
0-7803-0033-5
Type
conf
DOI
10.1109/SECON.1991.147952
Filename
147952
Link To Document