Functional composition: A new paradigm for performing logic synthesis

This paper presents the functional composition (FC), a new paradigm for combinational logic synthesis. FC is based on the following principles: (1) representation of logic functions as a bonded pair of functional/structural representations; (2) it starts from a set of initial functions; (3) simpler functions are associated to create more complex ones; (4) a partial order that enables dynamic programming is respected; (5) a set of allowed functions is maintained to reduce execution time/memory consumption. We present functional composition algorithms variants for Boolean factoring, AIG rewriting, minimum decision chain computation and SOP generation.

[1]  A. I. Reis,et al.  Automatic generation of digital cell libraries , 2002, Proceedings. 15th Symposium on Integrated Circuits and Systems Design.

[2]  Renato P. Ribas,et al.  Constructive AIG optimization considering input weights , 2011, 2011 12th International Symposium on Quality Electronic Design.

[3]  Andre I. Reis,et al.  Covering strategies for library free technology mapping , 1999, Proceedings. XII Symposium on Integrated Circuits and Systems Design (Cat. No.PR00387).

[4]  Robert K. Brayton,et al.  Delay optimization using SOP balancing , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

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

[6]  Mayler G. A. Martins,et al.  Boolean factoring with multi-objective goals , 2010, 2010 IEEE International Conference on Computer Design.

[7]  Lech Józwiak,et al.  Technology Library Modelling for Information-driven Circuit Synthesis , 2008, 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools.

[8]  Lech Jozwiak,et al.  Decompositional logic synthesis approach for look up table FPGAs , 1995, Proceedings of Eighth International Application Specific Integrated Circuits Conference.

[9]  André Inácio Reis,et al.  Advanced technology mapping for standard-cell generators , 2004, Proceedings. SBCCI 2004. 17th Symposium on Integrated Circuits and Systems Design (IEEE Cat. No.04TH8784).

[10]  Jan Hlavicka,et al.  BOOM-a heuristic Boolean minimizer , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[11]  André I. Reis,et al.  Classifying n-Input Boolean Functions , 2001 .

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

[13]  Martin Charles Golumbic,et al.  Factoring logic functions using graph partitioning , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

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

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

[16]  R. Brayton,et al.  FRAIGs: A Unifying Representation for Logic Synthesis and Verification , 2005 .

[17]  Martin Charles Golumbic,et al.  Factoring Boolean functions using graph partitioning , 2005, Discret. Appl. Math..

[18]  Robert K. Brayton,et al.  DAG-aware AIG rewriting: a fresh look at combinational logic synthesis , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

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

[20]  Lech Jozwiak,et al.  High-Quality Circuit Synthesis for Modern Technologies , 2008, ISQED 2008.

[21]  Mayler G. A. Martins,et al.  Efficient method to compute minimum decision chains of Boolean functions , 2011, GLSVLSI '11.

[22]  Robert K. Brayton,et al.  Reducing structural bias in technology mapping , 2006, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[23]  Themistoklis Haniotakis,et al.  A Methodology for Transistor-Efficient Supergate Design , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.