Constructive library-aware synthesis using symmetries

In this paper a constructive library-aware multilevel logic synthesis approach using symmetries is described. It integrates the technology-independent and technology dependent stages of synthesis, and is premised on the goal of relating the functional structure of a logic specification closer to the ultimate topological and physical structures. We show that symmetries interpreted as structural attributes of functions can be effectively used to induce a favorable structural implementation. These symmetries are used in bridging (1) the structural properties of the functions being synthesized, (2) the structural attributes of the implementation network, and (3) the functional content of the target library. Experimental results show that the quality of circuits synthesized using this approach is generally superior to those synthesized by traditional approaches, and that the improvement correlates with the symmetry measure in a function.

[1]  S. L. Hurst,et al.  A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods , 1978, IEEE Transactions on Computers.

[2]  Bo-Gwan Kim,et al.  Multilevel logic synthesis of symmetric switching functions , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[4]  Luca Benini,et al.  Iterative remapping for logic circuits , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[6]  Dominik Stoffel,et al.  Reasoning in Boolean Networks - Logic Synthesis and Verification Using Testing Techniques , 1997, Frontiers in electronic testing.

[7]  Donald L. Dietmeyer,et al.  Identification ofSymmetry, Redundancy and Equivalence ofBoolean Functions , 1967 .

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

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

[10]  Yosinori Watanabe,et al.  Logic decomposition during technology mapping , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Rolf Drechsler,et al.  BDD minimization using symmetries , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[13]  Michael Weber,et al.  Detection of symmetry of Boolean functions represented by ROBDDs , 1993, ICCAD '93.

[14]  Hiroshi Sawada,et al.  Restructuring logic representations with easily detectable simple disjunctive decompositions , 1998, Proceedings Design, Automation and Test in Europe.

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

[16]  J. Grodstein,et al.  Logic decomposition during technology mapping , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[17]  Michael Weber,et al.  Detection of symmetry of Boolean functions represented by ROBDDs , 1993, ICCAD.

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

[19]  Yosinori Watanabe,et al.  Logic decomposition during technology mapping , 1995, ICCAD.

[20]  Donald L. Dietmeyer,et al.  Identification of Symmetry, Redundancy and Equivalence of Boolean Functions , 1967, IEEE Trans. Electron. Comput..

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