BDS: a BDD-based logic optimization system

This paper describes a novel logic decomposition theory and a practical logic synthesis system, BDS. It is based on a new binary decision diagrams (BDD) decomposition technique which supports all types of decomposition structures, including AND, OR, XOR, and complex MUX, both algebraic and Boolean. As a result, the method is very efficient in synthesizing both AND/OR and XOR-intensive functions. It also has a capability to handle very large circuits, as it employs the BDD decomposition in the partitioned Boolean network environment. The experimental results show that BDD-based logic decomposition is a promising alternative to the existing logic optimization approaches. In particular, it offers a superior runtime advantage over traditional logic synthesis systems.

[1]  Shih-Chieh Chang,et al.  Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Ingo Wegener,et al.  On the complexity of minimizing the OBDD size for incompletely specified functions , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Sarma Vrudhula,et al.  EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  D. Bochmann,et al.  A new decomposition method for multilevel circuit design , 1991, Proceedings of the European Conference on Design Automation..

[5]  Malgorzata Marek-Sadowska,et al.  Multilevel logic synthesis for arithmetic functions , 1996, 33rd Design Automation Conference Proceedings, 1996.

[6]  Tsutomu Sasao,et al.  FPGA Design by Generalized Functional Decomposition , 1993 .

[7]  Olivier Coudert,et al.  New Ideas for Solving Covering Problems , 1995, 32nd Design Automation Conference.

[8]  Maciej J. Ciesielski,et al.  BDS: a BDD-based logic optimization system , 2000, DAC.

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

[10]  K. Karplus.  Using if-then-else DAGs for multi-level logic minimization , 1989 .

[11]  Marek A. Perkowski,et al.  New multivalued functional decomposition algorithms based on MDDs , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Carl Sechen,et al.  Boolean division and factorization using binary decision diagrams , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Bernd Steinbach,et al.  An algorithm for bi-decomposition of logic functions , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

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

[15]  Yamashita,et al.  Pass-transistor/CMOS Collaborated Logic: The Best Of Both Worlds , 1997, Symposium 1997 on VLSI Circuits.

[16]  Sarma B. K. Vrudhula,et al.  BDD Based Decomposition of Logic Functions with Application to FPGA Synthesis , 1993, 30th ACM/IEEE Design Automation Conference.

[17]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, ICCAD 1990.

[18]  Valeria Bertacco,et al.  The disjunctive decomposition of logic functions , 1997, ICCAD 1997.

[19]  Richard L. Rudell.  Tutorial: design of a logic synthesis system , 1996, 33rd Design Automation Conference Proceedings, 1996.

[20]  Suku Nair,et al.  Behavioral synthesis of combinational logic using spectral-based heuristics , 1999, TODE.

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

[22]  Congguang Yang,et al.  Synthesis for mixed CMOS/PTL logic , 2000, Proceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537).

[23]  Adnan Aziz,et al.  Area-oriented synthesis for pass-transistor logic , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).

[24]  Massoud Pedram,et al.  OBDD-based function decomposition: algorithms and implementation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[25]  Giovanni De Micheli,et al.  Algorithms for technology mapping based on binary decision diagrams and on Boolean operations , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[27]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[28]  Shin-ichi Minato,et al.  Fast factorization method for implicit cube set representation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[29]  Fabio Somenzi,et al.  Logic synthesis and verification algorithms , 1996 .

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

[31]  Maciej J. Ciesielski,et al.  BDD decomposition for efficient logic synthesis , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[32]  Tiziano Villa,et al.  Exact Minimization of Binary Decision Diagrams Using Implicit Techniques , 1998, IEEE Trans. Computers.

[33]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[34]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[35]  Carl Sechen,et al.  Quasi-algebraic decompositions of switching functions , 1995, Proceedings Sixteenth Conference on Advanced Research in VLSI.

[36]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[37]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.