Encoding of Boolean Functions and its Application to LUT Cascade Synthesis

The problem of encoding arises in several areas of logic synthesis. Due to the nature of this problem, it is often difficult to systematically explore the space of all feasible encodings in order to find an optimal one. In this paper, we show that when the objects to be encoded are Boolean functions, it is possible to formulate and solve the problem optimally. We present a general approach to the encoding problem with one or more code-bit functions having some desirable properties. The method allows for an efficient implementation using branch-and-bound procedure coupled with specialized BDD operators. The proposed approach was used to synthesize look-up table (LUT) cascades implementing Boolean functions. Experimental results show that it finds optimal solutions for complex encoding problems in less than a second of CPU time.

[1]  James H. Tracey.  Internal State Assignments for Asynchronous Sequential Machines , 1966, IEEE Trans. Electron. Comput..

[2]  Robert K. Brayton,et al.  Optimum Functional Decomposition Using Encoding , 1994, 31st Design Automation Conference.

[3]  Klaus Eckl,et al.  Computing support-minimal subfunctions during functional decomposition , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[4]  Tsutomu Sasao,et al.  A New Expansion of Symmetric Functions and Their Application to Non-Disjoint Functional Decompositions for LUT Type FPGAs , 2000 .

[5]  Tadeusz Luba,et al.  Decomposition of multiple-valued functions , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

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

[7]  Karem A. Sakallah,et al.  Constructive library-aware synthesis using symmetries , 2000, DATE '00.

[8]  Robert K. Brayton,et al.  An efficient heuristic procedure for solving the state assignment problem for event-based specifications , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Malgorzata Marek-Sadowska,et al.  Decomposition of Multiple-Valued Relations , 1997, ISMVL.

[10]  Douglas Hall,et al.  A new functional decomposition method as applied to machine learning and vlsi layout , 2000 .

[11]  Munehiro Matsuura,et al.  On a Method to Reduce the Number of LUTs in LUT cascades , 2001 .

[12]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.