OBDD-based function decomposition: algorithms and implementation

This paper presents algorithms for disjunctive and nondisjunctive decomposition of Boolean functions and Boolean methods for identifying common subfunctions from multiple Boolean functions. Ordered binary decision diagrams are used to represent and manipulate Boolean functions so that the proposed methods can be implemented concisely. These techniques are applied to the synthesis of look-up table based field programmable gate arrays and results are presented.

[1]  Janusz Rajski,et al.  A method for concurrent decomposition and factorization of Boolean expressions , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

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

[4]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Shih-Chieh Chang,et al.  Technology Mapping via Transformations of Function Graphs , 1992, ICCD.

[6]  Mary Jane Irwin,et al.  Efficiently computing communication complexity for multilevel logic synthesis , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Gabriele Saucier,et al.  Input-driven partitioning methods and application to synthesis on table-lookup-based FPGAs , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Massoud Pedram,et al.  FPGA synthesis using function decomposition , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[9]  Peter Weiner,et al.  A Fast Algorithm for the Disjunctive Decomposition of Switching Functions , 1971, IEEE Transactions on Computers.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[13]  Kevin Karplus.  Xmap: a technology mapper for table-lookup field-programmable gate arrays , 1991, 28th ACM/IEEE Design Automation Conference.

[14]  Rajeev Murgai,et al.  Improved logic synthesis algorithms for table look up architectures , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

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

[16]  Jonathan Rose,et al.  Chortle-crf: fast technology mapping for lookup table-based FPGAs , 1991, 28th ACM/IEEE Design Automation Conference.

[17]  Wen-Zen Shen,et al.  Coalgebraic division for multilevel logic synthesis , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[18]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[20]  R. Karp.  Functional Decomposition and Switching Circuit Design , 1963 .

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