An efficient optimum channel routing algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationConference Proceedings - IEEE SOUTHEASTCON
PublisherPubl by IEEE
Pages1179-1183
Number of pages5
ISBN (Print)0780300335
Publication statusPublished - 1991
EventIEEE Proceedings of the SOUTHEASTCON '91 - Williamsburg, VA, USA
Duration: 1991 Apr 81991 Apr 10

Publication series

NameConference Proceedings - IEEE SOUTHEASTCON
Volume2
ISSN (Print)0734-7502

Other

OtherIEEE Proceedings of the SOUTHEASTCON '91
CityWilliamsburg, VA, USA
Period91-04-0891-04-10

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An efficient optimum channel routing algorithm'. Together they form a unique fingerprint.

Cite this