BDS: a BDD-based logic optimization system

This paper describes a new BDD-based logic optimization system, BDS. It is based on a recently developed theory for BDD-based logic decomposition, which supports both algebraic and Boolean factorization. New techniques, which are crucial to the manipulation of BDDs in a partitioned Boolean network environment, are described in detail. The experimental results show that BDS has a capability to handle very large circuits. It offers a superior runtime advantage over SIS, with comparable results in terms of circuit area and often improved delay.

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

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

[3]  Maciej J. Ciesielski,et al.  BDS: a BDD-based logic optimization system , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[5]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

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

[7]  Bernd Becker,et al.  On optimizing BIST-architecture by using OBDD-based approaches and genetic algorithms , 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

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

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

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

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

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

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

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

[15]  Hiroshi Sawada,et al.  Minimization of binary decision diagrams based on exchanges of variables , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

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

[17]  Richard Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD.

[18]  Valeria Bertacco,et al.  The disjunctive decomposition of logic functions , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

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

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

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

[22]  Nur A. Touba,et al.  Test point insertion based on path tracing , 1996, Proceedings of 14th VLSI Test Symposium.

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

[24]  Russell Tessier,et al.  BDD-based logic synthesis for LUT-based FPGAs , 2002, TODE.

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

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

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

[28]  Masahiro Fujita,et al.  On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..

[29]  Jason Cong,et al.  Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[30]  G. Boole.  An Investigation of the Laws of Thought: On which are founded the mathematical theories of logic and probabilities , 2007 .

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

[32]  Yang Maciej Ciesielski.  SYNTHESIS FOR MIXED CMOS/PTL LOGIC: PRELIMINARY RESULTS , 1999 .

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

[34]  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).

[35]  Janak H. Patel,et al.  Reducing test application time for built-in-self-test test pattern generators , 2000, Proceedings 18th IEEE VLSI Test Symposium.

[36]  Jason Cong,et al.  Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs , 1993, ICCAD.

[37]  Sze-Tsen Hu.  ON THE DECOMPOSITION OF SWITCHING FUNCTIONS , 1961 .

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

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

[40]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

[42]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

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

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

[45]  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).

[46]  Richard L. Rudell.  Design of a logic synthesis system (tutorial) , 1996, DAC 1996.

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

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