Techniques for multilayer channel routing

The techniques described have been implemented in a multilayer channel router called Chameleon. Chameleon consists of two stages: a partitioner and a detailed router. The partitioner divides the problems into two-layer and three-layer subproblems such that global channel area is minimized. The detailed router then implements the connections using generalizations of the algorithms used in YACR2 (see ibid., vol.CAD-4, no.3, p.208-19, 1985). In particular, a three-dimensional maze router is used for the vertical connections; this methodology is effective even when cycle constraints are present. Chameleon has produced optimal results on a wide range of industrial and academic examples for a variety of layer and pitch combinations, and can handle a variety of technology constraints. >

[1]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

[2]  Richard J. Enbody,et al.  Near-Optimal n-Layer Channel Routing , 1986, DAC 1986.

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  A New Symbolic Channel Router: YACR2 , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Alberto Sangiovanni-Vincentelli,et al.  Two-Dimensional Compaction by 'Zone Refining' , 1986, DAC 1986.

[5]  Alberto Sangiovanni-Vincentelli,et al.  Chameleon: A New Multi-Layer Channel Router , 1986, DAC 1986.

[6]  Richard J. Enbody,et al.  Near-Optimal n-Layer Channel Routing , 1986, 23rd ACM/IEEE Design Automation Conference.

[7]  Yun Kang Chen,et al.  Three-Layer Channel Routing , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  C. Y. Lee An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[10]  Thomas G. Szymanski Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Susanne E. Hambrusch Channel Routing Algorithms for Overlap Models , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  David N. Deutsch A “DOGLEG” channel router , 1976, DAC 1976.