Synthesis of combinatorial functions
Logic operators - Foundations
Article REF: E180 V1
Synthesis of combinatorial functions
Logic operators - Foundations

Author : Daniel ETIEMBLE

Publication date: November 10, 2004, Review date: July 13, 2023 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

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...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Article included in this offer

"Electronics"

( 262 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact our team FAQ