An efficient optimum channel routing algorithm

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 o...

Full description

Saved in:
Bibliographic Details
Published inIEEE Proceedings of the SOUTHEASTCON '91 pp. 1179 - 1183 vol.2
Main Author Lin, Z.-M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1991
Subjects
Cost function
Educational institutions
Routing
Very large scale integration
Wire
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780780300330
0780300335
DOI:10.1109/SECON.1991.147952