Low power logic synthesis under a general delay model

  • Authors:
  • Unni Narayanan;Peichen Pan;C. L. Liu

  • Affiliations:
  • Design Technology, Intel Corporation, Santa Clara, California;Design Technology, Intel Corporation, Portland, Oregon;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan ROC

  • Venue:
  • ISLPED '98 Proceedings of the 1998 international symposium on Low power electronics and design
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Till now most efforts in low power lo gic synthesis have oncentr ated on minimizing the total switching activity of a circuit under a zero delay model. This simplification ignor es the effe cts of glitch tr ansitions which may contribute as much as 30% of the total power c onsumption of a circuit. Hence, low power logic synthesis techniques which optimize power under a zer o delay model ar e often not successful in attaining “r eal” p ower savings as measured under a more accurate gener al delay model. In pr actice, to ac curately estimate the switching activity in a circuit under a gener al delay model can be computationally expensive. Hence, to repeatedly call accurate but slow power estimation tools to dir ect the synthesis flow is not a viable approach in the design of low power synthesis tools. In this pap er we take advantage of a fast method for estimating the total switching activity in a circuit under a general delay model to synthesize low power circuits. Sp ecific ally,we use the appr oximation as a basis for algorithms that solve two problems: (1) low power te chnolo gy decomposition of gates under a gener al delay model (2) low power r etiming of sequential cir cuits under a general delay model.