Gate-level synthesis for low-power using new transformations

A new logic optimization method of multi-level combinational CMOS circuits is presented, which minimizes both power as well as power dissipation per unit area. The method described here uses Boolean transformations which exploit implications at the gate-level, based on both controllability and observability relationships. New transformations which form the basis of our synthesis method are presented. The emphasis is on power consumption rather than on area. Experimental results demonstrate that circuits synthesized by our method consume less power with a comparable area than those synthesized by state-of-the-art tools.

[1]  Shih-Chieh Chang,et al.  Perturb And Simplify: Multi-level Boolean Network Optimizer , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[2]  Yahiko Kambayashi,et al.  The Transduction Method-Design of Logic Networks Based on Permissible Functions , 1989, IEEE Trans. Computers.

[3]  Dhiraj K. Pradhan,et al.  LOT: Logic optimization with testability - new transformations using recursive learning , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[4]  Massoud Pedram,et al.  POSE: power optimization and synthesis environment , 1996, DAC '96.

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

[6]  Massoud Pedram,et al.  Multi-level Network Optimization For Low Power , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[7]  Premachandran R. Menon,et al.  Multi-level Logic Optimization By Implication Analysis , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[8]  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.

[9]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .