A new global router using zero-one integer linear programming techniques for sea-of-gates and custom logic arrays

A global routing method is proposed for sea-of-gates (SOG) arrays and custom logic arrays based on a zero-one linear integer programming technique. This method overcomes the various difficulties due to numerous physical constraints faced by many heuristic routing algorithms. In the proposed approach, all the physical constraints are rigorously modeled in the constraint equations. Alternatives for all the nets are considered simultaneously with the routing environment, instead of being routed in a particular net-ordering. An optimal set of global paths routing all the nets is found with well established zero-one linear integer programming methods. The global router has run successfully on industrial SOG circuits, including 108,000 transistor circuits with 9400 nets, achieving 100% routing and high packing densities, which compare favorably with recently reported results. >

[1]  S. Horiguchi,et al.  500 k transistor custom BiCMOS LSI using automated macrocell design , 1989, IEEE International Solid-State Circuits Conference, 1989 ISSCC. Digest of Technical Papers.

[2]  Y. Enomoto,et al.  A 200 k gate 0.8 mu m mixed CMOS/BiCMOS sea-of-gates , 1990, 1990 37th IEEE International Conference on Solid-State Circuits.

[3]  Jason Cong,et al.  Over-the-cell channel routing , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  B. Carney,et al.  A high density BiCMOS direct drive array , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.

[5]  Ren-Song Tsay,et al.  A new approach to sea-of-gates global routing , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[6]  M.A. Horowitz,et al.  A single-chip, functional tester for VLSI circuits , 1990, 1990 37th IEEE International Conference on Solid-State Circuits.

[7]  H. Veendrick,et al.  An efficient and flexible architecture for high-density gate arrays , 1990, 1990 37th IEEE International Conference on Solid-State Circuits.

[8]  T. Okabe,et al.  A 1.4 M-transistor CMOS gate array with 4 ns RAM , 1989, IEEE International Solid-State Circuits Conference, 1989 ISSCC. Digest of Technical Papers.

[9]  Michel J. Declercq,et al.  An integrated layout system for sea-of-gates module generation , 1991, Proceedings of the European Conference on Design Automation..

[10]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Ernest S. Kuh,et al.  An Algorithm for Performance-Driven Placement of Cell-Based ICs , 1991 .

[12]  Man-Tak Shing,et al.  A decomposition algorithm for circuit routing , 1985 .

[13]  Jiri Soukup.  Global Router , 1979, 16th Design Automation Conference.

[14]  M. Hatanaka,et al.  A CMOS sea-of-gates array with continuous track allocation , 1989, IEEE International Solid-State Circuits Conference, 1989 ISSCC. Digest of Technical Papers.

[15]  M. Declercq,et al.  A Highly Flexible Sea-of-Gates Structure for Digital and Analog Applications , 1988, ESSCIRC '88: Fourteenth European Solid-State Circuits Conference.

[16]  James D. Gallia,et al.  High-performance BiCMOS 100 K-gate array , 1990 .

[17]  A. P. C. Ng,et al.  Experimental results for a linear program global router , 1987 .

[18]  Dana S. Richards,et al.  An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Sung-Mo Kang,et al.  Performance-driven layout of CMOS VLSI circuits , 1990, IEEE International Symposium on Circuits and Systems.

[20]  K. Mashiko,et al.  A bipolar-PMOS merged basic cell for 0.8 mu m BiCMOS sea-of-gates , 1990, IEEE Proceedings of the Custom Integrated Circuits Conference.