An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis

ABSTRACT

In this paper, we address the problem of power dissipation minimization in combinational circuits implemented using pass transistor logic (PTL). We transform the problem of power reduction in PTL circuits to that of BDD decomposition and solve the latter using the max-flow min-cut technique. We use transistor level power estimates to guide the BDD decomposition algorithm. We present the results obtained by running our algorithm on a set of MCNC benchmark circuits, and show on an average of 47% power reduction over these circuits; the comparison with the previously proposed low power pass transistor logic synthesis algorithms shows an average improvement of over 23% over the best previously published approach.

REFERENCES

• 1: Mazhar Alidina , José Monteiro , Srinivas Devadas , Abhijit Ghosh , Marios Papaefthymiou, Precomputation-based sequential logic optimization for low power, Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, p.74-81, November 06-10, 1994, San Jose, California, United States
• 2: Shanq-Jang Ruan , Rung-Ji Shang , Feipei Lai , Shyh-Jong Chen , Xian-Jun Huang, A bipartition-codec architecture to reduce power in pipelined circuits, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.84-90, November 07-11, 1999, San Jose, California, United States
• 3: [3] S.-J. Ruan et al. A Bipartition-Codec Architecture to Reduce Power in Pipelined Circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(2):343-349, Feb. 2001.
• 4: [4] K. Yano et al. A 3.8ns CMOS 16 × 16 multiplier using complementary pass transistor logic. IEEE Journal of Solid State Circuits, 25(2):388-395, Apr. 1990.
• 5: [5] K. Yano, Y. Sasaki, and K. Rikino. Top-Down Pass-Transistor Logic Design. IEEE Journal of Solid-State Circuits , 31(6):792-803, June 1996.
• 6: Richard Rudell, Dynamic variable ordering for ordered binary decision diagrams, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.42-47, November 07-11, 1993, Santa Clara, California, United States
• 7: Per Lindgren , Mikael Kerttu , Mitch Thornton , Rolf Drechsler, Low power optimization technique for BDD mapped circuits, Proceedings of the 2001 conference on Asia South Pacific design automation, p.615-621, January 2001, Yokohama, Japan [doi>10.1145/370155.370564]
• 8: [8] R. Tavares and M. Berkelaar. Reducing Switching Activity in Pass Transistor Circuits. In Proc. IWLS, Jun. 1999.
• 9: Thomas H. Cormen , Clifford Stein , Ronald L. Rivest , Charles E. Leiserson, Introduction to Algorithms, McGraw-Hill Higher Education, 2001
• 10: Rupesh S. Shelar , Sachin S. Sapatnekar, Recursive bipartitioning of BDDs for performance driven synthesis of pass transistor logic circuits, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
• 11: [11] F. Somenzi. CUDD: CU Decision Diagram package, Release 2.3.0. http://vlsi.colorado.edu/fabio/CUDD/.
• 12: [12] MOSIS Parametric Test Results for TSMC 0.25µ CMOS Runs. http://www.mosis.org/cgi-bin/cgiwrap/umosis/swp/params/tsmc-025/t04r-params.txt.

INDEX TERMS

Keywords:
Logic Synthesis, Pass Transistor Logic, Low Power