2. Synthesis of combinatorial functions
Combinatorial function synthesis involves taking a truth table or Boolean expression and specifying the hardware operators needed to implement the corresponding table or expression. There are three main methods of synthesizing combinatorial functions, corresponding to the level of complexity of the logic operators used as building blocks.
2.1 Anarchic" logic
The so-called "anarchic logic" consists of "implementing" the Boolean function using a minimal set of basic gates: AND, OR, inverters, or NAND or NOR... This method was developed in the era of low- and medium-scale logic circuits (SSI Small Scale Integration and MSI Medium Scale Integration).
We begin by simplifying the complete expression deduced from the normal disjunctive form to...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Synthesis of combinatorial functions
Arithmetic operators
Bibliographical reference
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Article included in this offer
"Electronics"
(
268 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
