High-quality sub-function construction in the information-driven circuit synthesis with gates

The opportunities created by modern microelectronic technology cannot effectively be exploited, because of weaknesses in traditional circuit synthesis methods used in today's CAD tools. In this paper, a new information-driven circuit synthesis method is discussed that targets combinational circuits implemented with gates. The synthesis method is based on our original information-driven approach to circuit synthesis, bottom-up general functional decomposition and theory of information relationship measures, and considerably differs from all other known methods. The discussion is focused on various sub-function construction methods used during the synthesis. The experimental results from the automatic circuit synthesis tool that implements the method show that the developed by us specific sub-function construction methods targeted to the gate-based circuits deliver much better circuits than the other methods and demonstrate that the information-driven general decomposition produces very fast and compact gate-based circuits.

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

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

[3]  Tadeusz Luba,et al.  Decomposition of Boolean Functions Specified by Cubes , 2003, J. Multiple Valued Log. Soft Comput..

[4]  Lech Józwiak,et al.  General decomposition of incompletely specified sequential machines with multi-state behavior realization , 2004, J. Syst. Archit..

[5]  Logic synthesis and verification [Book Review] , 2003, IEEE Circuits and Devices Magazine.

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

[7]  Lech Jóźwiak,et al.  General Decomposition and Its Use in Digital Circuit Synthesis , 1995 .

[8]  Lech Józwiak,et al.  High-quality sub-function construction in functional decomposition based on information relationship measures , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

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

[10]  Carl Sechen,et al.  A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis , 1995, 32nd Design Automation Conference.

[11]  Mariusz Rawski,et al.  Functional decomposition with an efficient input support selection for sub-functions based on information relationship measures , 2001, J. Syst. Archit..

[12]  Lech Józwiak,et al.  Technology driven multilevel logic synthesis based on functional decomposition into gates , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

[13]  Lech Józwiak,et al.  Information relationships and measures: an analysis apparatus for efficient information system synthesis , 1997, EUROMICRO 97. Proceedings of the 23rd EUROMICRO Conference: New Frontiers of Information Technology (Cat. No.97TB100167).

[14]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[15]  Lech Józwiak,et al.  Functional decomposition based on information relationship measures extremely effective for symmetric functions , 1999, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium.

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

[17]  Lech Józwiak,et al.  Information relationships and measures in application to logic design , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

[18]  H. Allen Curtis.  A Generalized Tree Circuit , 1961, JACM.

[19]  Lech Józwiak.  An Efficient Heuristic Method for State Assignment of Large Sequential Machines , 1992, J. Circuits Syst. Comput..

[20]  Hiroshi Sawada,et al.  Logic Synthesis for Look-Up Table Based FPGAs Using Functional Decomposition and Boolean Resubstitution (Special Issue on Synthesis and Verification of Hardware Design) , 1997 .

[21]  Mpj Mario Stevens,et al.  Division-Based Versus General Decomposition-Based Multiple-Level Logic Synthesis , 1995 .

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

[23]  Lech Józwiak,et al.  Effective and efficient FPGA synthesis through functional decomposition based on information relationship measures , 2001, Proceedings Euromicro Symposium on Digital Systems Design.

[24]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[25]  Ulf Schlichtmann,et al.  Functional multiple-output decomposition with application to technology mapping for lookup table-based FPGAs , 1999, TODE.

[26]  Lech Jozwiak,et al.  Input support minimization for efficient PLD and FPGA synthesis , 1996 .

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

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

[29]  Lech Józwiak,et al.  Multi-valued sub-function encoding in functional decomposition based on information relationships measures , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[30]  L. Jozwiak,et al.  An efficient method for decomposition of multiple-output Boolean functions and assigned sequential machines , 1992, [1992] Proceedings The European Conference on Design Automation.

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