Technology Decomposition and Mapping Targeting Low Power Dissipation

In this paper, we address the problem of minimizing the average power dissipation during the technology dependent phase of logic synthesis. Our approach consists of two steps. In the first step, we generate a NAND decomposition of an optimized Boolean network such that the sum of average switching rates for all nodes in the network is minimum. Our power-efficient decomposition procedure is optimal for dynamic CMOS circuits with uncorrelated input signals and produces very good results for static CMOS. In the second step, we perform a power efficient technology mapping that finds an optimal power-delay trade-off value (subject to the unknown load problem) for given timing constraints. We obtain an average of 21% improvement in power at the expense of 12.6% increase in area and without any degradation in performance on a number of benchmarks.

[1]  Kurt Keutzer,et al.  On average power dissipation and random pattern testability of CMOS combinational logic networks , 1992, ICCAD.

[2]  Kurt Keutzer,et al.  Estimation of average switching activity in combinational and sequential circuits , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[3]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[4]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[5]  K. Keutzer,et al.  On average power dissipation and random pattern testability of CMOS combinational logic networks , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[6]  Ping Yang,et al.  Pattern-independent current estimation for reliability analysis of CMOS circuits , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[7]  Farid N. Najm,et al.  Transition density, a stochastic measure of activity in digital circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[8]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[9]  Lawrence L. Larmore,et al.  A fast algorithm for optimal length-limited Huffman codes , 1990, JACM.

[10]  Massoud Pedram,et al.  A near optimal algorithm for technology mapping minimizing area under delay constraints , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.