Optimizing CMOS circuits for low power using transistor reordering

This paper addresses the optimization of a circuit for low power using transistor reordering. The optimization algorithm relies on a stochastic model of a static CMOS gate that includes the power internal nodes of the gate. This power consumption depends on the switching activity and the equilibrium probabilities of the inputs of the gate. The model allows an exploration of the different configurations of a gate that are obtained by recording its transistors. Thus, the best configuration of each gate is selected and the overall power consumption of the circuit is reduced.

[1]  Edward J. McCluskey,et al.  Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.

[2]  Jiing-Yuan Lin,et al.  Transistor reordering rules for power reduction in CMOS gates , 1995, ASP-DAC '95.

[3]  Kaushik Roy,et al.  Circuit optimization for minimisation of power consumption under delay constraint , 1995, Proceedings of the 8th International Conference on VLSI Design.

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

[5]  Razak Hossain,et al.  Reducing power dissipation in serially connected MOSFET circuits via transistor reordering , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  Mary Jane Irwin,et al.  Minimizing power consumption of static CMOS circuits by transistor sizing and input reordering , 1995, Proceedings of the 8th International Conference on VLSI Design.

[7]  C. Y. Roger Chen,et al.  Performance Enhancement of CMOS VLSI Circuits by Transistor Reordering , 1993, 30th ACM/IEEE Design Automation Conference.