Node normalization and decomposition in low power technology mapping

In CMOS technology the decomposition of the nodes of a circuit can significantly reduce the circuit power dissipation. We present a normalization algorithm which extracts the largest nodes of the given netlist. Then we examine a known node decomposition algorithm and propose a new one which is provable optimal and tractable for moderate node sizes. Reduction of the overall switching activity on standard benchmark circuits is shown for exact (ROBDD) and uncorrelated signal probabilities.

[1]  Robert K. Brayton,et al.  Decomposition of logic functions for minimum transition activity , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[2]  Reiner Kolla,et al.  TROY: a tree based approach to logic synthesis and technology mapping , 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.

[3]  Chi-Ying Tsui,et al.  Technology Decomposition and Mapping Targeting Low Power Dissipation , 1993, 30th ACM/IEEE Design Automation Conference.

[4]  Farid N. Najm,et al.  Transition density: a new measure of activity in digital circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Razak Hossain,et al.  Reducing power dissipation in CMOS circuits by signal probability based transistor reordering , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[7]  Chi-Ying Tsui,et al.  Power efficient technology decomposition and mapping under an extended power consumption model , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  John P. Hayes.  The Fanout Structure of Switching Functions , 1975, JACM.