Timing Optimization by Gate Resizing and Critical Path Identification

Due to the rapid progress in VLSI technology, the overall complexity of the chip has increased dramatically. Both more functions and higher speed are required in modern VLSI engineering. Therefore, using a minimum amount of extra hardware to meet timing requirements is becoming a major issue in VLSI design. Here, we propose an efficient method for timing optimization using gate resizing. To control hardware overhead, a minimum (or as small as possible) number of gates are selected for resizing with the aid of a powerful benefit function. To guarantee the performance of timing optimization, a modified version of PODEM ensures that each resized gate is located on at least one critical path. Thus, resizing a gate definitely reduces circuit delay. Simulation results demonstrate that our timing optimization method can efficiently reduce circuit delay with a limited amount of gate resizing (using reasonable computing time).

[1]  John K. Ousterhout.  A Switch-Level Timing Verifier for Digital MOS VLSI , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  David Hung-Chang Du,et al.  Critical path selection for performance optimization , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Saburo Muroga,et al.  Timing optimization for multi-level combinational networks , 1990, DAC '90.

[4]  Robert K. Brayton,et al.  Timing optimization of combinational logic , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[5]  L. H. Goldstein,et al.  Controllability/observability analysis of digital circuits , 1978 .

[6]  Sung-Mo Kang,et al.  Design Automation for Timing-Driven Layout Synthesis , 1992 .

[7]  Sachin S. Sapatnekar,et al.  A convex optimization approach to transistor sizing for CMOS circuits , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[8]  André Ivanov,et al.  Dynamic testability measures for ATPG , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Alberto L. Sangiovanni-Vincentelli,et al.  Timing Analysis in a Logic Synthesis Environment , 1989, 26th ACM/IEEE Design Automation Conference.

[10]  T. I. Kirkpatrick,et al.  PERT as an aid to logic design , 1966 .

[11]  Jacob A. Abraham,et al.  Test generation for digital systems , 1986 .

[12]  Robert B. Hitchcock,et al.  Timing verification and the timing analysis program , 1988, DAC 1982.

[13]  Jyuo-Min Shyu,et al.  A new approach to solving false path problem in timing analysis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[14]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[15]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[16]  Robert K. Brayton,et al.  Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network , 1989, 26th ACM/IEEE Design Automation Conference.

[17]  Hugo De Man,et al.  Static Timing Analysis of Dynamically Sensitizable Paths , 1989, 26th ACM/IEEE Design Automation Conference.

[18]  Sharad Malik,et al.  Delay computation in combinational logic circuits: theory and algorithms , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[19]  William W. Cohen,et al.  Synthesis and Optimization of Multilevel Logic under Timing Constraints , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[21]  David Hung-Chang Du,et al.  Efficient Algorithms for Extracting the K Most Critical Paths in Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[22]  Robert B. Hitchcock,et al.  Timing Verification and the Timing Analysis Program , 1982, 19th Design Automation Conference.

[23]  Robert B. Hitchcock,et al.  Timing Analysis of Computer Hardware , 1982, IBM J. Res. Dev..

[24]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[25]  Robert K. Brayton,et al.  Integrating functional and temporal domains in logic design , 1991 .

[26]  David Hung-Chang Du,et al.  Circuit enhancement by eliminating long false paths , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[27]  David Hung-Chang Du,et al.  Critical path selection for performance optirnization , 1991, 28th ACM/IEEE Design Automation Conference.

[28]  Michael Burstein,et al.  Timing Influenced Layout Design , 1985, DAC 1985.

[29]  Reinaldo A. Bergamaschi,et al.  The effects of false paths in high-level synthesis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[30]  Resve A. Saleh,et al.  Incremental techniques for the identification of statically sensitizable critical paths , 1991, 28th ACM/IEEE Design Automation Conference.

[31]  David Hung-Chang Du,et al.  On the General False Path Problem in Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[32]  Michael Burstein,et al.  Timing Influenced Layout Design , 1985, 22nd ACM/IEEE Design Automation Conference.

[33]  Hugo De Man,et al.  Timing verification using statically sensitizable paths , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[34]  David Hung-Chang Du,et al.  A path selection algorithm for timing analysis , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[35]  Carlo H. Séquin,et al.  ATV: an abstract timing verifier , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..