A Method to Realize Logic Functions using LUTs and OR Gates

This paper introduces a new decomposition method called OR-partitioning, where a logic function is realized as an OR of disjoint sub-functions. This paper also compares three methods to decompose a logic function: The first one is standard functional decomposition; the second one is functional decomposition combined with the Shannon expansion; and the third one is functional decomposition combined with OR-partitioning. The experimental results using many benchmark functions show that functional decomposition combined with OR-partitioning requires smaller amount of memory than functional decomposition combined with the Shannon expansion when LUTs are used to realize functions.

[1]  Saburo Muroga,et al.  Logic design and switching theory , 1979 .

[2]  Hiroshi Sawada,et al.  Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization , 1995, ICCAD.

[3]  Rajeev Murgai,et al.  Logic synthesis for a single large look-up table , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

[4]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[5]  Tsutomu Sasao.  Totally undecomposable functions: applications to efficient multiple-valued decompositions , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

[6]  Mary Jane Irwin,et al.  Logic synthesis for field-programmable gate arrays , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Giovanni De Micheli,et al.  Finding all simple disjunctive decompositions using irredundant sum-of-products forms , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[8]  Jie-Hong Roland Jiang,et al.  Compatible class encoding in hyper-function decomposition for FPGA synthesis , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

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

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

[11]  Klaus Eckl,et al.  Functional Multiple-Output Decomposition: Theory and an Implicit Algorithm , 1995, 32nd Design Automation Conference.

[12]  Tsutomu Sasao,et al.  Switching Theory for Logic Synthesis , 1999, Springer US.

[13]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[14]  Tsutomu Sasao.  A cascade realization of multiple-output function for reconfigurable hardware , 2001 .

[15]  Shin-ichi Minato,et al.  Minimum-Width Method of Variable Ordering for Binary Decision Diagrams , 1992 .

[16]  Yusuke Matsunaga.  An Exact and Efficient Algorithms for Disjunctive Decomposition , 1998 .

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

[18]  Christoph Scholl,et al.  Communication based FPGA synthesis for multi-output Boolean functions , 1995, ASP-DAC '95.

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

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

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

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