Logic synthesis for large pass transistor circuits

Pass transistor logic (PTL) can be a promising alternative to static CMOS for deep sub-micron design. In this work, we motivate the need for CAD algorithms for PTL circuit design and propose decomposed BDDs as a suitable logic level representation for synthesis of PTL networks. Decomposed BDDs can represent large, arbitrary functions as a multi-stage circuit and can exploit the natural, efficient mapping of a BDD to PTL. A comprehensive synthesis flow based on decomposed BDDs is outlined for PTL design. We show that the proposed approach allows us to make logic-level optimizations similar to the traditional multi- level network based synthesis flow for static CMOS, and also makes possible optimizations with a direct impact on area, delay and power of the final circuit implementation which do not have any equivalent in the traditional approach. We also present a set of heuristical algorithms to synthesize PTL circuits optimized for area, delay and power which are key to the proposed synthesis flow. Experimental results on ISCAS benchmark circuits show that our technique yields PTL circuits with substantial improvements over static CMOS designs. In addition, to the best of our knowledge this is the first time PTL circuits have been synthesized for the entire ISCAS benchmark set.

[1]  D. Radhakrishnan,et al.  Formal design procedures for pass transistor switching circuits , 1985 .

[2]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[3]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.

[4]  Arunita Jaekel,et al.  A multilevel factorization technique for pass transistor logic , 1996, Proceedings of 9th International Conference on VLSI Design.

[5]  Robert K. Brayton,et al.  Heuristic Minimization of BDDs Using Don't Cares , 1994, 31st Design Automation Conference.

[6]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[7]  Hamid Savoj,et al.  Don't cares in multi-level network optimization , 1992 .

[8]  A. Albicki,et al.  A pass transistor regular structure for implementing multi-level combinational circuits , 1994, Proceedings Seventh Annual IEEE International ASIC Conference and Exhibit.

[9]  K. Cameron,et al.  Multiple-input, multiple-output pass transistor logic , 1995 .

[10]  Yasuhiko Sasaki,et al.  Top-down pass-transistor logic design , 1996, IEEE J. Solid State Circuits.

[11]  Anantha P. Chandrakasan,et al.  Low-power CMOS digital design , 1992 .

[12]  Kazuo Yano,et al.  Multi-level pass-transistor logic for low-power ULSIs , 1995, 1995 IEEE Symposium on Low Power Electronics. Digest of Technical Papers.

[13]  Kazuo Yano,et al.  A 3.8-ns CMOS 16*16-b multiplier using complementary pass-transistor logic , 1990 .

[14]  Srinivas Devadas,et al.  Boolean satisfiability and equivalence checking using general binary decision diagrams , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[15]  Takayasu Sakurai,et al.  Multiple-Output Shared Transistor Logic (MOSTL) , 1990 .

[16]  A.L. Sangiovanni-Vincentelli,et al.  Fast discrete function evaluation using decision diagrams , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

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

[18]  Robert K. Brayton,et al.  Decomposition Techniques for Efficient ROBDD Construction , 1996, FMCAD.

[19]  Anura P. Jayasumana,et al.  Pass-transistor logic design , 1991 .

[20]  F. Somenzi,et al.  Who are the variables in your neighbourhood , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[21]  Takayasu Sakurai.  Multiple-output shared transistor logic (MOSTL) family synthesized using binary decision diagram , 1990 .