No abstract

The computational complexity of a probability-based combinational po~ver metric lies in the creation of a BDD for each node in the circuit. In this papeg we formalize the problem of jnding intermediate support-set which controls the size of BDD. i~b propose an erect alsorithm to solve it. }ik also propose an heuristic solution, Po\verDnve, for estimating power of larse circuits. Apart from being more accurate and several tire= faster than [2, 7], PowerDrivepossess the unique quality of beins canonical and of constant comploity, a very desirable quality forapo~ver metric Suidins a synthesis tool. Finally, the proposed poivermetric was able to Suide the synthesis tool [11] to optimize IarSe circuits which could not be synthesized by POSE [6], thus provins the effectiveness of our power metn.c.

No abstract

Abstract-A new method is presented to compute the exact observability don't cares (ODC's) for multiple-level combinational circuits. A new mathematical concept, called polarization, is introduced. Polarization captures the essence of ODC calculation on the otherwise difficult points of reconvergence. It makes it possible to derive the ODC of a node from the ODC's of its fanouts with a very simple formula. Experimental results for the 39 largest MCNC benchmark examples show that the method is able to compute the ODC set (expressed as a Boolean network) for all but one circuit in at most a few seconds.Index Terms-Don't cares, logic synthesis.