Advertisement

A New Channel Routing Algorithm

  • Wan S. Chan

Abstract

This paper presents a new algorithm for solving the two-layer channel routing problem with doglegging. Based on a set of intuitive and reasonable heuristics, the algorithm tries to obtain a channel routing configuration with a minimum number of tracks. For every benchmark problem tested, the algorithm gives a routing configuration with the smallest number of tracks reported in the literature.

Keywords

Bipartite Graph Benchmark Problem Density Column Vertical Segment Horizontal Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T. Yoshimura and E. S. Kuh, “Efficient algorithms for channel routing,” IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, vol. CAD-1, pp. 25–35, January 1982.Google Scholar
  2. [2]
    R. L. Rivest and C. M. Fiduccia, “A greedy channel router,” Proceedings of 19th Design Automation Conference, paper 27.2, June 1982.Google Scholar
  3. [3]
    D. N. Deutsch, “A dogleg channel router,” Proceedings of 13th Design Automation Conference, pp. 425–433, 1976.Google Scholar
  4. [4]
    E. L. Lawler, “Combinatorial optimization: networks and matroids,” Holt, Rinehart and Winston, New York, 1976.MATHGoogle Scholar
  5. [5]
    T. S. Hedges, K. H. Slater, G. W. Clow and T. Whitney, “The SICLOPS silicon compiler,” to appear in Proceedings of International Circuit and Computer Conference, September 1982.Google Scholar

Copyright information

© Computer Science Press, Inc. 1983

Authors and Affiliations

  • Wan S. Chan
    • 1
  1. 1.California Institute of TechnologyPasadenaUSA

Personalised recommendations