SMTBDD: New Form of BDD for Logic Synthesis

The main purpose of the paper is to suggest a new form of BDD – SMTBDD diagram, methods of obtaining, and its basic features. The idea of using SMTBDD diagram in the process of logic synthesis dedicated to FPGA structures is presented. The creation of SMTBDD diagrams is the result of cutting BDD diagram which is the effect of multiple decomposition. The essence of a proposed decomposition method rests on the way of determining the number of necessary ‘g’ bounded functions on the basis of the content of a root table connected with an appropriate SMTBDD diagram. The article presents the methods of searching non-disjoint decomposition using SMTBDD diagrams. Besides, it analyzes the techniques of choosing cutting levels as far as effective technology mapping is concerned. The paper also discusses the results of the experiments which confirm the efficiency of the analyzed decomposition methods.

[1]  H. A. Curtis,et al.  A new approach to The design of switching circuits , 1962 .

[2]  Richard M. Karp,et al.  Minimization Over Boolean Graphs , 1962, IBM J. Res. Dev..

[3]  Dariusz Kania,et al.  SMTBDD: New Concept of Graph for Function Decomposition , 2015 .

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

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

[6]  Adam Opara,et al.  Decomposition-based logic synthesis for PAL-based CPLDs , 2010, Int. J. Appl. Math. Comput. Sci..

[7]  Nagisa Ishiura,et al.  Shared binary decision diagram with attributed edges for efficient Boolean function manipulation , 1990, 27th ACM/IEEE Design Automation Conference.

[8]  Václav Dvorák,et al.  Heuristic Synthesis of Multi-Terminal BDDs Based on Local Width/Cost Minimization , 2009, 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools.

[9]  Klaus Eckl,et al.  A Boolean approach to performance-directed technology mapping for LUT-based FPGA designs , 1996, DAC '96.

[10]  Bernd Becker,et al.  The multiple variable order problem for binary decision diagrams: theory and practical application , 2001, ASP-DAC '01.

[11]  Hiroshi Sawada,et al.  New methods to find optimal non-disjoint bi-decompositions , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.

[12]  Dariusz Kania,et al.  Logic synthesis for PAL-based CPLD-s based on two-stage decomposition , 2007, J. Syst. Softw..

[13]  Hiroyuki Ochi,et al.  Breadth-first manipulation of SBDD of boolean functions for vector processing , 1991, 28th ACM/IEEE Design Automation Conference.

[14]  M. Kubica,et al.  Dekompozycja wielokrotna z wykorzystaniem SMTBDD , 2013 .

[15]  S. Minato.  Binary Decision Diagrams and Applications for VLSI CAD , 1995 .

[16]  Adam Milik,et al.  Logic synthesis based on decomposition for CPLDs , 2010, Microprocess. Microsystems.