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...
The Ultimate Scientific and Technical Reference
This article is included in
Electronics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Synthesis of combinatorial functions
Arithmetic operators
Bibliographical reference
The Ultimate Scientific and Technical Reference
