Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program

  • Authors:
  • Tezaswi Raja;Vishwani D. Agrawal;Michael L. Bushnell

  • Affiliations:
  • -;-;-

  • Venue:
  • VLSID '03 Proceedings of the 16th International Conference on VLSI Design
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the previous work, the problem of finding gatedelays to eliminate glitches has been solved by linearprograms (LP) requiring an exponentially largenumber of constraints. By introducing two additionalvariables per gate, namely, the fastest and the slowestarrival times, besides the gate delay, we reduce thenumber of the LP constraints to be linear in circuitsize. For example, the 469-gate c880 circuit requires3,611 constraints as compared to the 6.95 million constraintsneeded with the previous method. The reducedconstraints provably produce the same exactLP solution as obtained by the exponential set of constraints.For the first time, we are able to optimize allISCAS'85 benchmarks. For the c7552 circuit, whenthe input to output delay is constrained not to increase,a design with 366 delay buffers consumes only34% peak and 38% average po er as compared toan unoptimized design. As shown in previous work,the use of delay buffers is essential in this case. Thepracticality of the design is demonstrated by implementingan optimized 4-bit ALU circuit for which thepower consumption as obtained by a circuit-levelsimulator.