In this chapter we will provide a rigorous survey of the basics of modern multi-level logic synthesis. We will describe first the setting of the problem based on the abstraction of a Boolean network and on factored forms of Boolean functions. Then we will describe Boolean division, for completely specified and incompletely specified Boolean functions, and heuristic algorithms to perform it. Next we will describe algebraic division, introducing weak algebraic division, and we will discuss how to find common algebraic divisors by restricting the search to kernels and other subsets of divisors. Finally we will show how division can be the engine of the main operations to restructure a Boolean network, namely factoring, decomposition, substitution and extraction.

### Synthesis of multi-level Boolean networks

#### Abstract

In this chapter we will provide a rigorous survey of the basics of modern multi-level logic synthesis. We will describe first the setting of the problem based on the abstraction of a Boolean network and on factored forms of Boolean functions. Then we will describe Boolean division, for completely specified and incompletely specified Boolean functions, and heuristic algorithms to perform it. Next we will describe algebraic division, introducing weak algebraic division, and we will discuss how to find common algebraic divisors by restricting the search to kernels and other subsets of divisors. Finally we will show how division can be the engine of the main operations to restructure a Boolean network, namely factoring, decomposition, substitution and extraction.
##### Scheda breve Scheda completa Scheda completa (DC)
Logic synthesis; multi-level logic; Boolean and algebraic division
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/11562/335177`
• ND
• ND
• ND