Evaluating layout area tradeoffs for high level applications

The authors address the problem of evaluating area tradeoffs for VLSI layouts from high-level specifications (typically register-transfer level). An area prediction approach based on two models, analytical and constructive, are presented. A circuit design is partitioned recursively down to a level specified by the user, thus generating a slicing tree. An analytical model is then used to predict the shape function of each of the leaf subcircuits. By traversing the tree in post-order, the shape function of the entire layout design can be predicted constructively. This approach also permits the user to trade off the accuracy of the prediction versus the runtime of the predictor. Such a scheme is quite useful for high level design tasks. The authors show experimentally that the estimates obtained using this model are within 5% of the actual layout area for designs ranging from 125 to 12000 cells. >

[1]  Gwo-Dong Chen,et al.  An intelligent component database for behavioral synthesis , 1991, DAC '90.

[2]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[3]  Fadi J. Kurdahi,et al.  Techniques for area estimation of VLSI layouts , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Melvin A. Breuer,et al.  On Routing for Custom Integrated Circuits , 1982, DAC 1982.

[5]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[6]  Jacob A. Abraham,et al.  Average Interconnection Length and Interconnection Distribution Based on Rent's Rule , 1989, 26th ACM/IEEE Design Automation Conference.

[7]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Srinivas Devadas,et al.  Algorithms for hardware allocation in data path synthesis , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[11]  Abbas El Gamal,et al.  Two-dimensional stochastic model for interconnections in master-slice integrated circuits , 1981 .

[12]  Stephen W. Director,et al.  Mason: A Global Floorplanning Approach for VLSI Design , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Fadi J. Kurdahi,et al.  LAST: a layout area and shape function estimator for high level applications , 1991, Proceedings of the European Conference on Design Automation..

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

[15]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[16]  Xinghao Chen,et al.  A module area estimator for VLSI layout , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[17]  Massoud Pedram,et al.  Interconnection length estimation for optimized standard cell layouts , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[18]  Ikuo Harada,et al.  CHAMP: Chip Floor Plan for Hierarchical VLSI Layout Design , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  Massoud Pedram,et al.  Accurate prediction of physical design characteristics for random logic , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[20]  Gerhard Zimmerman,et al.  A new area and shape function estimation technique for VLSI layouts , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..