Two-Level and Multilevel Approximate Logic Synthesis

Two-Level Logic Synthesis for Probabilistic Computation∗

A classical problem in logic synthesis is to find a sum-of-product (SOP) Boolean expression with the minimum number of product terms that implements a Boolean function. In this paper, we focus on a related yet different synthesis problem targeted toward probabilistic computation. In our scenario, we want to synthesize a Boolean function that covers an exact number of minterms, say m minterms. T...

Empirical Learning of Boolean Functions Using Two-Level Logic Synthesis

Most approaches to the design of networks that learn from examples don’t address the architecture design problem except as a side issue. Logic synthesis techniques can be used to derive both the structure and the connection patterns for a network that matches the examples in the training set while minimizing some cost function such as the size of the network. This cost function yields a very ef...

A Heuristic Method of Two-Level Logic Synthesis

An original method of logic function minimization is presented. Its implementation denoted as BOOM minimizer is described an evaluated. The method is applicable to the problems of logic design, artificial intelligence, software engineering and graph theory, etc. The innovative feature of the proposed method consists above all in the top-down approach to implicant generation by inclusion of lite...

Automated Synthesis and Optimization of Multilevel Logic Circuits

Multilevel Logic Synthesis for Cellular FPGAs Based on Orthogonal Expansions

The cellular ne grain architectures of new Field Programmable Gate Arrays FPGAs require spe cial logic synthesis tools Therefore this paper ad dresses multilevel logic synthesis methods based on or thogonal expansions for such kind of architectures First the concepts of the Binary Decision Diagrams BDDs their derivatives and the Functional De cision Diagrams FDDs which are applied to the techno...