Symbolic algorithms for layout-oriented synthesis of pass transistor logic circuits

The paper presents a novel methodology for synthesizing PTL circuits, whose distinctive features are the use of a symbolic algorithm for the covering of the initial network in terms of PTL cells, and the exploitation of layout level area and delay model during the selection of the best covering solution. The results produced by the synthesis procedure on the full suite of the Iscas'85 combinational circuits are very encouraging.

[1]  Luca Benini,et al.  Decision Diagrams and Pass Transistor Logic Synthesis , 1997 .

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  Logic synthesis for large pass transistor circuits , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[3]  A. Kuehlmann,et al.  Equivalence Checking Using Cuts And Heaps , 1997, Proceedings of the 34th Design Automation Conference.

[4]  Kazuo Taki,et al.  A Logic Synthesis System for the Pass-Transistor Logic SPL Kenzo Konishi , 1996 .

[5]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[6]  Alberto Sangiovanni-Vincentelli,et al.  Logic synthesis for vlsi design , 1989 .

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

[8]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[9]  Kamran Eshraghian,et al.  Principles of CMOS VLSI Design: A Systems Perspective , 1985 .

[10]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.