Gate sizing in MOS digital circuits with linear programming

A solution is presented to tune the delay of a circuit composed of cells to a prescribed value, while minimizing power consumption. The tuning is performed by adapting the load drive capabilities of the cells. This optimization problem is mapped onto a linear program, which is then solved by the simplex algorithm. This approach guarantees to find the global optimum, and has proven feasible for circuits of up to several thousand cells. The method can be used with any convex delay model. Results show that circuits can be speeded up by a factor of 2 at a cost of only 10 to 30% of extra power.<<ETX>>

[1]  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.

[2]  M.D. Matson,et al.  Macromodeling and Optimization of Digital MOS VLSI Circuits , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  David Marple.  Transistor Size Optimization in the Tailor Layout System , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Lance A. Glasser,et al.  Delay and Power Optimization in VLSI Circuits , 1984, 21st Design Automation Conference Proceedings.

[5]  Alberto Sangiovanni-Vincentelli,et al.  Optimization-based transistor sizing , 1988 .

[6]  William H. Kao,et al.  Algorithms for Automatic Transistor Sizing in CMOS Digital Circuits , 1985, 22nd ACM/IEEE Design Automation Conference.

[7]  William H. Kao,et al.  ARIES: A Workstation Based, Schematic Driven System for Circuit Design , 1984, 21st Design Automation Conference Proceedings.

[8]  William Orchard-Hays,et al.  Advanced Linear-Programming Computing Techniques , 1968 .