A Highly Routable ULM Gate Array and Its Automated Customizaton

This paper describes the design of a new functional-cell gate-array with inherently high routability, and its automated customization software which achieves 100 percent first-time routing. Emphasis is placed upon the considerations which influence the selection of a functional array primitive. A highly structured interconnection architecture will be described, which employs interdigitating cell terminals in a polycell-like wiring channel topology to simplify the routing procedure for the array. The detailed structure and operation of an automatic customization software package is discussed. This package, developed specially for the array, utilizes the structured topology to achieve track densities which are comparable with those produced by state-of-the-art algorithms. This array has been fabricated, in a CMOS technology, as a test-vehicle for both the unusual topology and the unique functional cells. Throughout the study, emphasis has been placed on achieving a coherent strategy for producing efficiently routed gate-arrays with the minimum of sophisticated design tools. Examples will be cited to show that this methodology is economical both in the rapidity with which finished designs may be produced, and in its utilization of silicon-area.

[1]  William R. Heller,et al.  Prediction of wiring space requirements for LSI , 1977, DAC '77.

[2]  A. New Statistical efficiency of universal logic elements in realisation of logic functions , 1982 .

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

[4]  P. Jennings A Topology for Semicustom Array-Structured LSI Devices, and Their Automatic Customisation , 1983, 20th Design Automation Conference Proceedings.

[5]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

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

[7]  Lai-Chering Suen A Statistical Model for Net Length Estimation , 1981, 18th Design Automation Conference.

[8]  S. L. Hurst,et al.  A consideration of the minimum number of input terminals on universal logic gates and their realization , 1981 .

[9]  Brian W. Kernighan,et al.  An optimum channel-routing algorithm for polycell layouts of integrated circuits , 1973, DAC '73.

[10]  Frank R. Ramsay Automation of Design for Uncommitted Logic Array , 1980, 17th Design Automation Conference.

[11]  Shinichi Murai,et al.  An Integrated Computer Aided Design System for Gate Array Masterslices: Part 2 The Layout Design System Mars-M3 , 1981, 18th Design Automation Conference.

[12]  John M. Gould,et al.  The Standard Transistor Array (STAR) Part I-A Two-Layer Metal Semicustom Design System , 1980, 17th Design Automation Conference.

[13]  S. L. Hurst,et al.  A Comparison of Universal-Logic-Module Realizations and Their Application in the Synthesis of Combinatorial and Sequential Logic Networks , 1982, IEEE Transactions on Computers.

[14]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[15]  Michael Feuer Connectivity of Random Logic , 1982, IEEE Transactions on Computers.