Function Decomposition and Synthesis

In order to simplify a synthesis task for particularly hard functions it is sometimes inevitable to decompose the function in a preprocessing step. We propose a new algorithm for automatically decomposing a target function by extracting a linear filter within the synthesis process. The algorithm is an application of the Linear Sifting algorithm which has been proposed in [6]. Using this method we were able to synthesize functions with standard tools which fail otherwise.

[1]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.

[2]  Christoph Meinel,et al.  Linear sifting of decision diagrams , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[3]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[4]  S. Minato.  Binary Decision Diagrams and Applications for VLSI CAD , 1995 .

[5]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[6]  Stanley L. Hurst,et al.  Spectral techniques in digital logic , 1985 .

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

[8]  Shin-ichi Minato,et al.  Fast factorization method for implicit cube set representation , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  E. A. Trachtenberg,et al.  Design automation tools for efficient implementation of logic functions by decomposition , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..